Name
Abstract | ||
|---|---|---|
Task scheduling on multiprocessor system is a well-known problem in area of parallel computing. For this problem, many static scheduling algorithms have been reported. But in most static algorithms, only one attribute of tasks is considered when constructing a ready list, which consists of all ready tasks, and there is no evaluation for different task attributes. In this paper, a list scheduling algorithm for DAG-based parallel computing models is proposed. It is mainly designed for reducing the scheduling length of applications with regular DAG models. Eight task attributes in the DAG model are evaluated, and corresponding rules are presented, which will be used in constructing the ready list. And when scheduling tasks, its start time and communication cost on idle processors are taken into consideration. Experimental results show that the proposed algorithm can achieve a significant performance improvement, which is upï¾źto 142ï¾ź%. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-27122-4_28 | ICA3PP |
Field | DocType | Citations |
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Algorithm,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Fu | 1 | 2 | 2.76 |
| Ce Yu | 2 | 75 | 15.15 |
| Sun Jizhou | 3 | 253 | 47.07 |
| Mengmeng Wang | 4 | 50 | 11.50 |
| Jun Du | 5 | 6 | 1.16 |