Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines

Authors:
Jong-Kook Kim;Sameer Shivle;Howard Jay Siegel;Anthony A. Maciejewski;Tracy D. Braun;Myron Schneider;Sonja Tideman;Ramakrishna Chitta;Raheleh B. Dilmaghani;Rohit Joshi;Aditya Kaul;Ashish Sharma;Siddhartha Sripada;Praveen Vangari;Siva Sankar Yellampalli
Affiliations:
-;-;-;-;-;-;-;-;-;-;-;-;-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 11

Centralized Run-Time Resource Management in a Network-on-Chip Containing Reconfigurable Hardware Tiles

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Dynamic Mapping in Energy Constrained Heterogeneous Computing Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Adaptive grid job scheduling with genetic algorithms

Future Generation Computer Systems
Scheduling of a meta-task with QoS requirements in heterogeneous computing systems

Journal of Parallel and Distributed Computing
Dynamic Resource Management Heuristics for Minimizing Makespan while Maintaining an Acceptable Level of Robustness in an Uncertain Environment

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

The Journal of Supercomputing
A memetic algorithm for reliability-based dynamic scheduling in heterogeneous computing environments

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines

CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Auction resource allocation mechanisms in grids of heterogeneous computers

WSEAS Transactions on Computers
A static task partitioning approach for heterogeneous systems using OpenCL

CC'11/ETAPS'11 Proceedings of the 20th international conference on Compiler construction: part of the joint European conferences on theory and practice of software
A global benefit maximization task-bundle allocation

NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To maximize the performance of a distributed heterogeneous computing system, it is essential to assign resources to tasks (match) and order the execution of tasks on each resource (schedule) in a manner that exploits the heterogeneity of the resources and tasks. The mapping (defined as matching and scheduling) of tasks onto machines with varied computational capabilities has been shown, in general, to be an NP-complete problem. Therefore, heuristic techniques to find a near-optimal solution to this mapping problem are required. Dynamic mapping is performed when the arrival of a task is not known a priori and there may be changes in the system. In the heterogeneous environment considered in this study, tasks arrive randomly, tasks are independent (i.e., no communication among tasks), and tasks have priorities and multiple deadlines. This research proposes, evaluates, and compares eight dynamic heuristics.