Summary
The decay usage scheduler pursues long-term fairness in terms of both service bandwidth and service delay, in contrast to GPS (generalized processor sharing)-based schedulers pursuing short-term fairness only in terms of service bandwidth. Due to this bandwidth-delay-balancing characteristic of the decay usage scheduler, I/O-bound interactive processes are preferred to CPU-bound processes, resulting in fairness and better system utilization autonomously. However, there is no firm understanding of the mixed effects of the decay usage parameters on the service performance. This paper empirically analyzes their effects in terms of the resulting service bandwidth and service delay. Such analysis and understanding provides a basis of controlling the decay usage parameters for desirable service provision as required by applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bach, M.J.: The Design of the UNIX Operating System. Prentice-Hall, New Jersey (1986)
Bennett, J.C.R., Zhang, H.: WF2Q:Worst-case FairWeighted Fair Queueing. Proc. of INFOCOM ’96, 120–128 (1996)
Cruz, R.L.: Quality of Service Guarantees in Virtual Circuit Switched Network. Journal on Selected Areas in Communications, 13(6), 1048–1056 (1995)
Epema, D.H.J.: Decay Usage Scheduling in Multiprocessors. ACM Trans. Computer Systems, 16(4), 367–416 (1998)
Epema, D.H.J., de Jongh, J.F.C.M.: Proportional-Share Scheduling in Single-Server and Multiple-Server Computing Systems. ACM SIGMETRICS Performance Evaluation Review, 27(3), 7–10 (1999)
Fong, L.L., Squillante, M.S.: Time-Function Scheduling: A General Approach To Controllable Resource Management. IBM Research Report RC 20155 (1995)
Goodheart, B., Cox, J.: The Magic Garden Explained: The Internals of UNIX System V Release 4, an Open Systems Design. Prentice-Hall, New Jersey (1994)
Goyal, P., Vin, H.M., Cheng, H.: Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. IEEE/ACM Trans. Networking, 5(5), 690–704 (1997)
Hellerstein, J.L.: Achieving Service Rate Objectives with Decay Usage Scheduling. IEEE Trans. Software Engineering, 19(8), 813–825 (1993)
Love, R.: Linux Kernel Development, 2nd Ed. Novell, Massachusetts (2005)
McKusick, M.K., Neville-Neil, G.V.: The Design and Implementation of the FreeBSD Operating System. Addison-Wesley, Massachusetts (2004)
Moal, D.L., Masuda, M., Goshima, M., Mori, S., Nakashima, Y., Kitamura, T., Tomita, S.: Priority Enhanced Stride Scheduling. IPSJ Trans. HPCS, 43(SIG 6), 99–111 (2002)
Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Trans. Networking, 1(3), 344–357 (1993)
Petrou, D., Milford, J.W., Gibson, G.A.: Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers. Proc. of USENIX ’99, 1–14 (1999)
Pyun, K., Song, J., Lee, H.-K.: A Generalized Hierarchical Fair Service Curve Algorithm for High Network Utilization and Link-Sharing. Computer Networks, 43, 669–694 (2003)
Sariowan, H., Cruz, R.L., Polyzos, G.C.: SCED: A Generalized Scheduling Policy for Guaranteed Quality-of-Service. IEEE/ACM Transactions on Networking, 7(5), 669–684 (1999)
Vahalia, U.: UNIX Internals: The New Frontiers. Prentice-Hall, New Jersey (1996)
Waldspurger, C.A., Weihl, W.E.: Lottery Scheduling: Flexible Proportional-Share Resource Management. Proc. of the First Symposium on Operating Systems Design and Implementation, 1–11 (1994)
Waldspurger, C.A., Weihl, W.E.: Stride Scheduling: Deterministic Proportional-Share Resource Management. Technical Report MIT/LCS/TM-528, MIT, Massachusetts (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Basel AG
About this paper
Cite this paper
Park, K., Lee, J.H., Hwang, H., Lee, CG., Min, S.L., Suh, HJ. (2011). Analysis of Autonomous Bandwidth-Delay-Balancing Characteristic in the Decay Usage Scheduler. In: Shin, S., Gantenbein, R., Kuo, TW., Hong, J. (eds) Reliable and Autonomous Computational Science. Autonomic Systems. Springer, Basel. https://doi.org/10.1007/978-3-0348-0031-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0031-0_6
Published:
Publisher Name: Springer, Basel
Print ISBN: 978-3-0348-0030-3
Online ISBN: 978-3-0348-0031-0
eBook Packages: Computer ScienceComputer Science (R0)