Optimal Resource Allocation for Two Processes*

Abstract
Two processes compete for access to n resources. A scheduling policy allocates the resource when the processes request it simultaneously. The objective is to minimize the average value of a state-dependent cost. The optimal policy can be calculated explicitly for the case of one resource. In the general case n < 1, an adaptive scheduling algorithm is proposed. The algorithm measures average transition times of the system and converges to the optimal policy.

This publication has 10 references indexed in Scilit: