Conventional hard real-time scheduling is often overly pessimistic due to the worst case execution time estimation. The pessimism can be mitigated by exploiting imprecise computing in applications where occasional small errors are acceptable. This leverage was previously investigated for preemptive scheduling. We study how to make use of imprecise computing in uniprocessor non-preemptive real-time scheduling, which is known to be more difficult than its preemptive counterpart. Several heuristic algorithms are developed for periodic tasks with independent or cumulative errors due to imprecision. Simulation results show that the proposed techniques can significantly improve task schedulability and achieve desired accuracy-schedulability tradeoff. The benefit is further confirmed by a prototyping implementation in Linux system.
|Original language||English (US)|
|Title of host publication||Proceedings of the 55th Annual Design Automation Conference, DAC 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|State||Published - Jun 24 2018|
|Event||55th Annual Design Automation Conference, DAC 2018 - San Francisco, United States|
Duration: Jun 24 2018 → Jun 29 2018
|Name||Proceedings - Design Automation Conference|
|Other||55th Annual Design Automation Conference, DAC 2018|
|Period||6/24/18 → 6/29/18|
Bibliographical noteFunding Information:
This work was supported in part by the NSF under awards CCF-1525925 and CCF-1525749.
© 2018 Association for Computing Machinery.