A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

We attempt a new variant of the scheduling problem by investigating the scalability of the schedule length with the required number of processors, by performing scheduling partially at compile time and partially at run time. Assuming infinite number of processors, the compile time schedule is found...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 6; no. 4; pp. 388 - 399
Main Authors:	Pande, S., Agrawal, D.P., Mauney, J.
Format:	Journal Article
Language:	English
Published:	Los Alamitos, CA IEEE 01.04.1995 IEEE Computer Society
Subjects:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Costs Delay effects Dynamic scheduling Exact sciences and technology Multiprocessing systems Optimal scheduling Parallel processing Processor scheduling Runtime Scalability Scheduling algorithm Software Software engineering Multiprocessor Distributed memory multiprocessor system Graph Parallelism Scheduling Distributed system Data flow
ISSN:	1045-9219
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!