Abstract
There are many task scheduling algorithms for minimizing the schedule length in distributed systems. Especially, task clustering heuristics are well known as an approach for deciding the number of required processors. However, the actual number may become very large depending on characteristics of the input job and each processor's capability. Thus, currently there is no theoretical criterion for achieving processor utilization. In this paper, we propose a method for deriving the lower bound of the cluster (assignment unit) size in heterogeneous distributed systems for limiting the number of processors. From results of experimental simulations, we discuss the applicability of the proposal to obtain better processor utilization.
| Original language | English |
|---|---|
| Title of host publication | International Conference on Advanced Communication Technology, ICACT |
| Pages | 1070-1075 |
| Number of pages | 6 |
| Publication status | Published - 2012 |
| Event | 14th International Conference on Advanced Communication Technology, ICACT 2012 - PyeongChang Duration: 2012 Feb 19 → 2012 Feb 22 |
Other
| Other | 14th International Conference on Advanced Communication Technology, ICACT 2012 |
|---|---|
| City | PyeongChang |
| Period | 12/2/19 → 12/2/22 |
Keywords
- DAG
- Heterogeneous Distributed Systems
- Processor Utilization
- Task Scheduling
ASJC Scopus subject areas
- Electrical and Electronic Engineering