A Survey on Task Scheduling Method in Heterogeneous Computing System
2015
Heterogeneous computing system is one of the focuses researched in the field of distributed computing nowadays. It is composed of various heterogeneous processors interconnected with high-speed networks. And it can acquire rapid processing of computationally intensive applications to meet diverse computing needs. In heterogeneous computing system, it is a key issue for high performance computing to schedule tasks and allocate nodes properly. In this paper, first I introduce the problem of task scheduling and describe four kinds of task scheduling methods. Next I analyze the basic ideas of some representative task scheduling algorithms in heterogeneous computing system and describe their performance. Then I compare these four methods and analyse their advantages and disadvantages. Finally I give a conclusion and the future work on heterogeneous computing system.
Keywords:
- Deadline-monotonic scheduling
- Flow shop scheduling
- Computer science
- Fair-share scheduling
- Lottery scheduling
- Two-level scheduling
- Dynamic priority scheduling
- Fixed-priority pre-emptive scheduling
- Distributed computing
- Round-robin scheduling
- Symmetric multiprocessor system
- Earliest deadline first scheduling
- Rate-monotonic scheduling
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
31
References
4
Citations
NaN
KQI