Name
Abstract | ||
|---|---|---|
Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/ISPAN.1994.367175 | ISPAN |
Keywords | DocType | ISBN |
delays,parallel programming,performance evaluation,processor scheduling,absolute performance measure,increase analysis,lower bound,optimal schedules,parallel program,static scheduling heuristics,task graph,total execution time | Conference | 0-8186-6507-6 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dingchao Li | 1 | 1 | 2.76 |
| hiromitsu takagi | 2 | 0 | 0.34 |
| Naohiro Ishii | 3 | 461 | 128.62 |