Optimal Preemptive Scheduling in Multiprocessor Systems with Incomplete Communication Graph

Authors:
B. V. Grechuk;M. G. Furugyan
Affiliations:
Physicotechnical Institute, Moscow, Russia;Computer Center, Russian Academy of Sciences, Moscow, Russia
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 4
Cited 0

Preemptive scheduling of uniform machines by ordinary network flow techniques

Management Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of work scheduling in a multiprocessor system is solved with specific processing requirement, release time and due date. Interruptions and preemptions are given. The communication graph may be incomplete. A polynomial algorithm of determining a feasible schedule is developed.