Scheduling tasks with AND/OR precedence constraints

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The authors allow certain tasks, known as OR tasks, to be ready when just one of their predecessors is complete. They analyze the complexity of two t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 394 - 401
Hlavní autoři: Gillies, D.W., Liu, J.W.-S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
Algorithm design and analysis
Computer science
Fasteners
Heuristic algorithms
Job shop scheduling
Magnetic heads
Performance analysis
Processor scheduling
Real time systems
Scheduling algorithm
ISBN:0818620870, 9780818620874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The authors allow certain tasks, known as OR tasks, to be ready when just one of their predecessors is complete. They analyze the complexity of two types of real-time AND/OR task scheduling problems. In the first type of problem, all predecessors of every OR task must eventually be completed, but in the second type of problem, some OR predecessors may be left unscheduled. The authors present two priority-driven heuristic algorithms that may be used to schedule AND/OR task systems on m processors to minimize completion time, and analyze the worst-case performance of these algorithms.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143572