Browse Prior Art Database

Optimal Thresholds for Scheduling Readers and Writers

IP.com Disclosure Number: IPCOM000037263D
Original Publication Date: 1989-Dec-01
Included in the Prior Art Database: 2005-Jan-29

Publishing Venue

IBM

Related People

Authors:
Nicola, V Thomasian, A [+details]

Abstract

Threshold based scheduling has been shown to outperform a first-come, first-served (FCFS) scheduler from the viewpoint of the maximum throughput that can be sustained in processing readers and writers [1]. We describe a heuristic to determine the threshold number for writers such that the overall mean response time of the system is minimized.