UMR: a multi-round algorithm for scheduling divisible workloads
- 22 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An optimal scheduling algorithm for parallel video processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bandwidth-centric allocation of independent tasks on heterogeneous platformsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- The master-slave paradigm with heterogeneous processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Sharing partitionable workloads in heterogeneous NOWs: greedier is not betterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Task allocation on a network of processorsIEEE Transactions on Computers, 2000
- Divisible task scheduling – Concept and verificationParallel Computing, 1999
- Allocating Independent Tasks to Parallel Processors: An Experimental StudyJournal of Parallel and Distributed Computing, 1997
- Parallel image processing applications on a network of workstationsParallel Computing, 1995
- Factoring: a method for scheduling parallel loopsCommunications of the ACM, 1992