Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Proceedings of the third international conference on Genetic algorithms
Computer
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
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
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Adaptive QoS and Resource Management Using A Posteriori Workload Characterizations
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Heterogeneous distributed computing: off-line mapping heuristics for independent tasks and for tasks with dependencies, priorities, deadlines, and multiple versions
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Resource Allocation for Periodic Applications in a Shipboard Environment
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Journal of Parallel and Distributed Computing
Scheduling of a meta-task with QoS requirements in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Parallelization scheme for an approximate solution to time constraint problems
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Cooperative grid jobs scheduling with multi-objective genetic algorithm
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, diverse groups of tasks. The problem of mapping (defined as matching and scheduling) these tasks onto the machines of a distributed HC environment has been shown, in general, to be NP-complete. Therefore, the development of heuristic techniques to find near-optimal solutions is required. In the HC environment investigated, tasks had deadlines, priorities, multiple versions, and may be composed of communicating subtasks. The best static (off-line) techniques from some previous studies were adapted and applied to this mapping problem: a genetic algorithm (GA), a GENITOR-style algorithm, and a greedy Min-min technique. Simulation studies compared the performance of these heuristics in several overloaded scenarios, i.e., not all tasks executed. The performance measure used was a sum of weighted priorities of tasks that completed before their deadline, adjusted based on the version of the task used. It is shown that for the cases studied here, the GENITOR technique found the best results, but the faster Min-min approach also performed very well.