Algorithms for arbitrating and scheduling transmissions from different transmitters sharing a common access medium arise often in the design of many shared and distributed systems. In this paper we present a distributed algorithm for arbitrating time-constrained transmissions on slotted shared acces
A schedulability algorithm for data flow, hard-real-time distributed programs
β Scribed by R Davoli; L.A Giachini
- Publisher
- Elsevier Science
- Year
- 1994
- Weight
- 488 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0066-4138
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method
## Abstract In this article, an efficient and novel approach for video data association is developed. This new method is formulated as a search across the hypotheses space defined by the possible association among tracks and detections, carried out for each frame of a video sequence. The full data