An adaptive scheduling scheme for dynamic service time allocationon a shared resource

摘要

A scheduling scheme that allows a number of customers to share acommon resource in an efficient and fair way is presented. Each customeris allowed to use the resource for an amount of time that does notexceed a certain limit, the limit being a function of the waiting timeelapsed between the time of its last request and the time of access tothe resource. After expiration of the service time allocated to acustomer, if more service is still needed, the customer has to re-enterthe request queue and issue a new service request. The scheme combinesthe advantages of both processor-sharing and first-come, first-serveddisciplines in a dynamic way. The applicability and the advantages ofthe scheme in both open and closed system environments are discussed