Proportionate progress: a notion of fairness in resource allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)
SIAM Journal on Computing
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
A proportionate fair scheduling rule with good worst-case performance
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
On distributed smooth scheduling
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
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. This 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. 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 represents the needs of the clients and the digital player represents the scheduler.