Analysis and Solution of Non-preemptive Policies for Scheduling Readers and Writers

Operating Systems Review (ACM)

Volumn 32, Issue 3, 1998, Pages 30-50

  Kang, Sung I I ^a   Lee, Heung Kyu ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042537274     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/281258.281268     Document Type: Article

References (22)

1. L. Bic and A. C. Shaw. The Logical Operating Systems. Prentice-Hall, Englewood Cliffs, NJ, 1988.
2. P. A. Buhr, M. Fortier, and M. H. Coffin. Monitor classification. ACM Comput. Surveys, 27(1):64-107, 1995.
3. M.-I. Chen, C.-C. Han, and K.-J. Lin. Scheduling conditions for real-time readers and writers. In Proc. IEEE Int. Parallel Processing System, pages 656-659, 1992.
4. E. G. Coffman Jr., H. O. Pollak, E. Gelenbe, and R. C. Wood. An analysis of parallel-read sequential-write systems. Performance Evaluation, 1:62-69, 1981.
5. P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with readers and writers. Communications of ACM, 14(10):667-668, 1971.
6. C. Crowley. Operating Systems: A Design-Oriented Approach. IRWIN, Chicago, IL, 1997.
7. C. A. R. Hoare. Monitors: an operating system structuring concepts. Communications of ACM, 17(10):549-557, 1974.
8. T. Johnson. Approximate analysis of reader and writer access to a shared resource. In Proc. ACM SIGMETRICS Conf. on Measuring and Modeling of Computer Systems, pages 106-114, 1990.
9. O. Krieger, M. Stumm, R. Unrau, and J. Hanna. A fair fast scalable reader-writer lock. In Proc. Intl. Conf. on Parallel Processing, Williamsburg, VA, 1993.
10. V. G. Kulkarni and L. C. Puryear. A reader-writer queue with reader preference. Queueing Systems, 15:81-97, 1994.
11. V. G. Kulkarni and L. C. Puryear. Stability and queueing time analysis of a reader-writer queue with alternating exhaustive priorities. Queueing Systems, 19:81-103, 1995.
12. B. Lewis and D. J. Berg. Thread Primer: A Guide to Multithreaded Programming. SunSoft Press, Mountain View, CA, 1996.
13. J. M. Mellor-Crummey and M. L. Scott. Scalable reader-writer synchronization for shared-memory multiprocessors. In Proc. 3rd PPOPP, pages 106-113, Williamsburg, VA, 1991.
14. B. Nicols, D. Buttler, and J. P. Farrell. Pthreads Programming. O'Reilly & Associate, Sebastopol, CA, 1996.
15. S. J. Norton and M. D. Dipasquare. Thread Time: The Multithreaded Programming Guide. Prentice-Hall, Englewood Cliffs, NJ, 1997.
16. L. C. Puryear and V. G. Kulkarni. Comparison of stability and queueing time for reader-writer queues. Performance Evaluation, 30:195-215, 1997.
17. C. Schimmel. UNIX Systems for Modern Architectures: Symmetric Multiprocessing and Caching for Kernel Programmers. Addison-Wesley, Reading, MA, 1994.
18. M. I. Seltzer, C. Small, and K. Smith. The case for extensible operating systems. Technical Report TR-16-95, Department of Computer Science, Harvard University, 1995.
19. M. Singhal and N. G. Shivaratri. Advanced Concepts in Operating Systems: Distributed, Database, and Multiprocessor Operating Systems. McGraw-Hill, New York, NY, 1994.
20. W. Stallings. Operating Systems, 2nd Ed. Prentice-Hall, Englewood Cliffs, NJ, 1995.
21. A. Thomasian and V. F. Nicola. Performance analysis of a threshold policy for scheduling readers and writers. IEEE Transactions on Computers, 42(1):83-98, 1993.
22. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: flexible proportional-share resource management. In Proc. 5th Symposium on Operating System Design and Implementation, 1994.