Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Explore this paper's citation graph
Summary
The authors solve the problem of scheduling a set of tasks whose operational precedence structure is representable as an acyclic directed graph and proof of an efficient algori thm for finding the minimal-length preemptive schedule for tree-structured computations.
- Type
- article
- Published
- 1970-04-01
- Cited by
- 191
- References
- 15
- Access
- Open access
- OpenAlex
- https://openalex.org/W2028754841
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:18740570
Keywords
Multiprocessing, Citation, Computer science, Scheduling (production processes), Operations research
References
- Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings
- Organization of computer systems: the fixed plus variable structure computer
- Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model
- Production and Stabilization of Real-Time Task Schedules
- Parallel Sequencing and Assembly Line Problems
- Scheduling with Deadlines and Loss Functions
- Experiments on Models of Computations and Systems
- Bounds for certain multiprocessing anomalies
- Models of Computational Systems-Cyclic to Acyclic Graph Transformations
- Sequencing Aspects of Multiprogramming
- Bounds on parallel‐processing of queues with multiple‐phase jobs
- Generalized multiprocessing and multiprogramming systems
- Journal of the Association for Computing Machinery
Cited by
- A Review of Machine Scheduling: Complexity, Algorithms and Approximability
- Scheduling parallel tasks withsequential heads and tails
- Parallel machines scheduling with applications to Internet ad-slot placement
- Placement, ordonnancement et mécanismes de migration de tâches temps-réel pour des architectures distribuées multicoeurs. (Real-time tasks assignment, scheduling and migration mechanisms for multicore distributed architectures)
- A Relation between Multiprocessor Scheduling and Linear Programming
- Some execution-time properties of optimal schedules in multiprocessor systems.
- Algorithmique rapide pour les problèmes de tournées et d'ordonnancement. (Time-salving algorithms for vehicule routing and scheduling problems)
- Research Directions in Real-Time Systems.
- Distributed hard real-time scheduling for a software prototyping environment
- Antwortzeitgesteuerte Prozessorzuteilung unter strengen Zeitbedingungen
- Optimisation d'un réseau de production et de distribution
- iPRIDE: a parallel integrated circuit simulator using direct method
- AN INPUT/OUTPUT ARCHITECTURE FOR VIRTUAL MEMORY COMPUTER SYSTEMS
- Operating system resource reservation for real-time and multimedia applications
- Sequencing and scheduling: algorithms and complexity
- Optimal Granularity of Parallel Evaluation of AND Trees
- A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling
- Delay-Sensitive Service Request Scheduling for Cloud Computing
- Guardian: Decentralized control of an embedded multimicroprocessor
- Interval assignment for periodic transactions in real-time database systems
Related papers
- Citation Form in Transition: The ALWD Citation Manual
- A Research on Citation Standard
- The Evolution of Principia Mathematica; Bertrand Russell's Manuscripts and Notes for the Second Edition
- Citation Managers
- A Non-Peshitta Jeremiah Citation by Aphrahat
- Research on the Phenomenon of Articles' Delayed Citation
- Two Approaches to Scheduling Container Ships with an Application to the North Atlantic Route
- Heuristic Scheduling of Ship Replenishment at Sea
- Heuristic Scheduling of Ship Replenishment at Sea