Name
Abstract | ||
|---|---|---|
This paper first studies the problem of scheduling hard real-time sporadic gang task systems under global earliest-deadline-first on a multiprocessor platform, where a gang application’s threads need to be concurrently scheduled on distinct processors. A novel approach combining new lag-based reasoning and executing/non-executing gang interval analysis technique is introduced, which is able to characterize the parallelism-induced idleness, as a key challenge of analyzing gang task schedules. To the best of our knowledge, this approach yields the first utilization-based test for hard real-time gang task systems. To further handle the clustered scheduling scenario, we propose a partitioning scheme that enables a set of gang tasks to be efficiently assigned and scheduled among multiple clusters. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/rtss.2017.00019 | RTSS |
Keywords | Field | DocType |
Hard real-time, Gang task system, Early deadline first | Metrical task system,Computer science,Scheduling (computing),Thread (computing),Schedule,Interval arithmetic,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 19 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zheng Dong | 1 | 51 | 9.62 |
| Cong Liu | 2 | 780 | 56.17 |