Name
Abstract | ||
|---|---|---|
The problem is that the parallel scheduling strategies are minimally supported in distributed environments. The well-known Coffman-Graham algorithm is highly effective but applied only for the sample case when all tasks have the same execution time and not applied for the distributed systems. In this paper, an expanding task graph and an expanding Coffman-Graham algorithm, which orients to the distributed systems and can be applied for the case when the tasks have the different execution time, are proposed. Like the well-known Coffman-Graham algorithm, the ECG algorithm is proved to be an efficient scheduling algorithm for the distributed systems, through presenting and deducting one theorem and two corollaries.. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/PDCAT.2006.29 | PDCAT |
Keywords | Field | DocType |
distributed environment,distributed system,graph theory,scheduling algorithm,parallel algorithms | Computer science,Real-time computing,Rate-monotonic scheduling,Distributed computing,Fair-share scheduling,Parallel algorithm,Parallel computing,Gang scheduling,Algorithm,Least slack time scheduling,Distributed algorithm,Earliest deadline first scheduling,Dynamic priority scheduling | Conference |
Volume | Issue | ISBN |
null | null | 0-7695-2736-1 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maoyuan Zhang | 1 | 27 | 3.67 |
| Ruixuan Li | 2 | 405 | 69.47 |
| Zhengding Lu | 3 | 360 | 42.84 |
| Chun-yan Zou | 4 | 12 | 1.64 |