Paper Info
Title
Scheduling tasks in DAG to heterogeneous processor system
Abstract
Heterogeneous processors configuration in parallel and distributed becomes a practical solution in modern parallel and distributed system. In order to execute tasks in such system with better performance, scheduling algorithms which support the configuration are needed. This paper starts with studying a technique called Heterogeneous List Scheduling Heuristic (HLS) for designing scheduling algorithm to schedule tasks into heterogeneous systems. With this, an experience of designing scheduling algorithm for scheduling task into heterogeneous system is described. This is done by modifying an algorithm called Relative Mobility, which is proposed by Chan and Li [2][3] for scheduling task into homogeneous system, to propose an algorithm called Heterogeneous Relative Mobility Scheduling algorithm (HRMS). Finally, an experiment is conducted to show some important properties as scheduling tasks into different configurations of processors
Year
DOI
Venue
1998
10.1109/EMPDP.1998.647175
PDP
Keywords
Field
DocType
processor scheduling,parallel processing,scheduling algorithms,parallel systems,heterogeneous relative mobility scheduling algorithm,heterogeneous processors configuration,directed graphs,performance evaluation,relative mobility,heterogeneous list scheduling heuristic,distributed system,directed acyclic graphs,heterogeneous processor system,scheduling algorithm,high level synthesis,very large scale integration,human resource management,algorithm design and analysis
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Gang scheduling,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-8186-8332-5
4
0.44
References 
Authors
1
2
Name
Order
Citations
PageRank
Wai-Yip Chan140.44
Chi-Kwong Li231329.81