Periodic multiprocessor scheduling

This publication has 24 references indexed in Scilit:

• Scheduling periodic and sporadic tasks in a real-time system
  Information Processing Letters, 1989
• Optimal schedules for periodically recurring events
  Discrete Applied Mathematics, 1986
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
  Discrete Applied Mathematics, 1985
• Approximation Algorithms for Bin-Packing — An Updated Survey
  Published by Springer Nature ,1984
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
  Information Processing Letters, 1983
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
  Operations Research, 1981
• Cyclic Scheduling via Integer Programs with Circular Ones
  Operations Research, 1980
• The Complexity of Coloring Circular Arcs and Chords
  SIAM Journal on Algebraic Discrete Methods, 1980
• On a Real-Time Scheduling Problem
  Operations Research, 1978
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965