Decay-Usage Scheduling in Multiprocessors

ACM Transactions on Computer Systems

Volumn 16, Issue 4, 1998, Pages 367-415

  Epema, D H J ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Control; Convergence; D.4.1 Operating Systems : Process Management multiprocessing multiprogramming; scheduling; D.4.8 Operating Systems : Performance measurements; modeling and prediction; simulation; Decay usage; Measurement; Performance; Priorities

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; SCHEDULING; TIME SHARING PROGRAMS;

DECAY-USAGE SCHEDULING;

MULTIPROCESSING SYSTEMS;

EID: 0032204647     PISSN: 07342071     EISSN: None     Source Type: Journal    
DOI: 10.1145/292523.292535     Document Type: Article

References (22)

1. BACH, M. J. 1986. The Design of the UNIX Operating System. Prentice-Hall Software Series. Prentice-Hall, Inc., Upper Saddle River, NJ.
2. BLACK, D. L. 1990a. Scheduling and resource management techniques for multiprocessors. Tech. Rep. CMU-CS-90-152. Carnegie Mellon University, Pittsburgh, PA.
3. BLACK, D. L. 1990b. Scheduling support for concurrency and parallelism in the Mach operating system. Computer 23, 5 (May), 35-43.
4. CURRAN, S. AND STUMM, M. 1990. A comparison of basic CPU scheduling algorithms for multiprocessor UNIX. Comput. Syst. 3, 551-579.
5. DEMERS, A., KESHAV, S., AND SHENKER, S. 1989. Analysis and simulation of a fair queueing algorithm. SIGCOMM Comput. Commun. Rev. 19, 4 (Sept.), 1-12.
6. ESSICK, R. B. 1990. An event-based fair share scheduler. In Proceedings of the Winter 1990 USENIX Conference. USENIX Assoc., Berkeley, CA, 147-161.
7. FAYOLLE, G., MITRANI, I., AND IASNOGORODSKI, R. 1980. Sharing a processor among many job classes. J. ACM 27, 3 (July), 519-532.
8. FONG, L. L. AND SQUILLANTE, M. S. 1995. Time-function scheduling: A general approach to controllable resource management. Tech. Rep. RC 20155. Research Division, IBM, New York, NY.
9. GOODHEART, B. AND COX, J. 1994. The Magic Garden Explained, The Internals of UNIX System V Release 4: An Open Systems Design. Prentice-Hall, Inc., Upper Saddle River, NJ.
10. GREENBERG, A. G. AND MADRAS, N. 1992. How fair is fair queuing?. J. ACM 39, 3 (July), 568-598.
11. HELLERSTEIN, J. L. 1992. Control considerations for CPU scheduling in UNIX systems. In Proceedings of the Winter 1992 USENIX Conference. USENIX Assoc., Berkeley, CA, 359-374.
12. HELLERSTEIN, J. L. 1993. Achieving service rate objectives with decay-usage scheduling. IEEE Trans. Softw. Eng. 19, 813-825.
13. HENRY, G. J. 1984. The fair share scheduler. AT&T Bell Lab. Tech. J. 63, 8 (Oct.), 1845-1857.
14. KAY, J. AND LAUDER, P. 1988. A fair share scheduler. Commun. ACM 31, 1 (Jan.), 44-55.
15. KLEINROCK, L. 1967. Time-shared systems: A theoretical treatment. J. ACM 14, 2 (Apr.), 242-261.
16. LEFFLER, S. J., MCKUSICK, M. K., KARELS, M. J., AND QUARTERMAN, J. S. 1989. The Design and Implementation of the 4.3BSD UNIX Operating System. Addison-Wesley, Reading, MA.
17. MCKUSICK, M. K., BOSTIC, K., KARELS, M. J., AND QUARTERMAN, J. S. 1996. The Design and Implementation of the 4.4BSD Operating System. Addison-Wesley, Reading, MA.
18. PAREKH, A. K. AND GALLAGER, R. G. 1992. A generalized processor sharing approach to flow control in integrated services networks - the single node case. In Proceedings of the 11th Annual Joint Conference of the IEEE Computer and Communications Societies on One World through Communications (INFOCOM '92, Florence, Italy, May 4-8). IEEE Computer Society Press, Los Alamitos, CA, 915-924.
19. STOICA, I. AND ABDEL-WAHAB, H. 1995. Earliest eligible virtual deadline first: A flexible and accurate mechanism for proportional-share resource allocation. Tech. Rep. TR-95-22. Old Dominion University, Norfolk, VA.
20. VAHALIA, U. 1996. UNIX Internals: The New Frontiers. Prentice-Hall, Inc., Upper Saddle River, NJ.
21. WALDSPURGER, C. A. AND WEIHL, W. E. 1994. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation. USENIX Assoc., Berkeley, CA, 1-11.
22. WALDSPURGER, C. A. AND WEIHL, W. E. 1995. Stride scheduling: Deterministic proportional-share resource management. Tech. Rep. MIT/LCS/TM-528. MIT Laboratory for Computer Science, Cambridge, MA.