Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

DOI10.1145/321574.321586zbMath0216.49702OpenAlexW2028754841MaRDI QIDQ5620334

Richard R. Muntz, Edward G. jun. Coffman

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321574.321586

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Towards Tight Lower Bounds for Scheduling Problems, Nearly on line scheduling of preemptive independent tasks, Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines, Real-time scheduling of linear speedup parallel tasks, Rational preemptive scheduling, Is a unit-job shop not easier than identical parallel machines?, Open shop problems with unit time operations, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Scheduling multiprocessor tasks on parallel processors with limited availability., Efficient scheduling of tasks without full use of processor resources, A survey of scheduling methods for multiprocessor systems, Robust algorithms for preemptive scheduling, A genetic algorithm for task scheduling on NoC using FDH cross efficiency, Scheduling with limited machine availability, Online scheduling of equal-processing-time task systems, PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES, Optimal preemptive scheduling on a fixed number of identical parallel machines, New applications of the Muntz and Coffman algorithm, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, Optimal scheduling of homogeneous job systems, A graph model for scheduling processes in systems with parallel computations, Ideal schedules in parallel machine settings, Antwortzeitgesteuerte Prozessorzuteilung unter strengen Zeitbedingungen, Preemptive scheduling and antichain polyhedra, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Preemptive scheduling with variable profile, precedence constraints and due dates, Scheduling chain-structured tasks to minimize makespan and mean flow time, Makespan minimization with OR-precedence constraints, Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time, Minimizing the number of machines for minimum length schedules, Scheduling preemptive jobs with precedence constraints on parallel machines, How small are shifts required in optimal preemptive schedules?, Linear and quadratic algorithms for scheduling chains and opposite chains, Scheduling multiprocessor tasks on two parallel processors