Optimal scheduling algorithm for distributed-memory machines

Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature....

Full description

Bibliographic Details

Published in:	IEEE transactions on parallel and distributed systems Vol. 9; no. 1; pp. 87 - 95
Main Authors:	Darbha, S., Agrawal, D.P.
Format:	Journal Article
Language:	English
Published:	IEEE 01.01.1998
Subjects:	Communications technology Computational efficiency Cost function Heuristic algorithms NP-hard problem Optimal scheduling Polynomials Processor scheduling Scheduling algorithm Very large scale integration
ISSN:	1045-9219
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!