An Efficient DVS Algorithm for Pinwheel Task Schedules


Da-Ren Chen, You-Shyang Chen, Journal of Information Processing Systems Vol. 7, No. 4, pp. 613-626, Aug. 2011  

10.3745/JIPS.2011.7.4.613
Keywords: Hard Real-time Systems, Power-aware Scheduling, Dynamic Voltage Scaling, Pinwheel Tasks
Fulltext:

Abstract

In this paper, we focus on the pinwheel task model with a variable voltage processor with d discrete voltage/speed levels. We propose an intra-task DVS algorithm, which constructs a minimum energy schedule for k tasks in O(d+k log k) time. We also give an inter-task DVS algorithm with O(d+n log n) time, where n denotes th e number of jobs. Previous approaches solve this problem by generating a canonical schedule beforehand and adjusting the tasks’ speed in O(dn log n) or O(n3) time. However, the length of a canonical schedule depends on the hyper period of those task periods and is of exponential length in general. In our approach, the tasks with arbitrary periods are first transformed into harmonic periods and then profile their key features. Afterward, an optimal discrete voltage schedule can be computed directly from those features.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Da-Ren Chen and You-Shyang Chen (2011). An Efficient DVS Algorithm for Pinwheel Task Schedules. Journal of Information Processing Systems, 7(4), 613-626. DOI: 10.3745/JIPS.2011.7.4.613.

[IEEE Style]
D. Chen and Y. Chen, "An Efficient DVS Algorithm for Pinwheel Task Schedules," Journal of Information Processing Systems, vol. 7, no. 4, pp. 613-626, 2011. DOI: 10.3745/JIPS.2011.7.4.613.

[ACM Style]
Da-Ren Chen and You-Shyang Chen. 2011. An Efficient DVS Algorithm for Pinwheel Task Schedules. Journal of Information Processing Systems, 7, 4, (2011), 613-626. DOI: 10.3745/JIPS.2011.7.4.613.