Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

DOI10.1145/321574.321586MaRDI QIDQ5620334zbMATH OpenOpenAlexFDO

Authors Richard R. Muntz, E. 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)

Cited in

(37)

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

This page was built for publication: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5620334)