Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations

The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on software engineering Ročník 19; číslo 2; s. 139 - 154
Hlavní autor:	Xu, J.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.02.1993 Institute of Electrical and Electronics Engineers IEEE Computer Society
Témata:	Algorithm design and analysis Algorithms Applied sciences Automation Computer science Computer science; control theory; systems Deadlines Exact sciences and technology Heuristic Information processing Microprocessors Processor scheduling Runtime Schedules Scheduling Scheduling algorithm Software Software engineering Studies Systems development Timing Multiprocessor Scheduling Algorithm Real time system Priority
ISSN:	0098-5589, 1939-3520
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!

Buďte první, kdo okomentuje tento záznam!