Skip to main content

Control and Optimization of the SRPT Service Policy by Frequency Scaling

  • Conference paper
  • First Online:
Quantitative Evaluation of Systems (QEST 2018)

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

Included in the following conference series:

Abstract

In this paper, we study a system where the speed of a processor depends on the current number of jobs. We propose a queueing model in which jobs consist of a variable number of tasks, and priority is given to the job with the fewest remaining tasks. The number of processor frequency levels determines the dimensionality of the queueing process. The objective is to evaluate the trade-offs between holding cost and energy cost when setting the processor frequency. We obtain exact results for two and three frequency levels, and accurate approximations that can be further generalized. Numerical and simulation results show the high accuracy of the approximate solutions that we propose. Our experiments suggest that a parsimonius model with only two frequency levels is sufficient, since more elaborate models provide negligible improvements when optimizing the system.

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 EPUB and 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

References

  1. Andrew, L., Lin, M., Wierman, A.: Optimality, fairness, and robustness in speed scaling designs. In: Proceedings of ACM SIGMETRICS, pp. 37–48 (2010)

    Google Scholar 

  2. Bansal, N., Chan, H., Pruhs, K.: Speed scaling with an arbitrary power function. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (2009)

    Google Scholar 

  3. Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. In: Proceedings of ACM SIGMETRICS, pp. 279–290 (2001)

    Google Scholar 

  4. Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54, 3 (2007)

    Google Scholar 

  5. Cox, D.R.: A use of complex probabilities in the theory of stochastic processes. Math. Proc. Cambridge Philos. Soc. 51(2), 313–319 (1955)

    Article  MathSciNet  Google Scholar 

  6. Elahi, M., Williamson, C.: Autoscaling effects in speed scaling systems. In: Proceedings of IEEE MASCOTS, pp. 307–312 (2016)

    Google Scholar 

  7. George, J., Harrison, J.: Dynamic control of a queue with adjustable service rate. Oper. Res. 49(5), 720–731 (2001)

    Article  MathSciNet  Google Scholar 

  8. Harchol-Balter, M., Bansal, N., Shroeder, B., Agrawal, M.: Implementation of SRPT scheduling in web servers. In: Proceedings of IEEE International Parallel & Distributed Processing Symposium (IPDS), pp. 1–24 (2001)

    Google Scholar 

  9. Kleinrock, L.: Queueing Systems: Computer Applications, vol. 2. Wiley, New York (1976)

    Google Scholar 

  10. Pakes, A.G.: Some conditions for ergodicity and recurrence of Markov chains. Oper. Res. 17(6), 1058–1061 (1969)

    Article  MathSciNet  Google Scholar 

  11. Rai, I.A., Urvoy-Keller, G., Vernon, M.K., Biersack, E.W.: Performance analysis of LAS-based scheduling disciplines in a packet switched network. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2004/Performance 2004), pp. 106–117 (2004)

    Google Scholar 

  12. Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16, 678–690 (1968)

    Article  Google Scholar 

  13. Skrenes, A., Williamson, C.: Experimental calibration and validation of a speed scaling simulator. In: Proceedings of IEEE MASCOTS, pp. 105–114 (2016)

    Google Scholar 

  14. Wierman, A.: Fairness and scheduling in single server queues. Surv. Oper. Res. Manage. Sci. 6(1), 39–48 (2011)

    Google Scholar 

  15. Wierman, A., Andrew, L., Tang, A.: Power-aware speed scaling in processor sharing systems. In: Proceedings of IEEE INFOCOM (2009)

    Google Scholar 

  16. Wierman, A., Andrew, L., Tang, A.: Power-aware speed scaling in processor sharing systems: optimality and robustness. Perform. Eval. 69, 601–622 (2012)

    Article  Google Scholar 

  17. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of ACM Foundations of Computer Systems (FOCS), pp. 374–382 (1995)

    Google Scholar 

Download references

Acknowledgments

The work described in this paper has been partially supported by the Università Ca’ Foscari Venezia - DAIS within the IRIDE program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrea Marin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Marin, A., Mitrani, I., Elahi, M., Williamson, C. (2018). Control and Optimization of the SRPT Service Policy by Frequency Scaling. In: McIver, A., Horvath, A. (eds) Quantitative Evaluation of Systems. QEST 2018. Lecture Notes in Computer Science(), vol 11024. Springer, Cham. https://doi.org/10.1007/978-3-319-99154-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99154-2_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99153-5

  • Online ISBN: 978-3-319-99154-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics