An Operating Systems Vade Mecum

References 325D. E. KNUTH, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Reading,Mass.: Addison-Wesley (2nd ed.) (1973).D. E. KNUTH, The TeXBook, Reading, Mass.: Addison-Wesley (1984).L. LAMPORT, ‘‘Concurrent Reading and Writing,’’ CACM 20(11) pp. 806-811 (November 1977).B. W. LAMPSON AND D. D. REDELL, ‘‘Experience with Processes and Monitors in Mesa,’’ CACM23(2) pp. 105-117 (February 1980).K. A. LANTZ AND R. F. RASHID, ‘‘Virtual Terminal Management in a Multiple Process Environment,’’Proceedings of the 7th Symposium on Operating Systems Principles, pp. 86-97(December 1979).S. LAUESEN, ‘‘Job Scheduling Guaranteeing Reasonable Turn-around Times,’’ Acta Informatica2(1) pp. 1-11 (1973).E. D. LAZOWSKA ET AL., ‘‘The Architecture of the Eden System,’’ Proceedings of the 8th Symposiumon Operating Systems Principles, pp. 148-159 (December 1981).E. D. LAZOWSKA ET AL., Quantitative System Performance, (et al.), Englewood Cliffs, N.J.:Prentice-Hall (1984).R. LEVIN ET AL., ‘‘Policy/mechanism Separation in Hydra,’’ Proceedings of the 6th Symposium onOperating Systems Principles, pp. 132-140 (1977).B. LISKOV AND R. SCHEIFLER, ‘‘Guardians and Actions: Linguistic Support for Robust, DistributedPrograms,’’ ACM TOPLAS 5(3) pp. 381-404 (July 1983).D. C. LITTLE, ‘‘A Proof of the Queueing Formula: L =λW ,’’ Operations Research 9 pp. 383-387(May 1961).H. MADDURI AND R. FINKEL, ‘‘Extension of the Banker’s Algorithm for Resource Allocation in aDistributed Operating System,’’ Information Processing Letters 19(1) pp. 1-8 (July 1984).H. MADDURI AND R. FINKEL, A Note on Starvation Control Policies, Computer Sciences TechnicalReport 564, University of Wisconsin−Madison (November 1984).S. E. MADNICK AND J. J. DONOVAN, Operating Systems, New York: McGraw-Hill (1972).M. MAEKAWA, A.E.OLDEHOEFT, AND R. R. OLDEHOEFT, Operating Systems: Advanced concepts,Benjamin-Cummings (1987).B. H. MARGOLIN, R.P.PARMELEE, AND M. SCHATZOFF, ‘‘Analysis of Free-storage Algorithms,’’IBM System Journal 10(4) p. 283 (1971).T. MASUDA, ‘‘Effect of Program Localities on Memory management strategies,’’ Proceedings ofthe 6th Symposium on Operating Systems Principles, pp. 117-124 (November 1977).N. MEYROWITZ AND M. MOSER, ‘‘Bruwin: An Adaptable Design Strategy for WindowManger/Virtual Terminal Systems,’’ Proceedings of the 8th Symposium on Operating SystemPrinciples, pp. 180-189 (December 1981).T. MINOURA, ‘‘Deadlock Avoidance Revisited,’’ Journal of the ACM 29(4) pp. 1023-1048(October 1982).J. G. MITCHELL AND J. DION, ‘‘A Comparison of Two Network-based File Servers,’’ CACM25(4) pp. 233-245 (April 1982).R. M. NEEDHAM AND A. D. BIRRELL, ‘‘The CAP Filing System,’’ Proceedings of the 6th Symposiumon Operating Systems Principles, pp. 11-16 (November 1977).R. M. NEEDHAM AND R. D. H. WALKER, ‘‘The Cambridge CAP Computer and its Protection System,’’Proceedings of the 6th Symposium on Operating Systems Principles, pp. 1-10 (November1977).J. K. OUSTERHOUT, D.A.SCELZA, AND S. S. PRADEEP, ‘‘Medusa: An Experiment in DistributedOperating System Structure,’’ CACM 23(2) pp. 92-105 (February 1980).D. L. PARNAS AND A. N. HABERMANN, ‘‘Comment on Deadlock Prevention (with reply by R.C.Holt),’’ CACM 15(9) pp. 840-841 (September 1972).