publication . Article . Other literature type . 2005

Process Synchronization with Readers and Writers Revisited

Kawash, Jalal;
Open Access
  • Published: 01 Jan 2005 Journal: Journal of Computing and Information Technology, volume 13, page 43 (issn: 1330-1136, eissn: 1846-3908, Copyright policy)
  • Publisher: Faculty of Electrical Engineering and Computing, Univ. of Zagreb
The readers-writers problem is one of the very well known problems in concurrency theory. It was first introduced by Courtois in 1971 [1] and requires the synchronization of processes trying to read and write a shared resource. Several readers are allowed to access the resource simultaneously, but a writer must be given exclusive access to that resource. Courtois gave semaphore-based solutions to what they called the first and second readers-writers problems. Both of their solutions are prone to starvation. The first allows readers to indefinitely lock out writers and the second allows writers to indefinitely lock out readers. This paper presents a...

1 P. J., COURTOIS, F. HEYMANS, AND D. L. PARNAS, Concurrent Control with 'Readers' and 'Writers', Communications of the ACM 14 10 :667-668, 1971.

2 E. DIJKSTRA, Cooperating Sequential Processes, in F. Genuys, editor, Programming Languages, Academic Press, 1968.

3 G. J. HOLZMANN, The Model Checker SPIN, IEEE Transactions on Software Engineering 23 5 :1-5, 1997.

4 Y. J. JOUNG, Asynchronous Group Mutual Exclusion, in Proc. 17thACM Symp. Principles of Distributed Computing, pp. 51-60, 1998.

5 P. KEANE AND M. MOIR, A Simple Local-Spin Group Mutual Exclusion Algorithm, IEEETtrans. Parallel and Distributed Systems 12 7 :673-685, 2001.

6 L. LAMPORT, How to Make a Multiprocessor Computer that Correctly Executes Multiprocess programs, IEEE Transactions on Computers C28 9 :690-691, 1979.

7 C. LANGRIS AND E. MOUTZOUKIS, A Batch Arrival Reader-Writer Queue with Retrial Writers, Commun. Statist, Stochast. Models, 13 3 :523-545, 1997.

8 G. PETERSON, Myths About the Mutual Exclusion Problem, Parallel Processing Letters 12 3 :115- 116, 1981.

9 M. RAYNAL, Algorithms for Mutual Exclusion, The MIT Press, 1986.

10 T. SANLI AND V. KULKARNI, Optimal Admission to Reader-Writer Systems with no Queuing, Operations Research Letters 25:213-218, 1999.

A. SILBERSCHATZ AND P. GALVIN, Operating System Concepts 5thed., Wiley, 1999.

W. STALLINGS, Operating Systems 4thed., Prentice Hall, 2001.

A. S. TANENBAUM AND A. S. WOODHULL, Operating Systems Design and Implementation 2nded., Prentice Hall, 1997.

14 E. XU AND A. S. ALFA, A Vacation Model for the Non-saturated Readers and Writers with a Threshold Policy, Performance Evaluation 50:233-244, 2002. [OpenAIRE]

Received: November, 2003 Accepted: September, 2004 Jalal Kawash Department of Computer Science American University of Sharjah P.O.Box 2666 Sharjah UAE

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue