Scheduling in Multiprocessor Systems with Additional Restrictions
An admissible multiprocessor preemptive scheduling problem is solved for the given execution intervals. In addition, a number of generalizations are considered—interprocessor communications are arbitrary and may vary in time; costs for processing interruptions and switches from one processor to another are taken into account; and besides the processors, additional resources are used. Algorithms based on reducing the original problem to finding paths of a specific length in a graph, a flow problem, and an integer system of linear restrictions are developed.
Unable to display preview. Download preview PDF.
- 1.V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory. One-Stage Systems (Nauka, Moscow, 1984) [in Russian].Google Scholar
- 22.D. T. Fillips and A. Garcia-Diaz, Fundamentals of Network Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1981).Google Scholar