Proceedings ArticleDOI
A Hybrid GA-based Scheduling Algorithm for Heterogeneous Computing Environments
Han Yu
- pp 87-92
Reads0
Chats0
TLDR
A hybrid algorithm to schedule the execution of a group of dependent tasks for heterogeneous computing environments that takes advantage of both the exploration power of GA and the heuristics embedded in the scheduling problem, so it can effectively reduce the search space while not sacrificing the search quality.Abstract:
We design a hybrid algorithm to schedule the execution of a group of dependent tasks for heterogeneous computing environments. The algorithm consists of two elements: a genetic algorithm (GA) to map tasks to processors, and a heuristic-based approach to assign the execution order of tasks. This algorithm takes advantage of both the exploration power of GA and the heuristics embedded in the scheduling problem, so it can effectively reduce the search space while not sacrificing the search quality. The experiments show that this algorithm performs consistently better than heterogeneous earliest-finish-time (HEFT) without incurring much computational cost. Multiple runs of the algorithm can further improve the search result.read more
Citations
More filters
Proceedings ArticleDOI
Criticality-Aware Dynamic Task Scheduling for Heterogeneous Architectures
TL;DR: The OmpSs approach on scheduling dependent tasks onto the asymmetric cores of a heterogeneous system improves performance by prioritizing the newly-created tasks at runtime, detecting the longest path of the dynamic task dependency graph, and assigning critical tasks to fast cores.
Journal ArticleDOI
Task Scheduling Techniques for Asymmetric Multi-Core Systems
Kallia Chronaki,Alejandro Rico,Marc Casas,Miquel Moreto,Rosa M. Badia,Eduard Ayguadé,Jesús Labarta,Mateo Valero +7 more
TL;DR: Two task scheduling approaches that target asymmetric systems that reduce total execution time by detecting the longest or the critical path of the dynamic task dependency graph of the application, or by finding the earliest executor of a task.
Proceedings ArticleDOI
Chemical Reaction Optimization for Heterogeneous Computing Environments
TL;DR: A new method to schedule the execution of a group of dependent tasks for heterogeneous computing environments by using an intelligent approach to assign the execution orders of tasks by task level and an allocation algorithm based on chemical-reaction-inspired metaheuristic called CRO to map processors to tasks.
Dissertation
Fair, responsive scheduling of engineering workflows on computing grids
TL;DR: This thesis considers scheduling in the context of a grid computing system used in engineering design to find out whether responsiveness and fairness in the treatment of the workflows they submit are desired and how to achieve them.
Journal ArticleDOI
A two-stage AIS approach for grid scheduling problems
TL;DR: The experimental tests show that this novel AIS method is very effective when compared with other meta-heuristics such as GA, simulated annealing (SA), and ant colony optimisation (ACO).
References
More filters
Journal ArticleDOI
Performance-effective and low-complexity task scheduling for heterogeneous computing
TL;DR: Two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time are presented, called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm.
Journal ArticleDOI
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
Yu-Kwong Kwok,Ishfaq Ahmad +1 more
TL;DR: A static scheduling algorithm for allocating task graphs to fully connected multiprocessors which has admissible time complexity, is economical in terms of the number of processors used and is suitable for a wide range of graph structures.
Journal ArticleDOI
A genetic algorithm for multiprocessor scheduling
Edwin Hou,Nirwan Ansari,Hong Ren +2 more
TL;DR: An efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem and results comparing the proposed genetic algorithm, the list scheduling algorithm, and the optimal schedule using random task graphs, and a robot inverse dynamics computational task graph are presented.
Journal ArticleDOI
Hypertool: a programming aid for message-passing systems
Min-You Wu,Daniel D. Gajski +1 more
TL;DR: Programming assistance, automation concepts, and their application to a message-passing system program development tool called Hypertool, which performs scheduling and handles the communication primitive insertion automatically, thereby increasing productivity and eliminating synchronization errors.