DSC: scheduling parallel tasks on an unbounded number of processors
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 5 (9), 951-967
- https://doi.org/10.1109/71.308533
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Program Partitioning for NUMA Multiprocessor Computer SystemsJournal of Parallel and Distributed Computing, 1993
- Performance modeling of sparse matrix methods for distributed memory architecturesLecture Notes in Computer Science, 1992
- C.P.M. Scheduling with Small Communication Delays and Task DuplicationOperations Research, 1991
- Hypertool: a programming aid for message-passing systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Towards an Architecture-Independent Analysis of Parallel AlgorithmsSIAM Journal on Computing, 1990
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraintsEuropean Journal of Operational Research, 1989
- Automatic determination of grain size for efficient parallel processingCommunications of the ACM, 1989
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989
- Partitioning programs for parallel executionPublished by Association for Computing Machinery (ACM) ,1988
- Grain size determination for parallel processingIEEE Software, 1988