Proceedings of the third international conference on Genetic algorithms
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Journal of Parallel and Distributed Computing
QoS and Contention-Aware Multi-Resource Reservation
Cluster Computing
Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
A Benefit Function Mapping Heuristic for a Class of Meta-Tasks in Grid Environments
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Task Matching and Scheduling in Heterogeneous Systems Using Simulated Evolution
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
A Heuristic Scheduling Strategy for Independent Tasks on Grid
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
New grid scheduling and rescheduling methods in the GrADS project
International Journal of Parallel Programming - Special issue: The next generation software program
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Task scheduling strategies for workflow-based applications in grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
Journal of Parallel and Distributed Computing
A Novel Economic-Based Scheduling Heuristic for Computational Grids
International Journal of High Performance Computing Applications
Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Estimation of Execution times on Heterogeneous Supercomputer Architectures
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Future Generation Computer Systems
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
A workflow model for heterogeneous computing environments
Future Generation Computer Systems
Introduction to Grid Computing
Introduction to Grid Computing
Leap before you look: an effective strategy in an oversubscribed scheduling problem
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Improvement on Scheduling Dependent Tasks for Grid Applications
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 01
Robust task scheduling for volunteer computing systems
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Hi-index | 0.00 |
Heterogeneous computing (HC) is the coordinated use of different types of machines, and networks to process a diverse workload in a manner that will maximize the combined performance and/or cost effectiveness of the system. Heuristics for allocating resources in an HC system are based on some optimization criterion. A common optimization criterion is to minimize the completion time of the machine that finishes last (makespan). In this study, we consider an iterative approach that repeatedly runs a mapping heuristic to minimize the makespan of the considered machines and tasks. For each successive iteration, the makespan machine of the previous iteration and the tasks assigned to it are removed from the set of considered machines and tasks. This study focuses on understanding the different mathematical characteristics of resource allocation heuristics that cause them to behave differently when combined with this iterative approach. This paper has three main contributions. The first contribution is the study of an iterative technique used in conjunction with resource allocation heuristics. The second contribution is the definition and mathematical characterization of "iteration invariant" heuristics. The third contribution is to determine the characteristics of a heuristic that will cause the mapping to change across iterations.