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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 51; no. 2; pp. 301 - 306
Main Authors:	Ali, H.H., Elrewini, H.
Format:	Journal Article
Language:	English
Published:	Brugge Elsevier Inc 01.10.1995 Academic Press
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!