UET scheduling with unit interprocessor communication delays
نویسنده
چکیده
We consider the problem of scheduling a partially ordered set of unit execution time (UET) tasks on m > 1 processors where there is a communication delay of unit time between any pair of distinct processors. We show that the problem of finding an optimal schedule is NP-hard. A greedy schedule is one where no processor remains idle if there is some task available which it c satisfies could process. We establish that the length of an arbitrary greedy schedule, tOg (l
منابع مشابه
Scheduling UET, UCT dags with release dates and deadlines
The problem of scheduling precedence graphs for which every task has to be executed in a non-uniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that nds minimumlateness schedules. 1. Outforests on two processors. 2. Series-parallel graphs and opposing forests with the least urgent parent prope...
متن کاملOn the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
We consider the unit execution time unit communication time (UET-UCT) schedulingmodelwith hierarchical communications [1], and we study the impact of the hierarchical communications hypothesis on the hardness of approximation. We prove that there is no polynomial time approximation algorithm with performance guarantee smaller than 5/4 (unless P = NP). This result is an extension of the result o...
متن کاملScheduling Precedence Graphs in Systems with Interprocessor Communication Times
The problem of nonpreemptively scheduling a set of rn partially ordered tasks on n identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that the makespan wEx-generated by ETF always satisfies to Eq.. (2 1/n wopti) + C, where Wopti) is the opti...
متن کاملScheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملSensitivity analysis of tree scheduling on two machines with communication delays
This paper presents a sensitivity analysis for the problem of scheduling UET trees with communication delays on two identical processors, to minimize the makepan. Indeed, actual communication delays may not be precisely known before the execution. The paper compares the optimal makespans with and without communication delays. This is used to get sensitivity bounds for algorithms optimal in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 18 شماره
صفحات -
تاریخ انتشار 1987