Optimal Preemptive Scheduling in Multiprocessor Systems with Incomplete Communication Graph |
| |
| Authors: | B. V. Grechuk M. G. Furugyan |
| |
| Affiliation: | (1) Physicotechnical Institute, Moscow, Russia;(2) Computer Center, Russian Academy of Sciences, Moscow, Russia |
| |
| 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. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 94–102, May–June 2005. |
| |
| Keywords: | optimal preemptive schedule multiprocessor system incomplete communication graph |
| 本文献已被 SpringerLink 等数据库收录！ |
|
