Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
- 31 March 2007
- journal article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 42 (1) , 33-58
- https://doi.org/10.1007/s11227-006-0035-y
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environmentJournal of Parallel and Distributed Computing, 2006
- Characterizing Resource Allocation Heuristics for Heterogeneous Computing SystemsPublished by Elsevier ,2005
- Measuring the robustness of a resource allocationIEEE Transactions on Parallel and Distributed Systems, 2004
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- Lagrangian relaxation neural networks for job shop schedulingIEEE Transactions on Robotics and Automation, 2000
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing SystemsJournal of Parallel and Distributed Computing, 1999
- Optimal task assignment in heterogeneous distributed computing systemsIEEE Concurrency, 1998
- ROBUSTNESS MEASURES AND ROBUST SCHEDULING FOR JOB SHOPSIIE Transactions, 1994
- Allocating modules to processors in a distributed systemIEEE Transactions on Software Engineering, 1989
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977