Skip to main content
SpringerLink
Log in

Analytic Solution of Fair Share Scheduling in Layered Queueing Networks

  • Conference paper
  • First Online:
Computer Performance Engineering (EPEW 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9951))

Included in the following conference series:

  • 521 Accesses

Abstract

Fair share scheduling has been widely used in many distributed systems. Layered Queueing Networks (LQN) are a widely used performance evaluation technique for distributed systems. Therefore, being able to evaluate performance of systems using fair share scheduling is essential. However, Fair share scheduling in a LQN model could only be solved using simulation previously. A main concern of simulation is long execution times. This paper uses a method called ‘Dynamic Parameter substitutions’ (DPS) to solve the Fair share scheduling analytically. DPS is an iterative method to calculate state-based parameters using performance results that are found using Mean Value Analysis (MVA). The paper shows how DPS is integrated into the LQNS solver (LQNS-DPS), which makes solutions of models with fair scheduling both fast and scalable. LQNS-DPS was verified using two sets of models, both with cap and guarantee shares. Over 150 randomly parameterized models, throughput found using LQNS-DPS was on average no worse than 6 % of the result found from simulation.

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

Access this chapter

Log in via an institution
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. Bolker, E., Ding, Y.: On the performance impact of fair share scheduling. In: CMG Conference, Orlando, FL, USA, 10–15 December 2000, vol. 1, pp. 71–82. Computer Measurement Group (2000)

    Google Scholar 

  2. Bolker, E., Ding, Y., Rikun, A.: Fair share modeling for large systems: aggregation, hierarchical decomposition and randomization. In: CMG Conference, Anaheim, CA, USA, vol. 2, pp. 807–818. Computer Measurement Group (2001)

    Google Scholar 

  3. Chandra, A., Adler, M., Goyal, P., Shenoy, P.: Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors. In: Proceedings of the 4th Symposium on Operating System Design and Implementation (OSDI 2000), San Diego, California, 23–25 October 2000, pp. 45–58 (2000)

    Google Scholar 

  4. Cherkasova, L., Gupta, D., Vahdat, A.: Comparison of the three CPU schedulers in Xen. SIGMETRICS Perform. Eval. Rev. 35(2), 42–51 (2007)

    Article  Google Scholar 

  5. Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: Symposium Proceedings on Communications Architectures & Protocols, SIGCOMM 1989, pp. 1–12. ACM, New York (1989)

    Google Scholar 

  6. Duda, K.J., Cheriton, D.R.: Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. SIGOPS Oper. Syst. Rev. 33(5), 261–276 (1999)

    Article  Google Scholar 

  7. Figueiredo, R.J., Dinda, P., Fortes, J., et al.: A case for grid computing on virtual machines. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 550–559, May 2003

    Google Scholar 

  8. Franks, G., Al-Omari, T., Woodside, M., Das, O., Derisavi, S.: Enhanced modeling and solution of layered queueing networks. IEEE Trans. Softw. Eng. 35(2), 148–161 (2009)

    Article  Google Scholar 

  9. Franks, G., Maly, P., Woodside, M., Petriu, D.C., Hubbard, A.: Layered Queueing Network Solver and Simulator User Manual. Real-time and Distributed Systems Lab, Carleton University, Ottawa (2014)

    Google Scholar 

  10. Ghodsi, A., Sekar, V., Zaharia, M., Stoica, I.: Multi-resource fair queueing for packet processing. ACM SIGCOMM Comput. Commun. Rev. 42(4), 1–12 (2012)

    Article  Google Scholar 

  11. Henry, G.J.: The UNIX system: the fair share scheduler. AT&T Bell Lab. Tech. J. 63(8), 1845–1857 (1984)

    Article  MathSciNet  Google Scholar 

  12. Jacobson, P.A., Lazowska, E.D.: Analyzing queueing networks with simultaneous resource possession. Commun. ACM 25(2), 142–151 (1982)

    Article  Google Scholar 

  13. Kay, J., Lauder, P.: A fair share scheduler. Commun. ACM 31(1), 44–55 (1988)

    Article  Google Scholar 

  14. Li, L., Franks, G.: Performance modeling of systems using fair share scheduling with layered queueing networks. In: Proceedings of the 17th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS 2009), London, 21–23 September 2009, pp. 1–10 (2009)

    Google Scholar 

  15. Li, L., Franks, G.: Hybrid performance modeling using layered queueing networks. In: CMG-2012, Las Vegas, Nevada, USA, 3–7 December 2012, vol. 1, pp. 85–93. Computer Measurement Group, Curran Associates Inc. (2012)

    Google Scholar 

  16. Li, L., Franks, G.: Improved interlock correction when solving layered queueing networks using decomposition. In: 2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering (CCECE), pp. 541–546, May 2015

    Google Scholar 

  17. Mroz, M., Franks, G.: A performance experiment system supporting fast mapping of system issues. In: Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, 20–22 October 2009, pp. 246–255 (2009)

    Google Scholar 

  18. Nagle, J.: On packet switches with infinite storage. IEEE Trans. Commun. 35(4), 435–438 (1987)

    Article  Google Scholar 

  19. Neilson, J.E.: PARASOL Users Manual. School of Computer Science, Carleton University, Ottawa, Canada, (version 3.1, edn.)

    Google Scholar 

  20. Pabla, C.S.: Completely fair scheduler. Linux J. 2009(184), 4 (2009)

    Google Scholar 

  21. Ramanathan, P., Agrawal, P.: Adapting packet fair queueing algorithms to wireless networks. In: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom 1998, pp. 1–9. ACM, New York (1998)

    Google Scholar 

  22. Stiliadis, D., Varma, A.: Efficient fair queueing algorithms for packet-switched networks. IEEE/ACM Trans. Netw. 6(2), 175–185 (1998)

    Article  Google Scholar 

  23. Waldspurger, C.A., Weihl, W.E.: Lottery scheduling: flexible proportional-share resource management. In: Proceedings of the 1st USENIX Conference on Operating Systems Design and Implementation (OSDI 1994), 14–17 November 1994, p. 1. USENIX Association, Berkeley (1994)

    Google Scholar 

  24. Waldspurger, C.A., Weihl, W.E.: Stride scheduling: deterministic proportional-share resource management. Technical report TM-528, Massachusetts Institute of Technology, Cambridge, MA, USA, June 1995

    Google Scholar 

  25. Weng, C., Wang, Z., Li, M., Lu, X.: The hybrid scheduling framework for virtual machine systems. In: Proceedings of the 2009 ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, VEE 2009, pp. 111–120. ACM, New York (2009)

    Google Scholar 

  26. Wood, T., Shenoy, P.J., Venkataramani, A., Yousif, M.S.: Black-box and gray-box strategies for virtual machine migration. In: NSDI, vol. 7, p. 17 (2007)

    Google Scholar 

  27. Woodside, C.M.: Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers. IEEE Trans. Softw. Eng. 12(10), 1041–1048 (1986)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carleton University, Ottawa, ON, Canada

    Lianhua Li & Greg Franks

Authors
  1. Lianhua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Greg Franks
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lianhua Li .

Editor information

Editors and Affiliations

  1. Ghent University, Gent, Belgium

    Dieter Fiems

  2. University of Florence, Firenze, Italy

    Marco Paolieri

  3. University of the Aegean, Chios, Greece

    Agapios N. Platis

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Li, L., Franks, G. (2016). Analytic Solution of Fair Share Scheduling in Layered Queueing Networks. In: Fiems, D., Paolieri, M., Platis, A. (eds) Computer Performance Engineering. EPEW 2016. Lecture Notes in Computer Science(), vol 9951. Springer, Cham. https://doi.org/10.1007/978-3-319-46433-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46433-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46432-9

  • Online ISBN: 978-3-319-46433-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation