Performance Evaluation of Non-preemptive Policies for Scheduling Readers and Writers

The performance of non-preemptive policies for scheduling readers and writers is evaluated via event-driven simulation. As the performance measure of policies, throughput and response time are used basically and utilization, blocking overhead, and reader and writer response times are also used additionally. The performance behavior of policies is compared and analyzed based on the simulation results. From simulation results, the Counting Adaptive Priority(CAP) policy is shown as more eective in the overall performance than other policies because of its adaptiveness. 1 Introduction The reader-writer problem [1] is a well-known one in database and operating system and recently it has a great concern in the multithreaded programming environment [2, 3], which is a convenient and ecient method to realize concurrency in programs and is supported in most of operating systems and database systems. The reader-writer problem has a feature that various scheduling policies are possible du..