Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
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
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Journal of Parallel and Distributed Computing
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Sub Optimal Scheduling in a Grid Using Genetic Algorithms
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Model For Speedup of Parallel Programs
A Model For Speedup of Parallel Programs
Sub optimal scheduling in a grid using genetic algorithms
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Genetic Algorithm Based Scheduler for Computational Grids
HPCS '05 Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications
Grid capacity planning with negotiation-based advance reservation for optimized QoS
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
An efficient approximation for the generalized assignment problem
Information Processing Letters
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On incorporating an on-line strip packing algorithm into elastic Grid reservation-based systems
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Moldable parallel job scheduling using job efficiency: an iterative approach
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
New challenges of parallel job scheduling
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Recent Research Advances in e-Science
Cluster Computing
| Hi-index | 0.00 |
Scheduling parallel tasks in multi-cluster grid can be seen as two interdependent problems: cluster allocation and scheduling parallel task on the allocated cluster. In this paper both rigid and moldable parallel tasks are considered. We propose a theoretical model of utility-oriented parallel task scheduling in multi-cluster grid with advance reservations. On the basis of the model we present an approximation algorithm, a repair strategy based genetic algorithm and greedy heuristics MaxMax, T-Sufferage and R-Sufferage to solve the two interdependent problems. We compare the performance of these algorithms in aspect of utility optimality and timing results. Simulation results show on average the (1+驴)-approximation algorithm achieves the best trade-off between utility optimality and timing. Genetic algorithm could achieve better utility than greedy heuristics and approximate algorithm at expensive time cost. Greedy heuristics do not perform equally well when adapted to different utility functions while the approximation algorithm shows its intrinsic stable performance.