Runtime incremental parallel scheduling (RIPS) on distributed memory computers
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (6) , 637-649
- https://doi.org/10.1109/71.506702
Abstract
Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low overhead, high quality load balancing, as well as adapting to irregular applications. The paper presents methods for scheduling a single job on a dedicated parallel machine.Keywords
This publication has 29 references indexed in Scilit:
- Runtime incremental parallel scheduling (RIPS) for large-scale parallel computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Disjoint task allocation algorithms for MIN machines with minimal conflictsIEEE Transactions on Parallel and Distributed Systems, 1995
- A systematic approach for mapping application tasks in hypercubesIEEE Transactions on Computers, 1993
- A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecturesIEEE Transactions on Parallel and Distributed Systems, 1993
- Self-adjusting Mapping: A Heuristic Mapping Algorithm for Mapping Parallel Programs on to Transputer NetworksThe Computer Journal, 1992
- Parallel depth first search. Part I. ImplementationInternational Journal of Parallel Programming, 1987
- Adaptive load sharing in homogeneous distributed systemsIEEE Transactions on Software Engineering, 1986
- A comparison of receiver-initiated and sender-initiated adaptive load sharingPerformance Evaluation, 1986
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Simulations of three adaptive, decentralized controlled, job scheduling algorithmsComputer Networks (1976), 1984