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

Abstract

The readers-writers problem is a classical one in the area of operating system and database. Although the problem has simple constraints, it has a feature that various scheduling policies can be applied to it. In this paper, we consider non-preemptive scheduling policies for solving the problem. In order to analyze detailed features of those policies, we define scheduling points and items of the readers-writers problem and present their semaphore-based solutions with a common style.