Communication contention in task scheduling

Task scheduling is an essential aspect of parallel programming. Most heuristics for this NP-hard problem are based on a simple system model that assumes fully connected processors and concurrent interprocessor communication. Hence, contention for communication resources is not considered in task sch...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 16; no. 6; pp. 503 - 515
Main Authors:	Sinnen, O., Sousa, L.A.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2005 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Communication communication contention Communication networks Communications networks concurrent programming Delay heterogeneous system model Network topology NP-hard problem Parallel processing Parallel programming Processor scheduling Proposals Reflection Routing scheduling and task partitioning Studies
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!