A Counter-based Adaptive Priority Scheduling Policy for the Readers-Writers Problem


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2997-3009, Nov. 1998
10.3745/KIPSTE.1998.5.11.2997,   PDF Download:

Abstract

Most of previous scheduling policies for the readers-writers problem have a problem that they show poor performance in one of throughput or response time because they are biased to one class of readers and writers. In this paper, we propose a new dynamic scheduling policy, Counter-based Adaptive Priority(CAP) to overcome the performance problem. The CAP policy is based on a dynamic combination of writer-weighting for non-concurrent writers and reader-aging for small waiting readers. CAP does not starve readers or writers and gives better performance than FCFS in both throughput and response time. To show the effectiveness of CAP, we present its semaphore-based solution. and compare the performance of CAP with that of previous policies through the event-driven simulation.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. S. II and L. H. Kyu, "A Counter-based Adaptive Priority Scheduling Policy for the Readers-Writers Problem," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2997-3009, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2997.

[ACM Style]
Kang Sung II and Lee Heung Kyu. 1998. A Counter-based Adaptive Priority Scheduling Policy for the Readers-Writers Problem. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2997-3009. DOI: 10.3745/KIPSTE.1998.5.11.2997.