An adaptive scheduling scheme for dynamic service time allocation on a shared resource

Abstract

We present a scheduling scheme that allows a munber of customers to share a common resource in an efficient and fair way. Each customer is allowed to use the resource for a time that does not ,exceed a certain limit, that limit being a function of the waiting time elapsed between the time of its last request and the time of access to the resource. After expiration of the service time allocated to a customer, i f more service is still needed, the customer has to re-enter the request queue and issue a new service request. This scheme combines the advantages of both processor sharing and FCFS disciplines. in a dynamic way. We also show the applicability and the advantages of our scheme in both open and closed system environments.

An adaptive scheduling scheme to efficient emergency call holding times in public safety network

“…The result (Fig. 4) proved that the calls into the net work depend on a call conversation time for the long LWT, medium-MWT, and short-SWT call conversa tion times, it clearly shows the same pattern as our analytical result this supports (8).…”

“…A dynamic holding time allocation scheme that uses adaptive quota ensures an efficiency approaching that of First Come First Serve (FCFS), especially under heavy load conditions [8]. Moreover, the priority re source allocation is proposed to support ongoing ac tivities in the LTU and IETF for developing the Inter national Emergency Preparedness Scheme (mpS) [9] [II ].…”

“…It proves that CHT has the best performance in terms of the maximum throughput. The maximum achievable throughput is presented by the differentia tion of the right side of equation (8).…”