Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

Abstract

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ γ ρ γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ t∈I ρ γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule.