Allocation of interdependent resources for maximal throughput

Abstract

A general queueing network model of computer and communication systems with interdependent resources is considered. The resources are modeled by a collection of servers that have to be allocated subject to certain constraints. Arrivals are Poisson, services are independent and identically distributed and service completions of different customers cannot be synchronized. A set of necessary conditions for the finiteness of long run average delays is obtained. An adaptive non-preemptive scheduling policy is presented and a set of sufficient conditions under which the policy achieves finite delays, is identified. The necessary and sufficient conditions differ only on the boundary region. The policy does not depend on the knowledge of the arrival rates and has polynomial time complexity for some applications