Energy-Constrained Scheduling of DAGs on Multi-core Processors
This paper proposes a technique to minimize the makespan of DAGs under energy constraints on multi-core processors that often need to operate under strict energy constraints. Most of the existing work aims to reduce energy subject to performance constraints. Thus, our work is in contrast to these techniques, and it is useful because one can encounter numerous energy-constraint scenarios in real life. The algorithm, named Incremental Static Voltage Adaptation (ISVA), uses the Dynamic Voltage Scaling technique and assigns differential voltages to each sub-task to minimize energy requirements of an application. Essentially, ISVA is a framework, rather than yet another DAG scheduling algorithm, in that it can work with any efficient algorithm to generate the initial schedule under no energy constraints. Given the initial schedule, ISVA efficiently identifies tasks’ relative importance and their liabilities on energy. It then achieves the best possible new schedule by observing its energy budget. The algorithm marginally degrades the schedule length with extensive reduction in energy budgets.
KeywordsParallel processing multi-cores scheduling energy
Unable to display preview. Download preview PDF.
- 1.Ahmad, I., Khan, S.U., Ranka, S.: Using Game Theory for Scheduling Tasks on Multi-Core Processors for Simultaneous Optimization of Performance and Energy. In: Workshop on NSF Next Generation Software Program in conjunction with the International Parallel and Distributed Processing Symposium (IPDPS 2008), Miami, FL (2008)Google Scholar
- 4.Gutnik, V., Chandrakasan, A.: An Efficient Controller for Variable Supply-Voltage Low Power Processing. In: IEEE Symposium on VLSI Circuits, pp. 158–159 (1996)Google Scholar
- 5.Jejurikar, R., Gupta, R.: Dynamic Slack Reclamation with Procrastination Scheduling in Real-Time Embedded Systems. In: Design Automation Conf., pp. 111–116 (2005)Google Scholar
- 6.Kang, J., Ranka, S.: Dynamic Algorithms for Energy Minimization on Parallel Machines. In: Euromicro Intl. Conf. on Parallel. Distributed and Network-based Processing (PDP 2008) (to appear, 2008)Google Scholar
- 8.Kwok, Y.-K., Ahmad, I.: Dynamic Critical-Path Scheduling: An effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. Parallel Distributed. Systems 7(5) (1996)Google Scholar
- 10.Luo, J., Jha, N.K.: Power-Conscious Joint Scheduling of Periodic Task Graphs and Aperiodic Tasks in Distributed Real-time Embedded Systems. In: Int. Conf. on Computer-Aided Design, pp. 357–364 (2000)Google Scholar
- 11.Luo, J., Jha, N.K.: Static and Dynamic Variable Voltage Scheduling Algorithms for Real-time Heterogeneous Distributed Embedded Systems. In: ASP-DAC 2002: Proceedings of the 2002 conference on Asia South Pacific Design Automation/VLSI Design, p. 719. IEEE Computer Society, Washington (2000)Google Scholar
- 12.Schmitz, M.T., Al-Hashimi, B.M.: Considering Power Variations of DVS Processing Elements for Energy Minimisation in Distributed Systems. In: Int’l Sym. on System Synthesis, pp. 250–255 (2001)Google Scholar
- 13.Schmitz, M.T., Al-Hashimi, B.M.: Considering Power Variations of DVS Processing Elements for Energy Minimisation in Distributed Systems. In: Int’l Sym. on System Synthesis, pp. 250–255 (2001)Google Scholar
- 14.Yu, Y., Prasanna, V.K.: Power-Aware Resource Allocation for Independent Tasks in Heterogeneous Real-Time Systems. In: 9th IEEE International Conference on Parallel and Distributed Systems (2002)Google Scholar
- 15.Zhang, Y., Hu, X. (Sharon) ., Chen, D.Z.: Task Scheduling and Voltage Selection for Energy Minimization. In: Design Automation Conf., pp. 183–188 (2002)Google Scholar