An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors

The problem of scheduling task graphs on multiprocessor systems have received considerable attention in recent years. This problem is known to be NP-hard in its general form as well as many restricted cases. Few polynomial algorithms have been developed for solving special cases of the scheduling pr...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computer and system sciences Ročník 51; číslo 2; s. 301 - 306
Hlavní autori:	Ali, H.H., Elrewini, H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Brugge Elsevier Inc 01.10.1995 Academic Press
Predmet:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Software Multiprocessor Optimal algorithm NP hard problem Task scheduling Time interval Scheduling Communication graph Complexity Execution time
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!