On the development of a communication-aware task mapping technique
Journal of Systems Architecture: the EUROMICRO Journal
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
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
The Journal of Supercomputing
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
Hi-index | 0.00 |
Clusters of heterogeneous PCs/workstations have become attractive systems to execute a set of computationally intensive independent tasks. This paper focuses on scheduling schemes in a dynamic context - i.e. where scheduling decisions are made periodically as jobs arrive, in contrast to static scheduling where scheduling is performed after all jobs have been submitted. This paper characterizes different scheduling schemes with respect to varying arrival rates and burstiness in the job arrival rate. Using the insights gained by the characterization, a set of approaches is proposed to improve the previously developed strategies with respect to turn-around time. Simulation results indicate improvements of up to 40% in turnaround time by using the proposed enhancements.