Name
Abstract | ||
|---|---|---|
The problem of estimating the makespan for parallel applications is overly pessimistic bounds either due to load imbalance issues plaguing static scheduling methods or due to timing anomalies plaguing dynamic scheduling methods for multicore architectures. While dynamic scheduling (where tasks are not pre-assigned) offers better utilization of the processors, it suffers from timing anomalies. This paper contributes with a new timing-anomaly-free dynamic scheduling algorithm, called the Out-of-(priority)-order Lazy (O-Lazy) that offers safe and tighter estimation of the makespan of parallel applications. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/RTSS.2016.050 | 2016 IEEE Real-Time Systems Symposium (RTSS) |
Keywords | DocType | ISSN |
timing-anomaly free dynamic scheduling algorithm,task-based parallel applications,out-of-priority-order lazy,O-Lazy | Conference | 1545-3421 |
ISBN | Citations | PageRank |
978-1-5090-5304-9 | 1 | 0.35 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petros Voudouris | 1 | 4 | 0.73 |
| Per Stenström | 2 | 3048 | 234.09 |
| Risat Mahmud Pathan | 3 | 46 | 7.61 |