Advertisement

A Context-Switch Reduction Heuristic for Power-Aware Off-Line Scheduling

  • Biju Raveendran
  • Sundar Balasubramaniam
  • K Durga Prasad
  • S. Gurunarayanan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4186)

Abstract

Scheduling algorithms significantly affect the performance of a real-time system. In systems with power constraints, context switches in a schedule result in wasted power consumption. We present a scheduling algorithm and a heuristic for reducing the number of context switches. The algorithm executes in near linear time in terms of the number of jobs, finds a feasible schedule in most cases if it exists, and reasonably reduces the number of context switches. Thus it is a power-aware scheduling algorithm.

Keywords

Schedule Algorithm Feasible Schedule Periodic Task Context Switch Task List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kandemir, M., Chen, G., Zhang, W., Kolcu, I.: Data Space Oriented Scheduling in Em-bedded Systems. In: Proceedings of the conference on Design, Automation and Test in Europe, vol. 1, p. 10416 (2003)Google Scholar
  2. 2.
    Pillai, P., Shin, K.G.: Real-Time dynamic voltage scaling for Low-power embedded operating systems. In: Ganger, G. (ed.) Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001). 5th ACM SIGOPS Operating Systems Review, October 21 – 24, 2001, vol. 35, pp. 89–102. ACM Press, New York (2001)CrossRefGoogle Scholar
  3. 3.
    Pouwelse, J., Langendoen, K., Sips, H.: Dynamic Voltage Scaling on a Low-Power Micro-processor, UbiCom Technical Report 2000/3, Delft University of TechnologyGoogle Scholar
  4. 4.
    Liu, J.: Real-Time Systems. Prenctice Hall, Englewood Cliffs (2000)Google Scholar
  5. 5.
    Hung, Y.-T.: Power-Aware Compilation with Architectural Support and. Instruction Scheduling. In: Proceedings of Eleventh Workshop on Compiler Techniques for High Performance Computing, Taiwan (2005)Google Scholar
  6. 6.
    Ayala, J.L., Veidenbaum, A.: Reducing Register File Energy Consumption Using Compiler Support. In: Workshop on Application Specific Processors (in conjunction with IEEE International Symposium on Microarchitecture), Istanbul, Turkey (November 2002)Google Scholar
  7. 7.
    Yang, H.: Power-Aware Compilation Techniques for High Performance Processors, Ph.D. Thesis. Department of Electrical and Computer Engineering. University of Delaware, Delaware, USA (2004)Google Scholar
  8. 8.
    Mosse, D., Aydin, H., Childers, B., Melhem, R.: Compiler-assisted dynamic power aware scheduling for real-time applications. In: Workshop on Compilers and Operating Systems for Low Power (October 2000)Google Scholar
  9. 9.
    Dittman, B.: Strategied for Minimizing Context Switch Times in Large Register set Environment with Primary Focus on the PowerPC Architecture with Floating Point and AltiVec Extensions. QuadrosSystems, http://www.rtxc.com/pdf/article_esd-conference_05-08-2004.pdf
  10. 10.
    Gooch, R.: Linux Scheduler Benchmark Results, http://www.atnf.csiro.au/people/rgooch/benchmarks/linux-scheduler.html
  11. 11.
    Acquaviva, A., Benini, L., Ricco, B.: Energy Characterization of Embedded Real-Time Operating Systems. ACM Computer Architecture News 29(5), 13–18 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Biju Raveendran
    • 1
  • Sundar Balasubramaniam
    • 1
  • K Durga Prasad
    • 1
  • S. Gurunarayanan
    • 2
  1. 1.Computer Science Group 
  2. 2.BITSElectronics & Instrumentation GroupPilaniIndia

Personalised recommendations