Skip to main content

Temperature Aware Online Scheduling with a Low Cooling Factor

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6108))

Abstract

We consider the problem of scheduling jobs in a processor with temperature constraints. In our model, unit jobs arrive over time, each with a deadline and a heat contribution. The objective is to maximize the total number of completed jobs while keeping the system within a given temperature threshold. Our main result is the analysis of a large class of ‘reasonable’ algorithms. We analyse the competitive ratio of these algorithms as a function of the cooling factor of the system, and show that they are optimal by giving a matching lower bound. We also give some results concerning the multiple machines case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. In: FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 520–529 (2004)

    Google Scholar 

  2. Chrobak, M., Dürr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 120–130. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Coskun, A.K., Rosing, T.S., Whisnant, K.: Temperature aware task scheduling in MPSoCs. In: Proceedings of 2007 Design, Automation and Test in Europe Conference, pp. 1659–1664 (2007)

    Google Scholar 

  4. Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: SODA 2007: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 209–218 (2007)

    Google Scholar 

  5. Fung, S.P.Y.: Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints. In: MAPSP 2009: 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (2009)

    Google Scholar 

  6. Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)

    Article  Google Scholar 

  7. Kursen, E., Cher, C.-Y., Buyuktosunoglu, A., Bose, P.: Investigating the effects of task scheduling on thermal behavior. In: 3rd Workshop on Temperature-Aware Computer Systems (2006)

    Google Scholar 

  8. Yang, J., Zhou, X., Chrobak, M., Zhang, Y., Jin, L.: Dynamic thermal management through task scheduling. In: Proceedings of IEEE Int. Symposium on Performance Analysis of Systems and Software, pp. 191–201 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Birks, M., Fung, S.P.Y. (2010). Temperature Aware Online Scheduling with a Low Cooling Factor. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13562-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13561-3

  • Online ISBN: 978-3-642-13562-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics