A Voltage Scheduling Heuristic for Real-Time Task Graphs

D. Roychowdhury, I. Koren, C. M. Krishna, Yann-Hang Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to address the problem of energy-efficient voltage scheduling of a hard real-time task graph with precedence constraints for a multi-processor environment. We show that consideration of inter-relationships among the tasks in a holisitic way can lead to an effective heuristic for reducing energy expenditure. We developed this algorithm for systems running with two voltage levels since this is currently supported by a majority of modern processors. We then extend the algorithm for processors that can support multiple voltage levels. The results show that substantial energy savings can be achieved by using our scheme. The algorithm is then compared with other relevant algorithms derived for hypothetical systems which can run on infinite voltage levels in a given range. Our two voltage systems, using the task dependencies effectively, can provide a comparable performance with those algorithms in the cases where continuous voltage switching is not allowed.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Dependable Systems and Networks
Pages741-750
Number of pages10
DOIs
StatePublished - 2003
Event2003 International Conference on Dependable Systems and Networks - San Francisco, CA, United States
Duration: Jun 22 2003Jun 25 2003

Other

Other2003 International Conference on Dependable Systems and Networks
CountryUnited States
CitySan Francisco, CA
Period6/22/036/25/03

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A Voltage Scheduling Heuristic for Real-Time Task Graphs'. Together they form a unique fingerprint.

Cite this