Download:
|
by Petra Berenbrink, Marco Riedel, Christian Scheideler
in 11th ACM Symposium on Parallel Architectures and Algorithms
http://wwwhni.upb.de/~barcom/DOCS/SPAA99.ps.gz
Add To MetaCart
Abstract:
In this paper we study the problem of scheduling real-time requests in distributed data servers. We assume the time to be divided into time steps of equal length called rounds. During every round a set of requests arrives at the system, and every resource is able to fulfill one request per round. Every request specifies two (distinct) resources and requires to get access to one of them. Furthermore, every request has a deadline of d, i.e. a request that arrives in round t has to be fulfilled during round t +d \Gamma 1 at the latest. The number of requests which arrive during some round and the two alternative resources of every request are selected by an adversary. The goal is to maximize the number of requests that are fulfilled before their deadlines expire. We examine the scheduling problem in an online setting, i.e. new requests continuously arrive at the system, and we have to determine online an assignment of the requests to the resources in such a way that every resource has to fulfill at most one request per round. We study both global (i.e. centralized) and local (i.e. distributed) scheduling strategies. In order to measure the performance of our scheduling strategies we apply competitive analyses. Previously, no non-trivial bounds have been known for the competitive ratio of scheduling strategies in our model. We present (partly matching) upper and lower bounds for several simple scheduling strategies. 1
Citations
|
82
|
An optimal algorithm for on-line bipartite matching
– Karp, Vazirani, et al.
- 1990
|
|
44
|
Parallel randomized load balancing
– Adler, Chakrabarti, et al.
- 1995
|
|
39
|
On the Analysis of Randomized Load Balancing Schemes
– Mitzenmacher
- 1997
|
|
33
|
Randomized Allocation Processes
– Czumaj, Stemann
- 1997
|
|
26
|
Random duplicated assignment: An alternative striping in video servers
– Korst
- 1997
|
|
24
|
On-line scheduling
– Sgall
- 1998
|
|
16
|
An O( p jV j \Delta jEj) algorithm for finding maximum matching in general graphs
– Micali, Vazirani
- 1980
|
|
15
|
Balanced allocations (extended abstract
– Azar, Broder, et al.
- 1994
|
|
15
|
Density dependent jump markov processes and applications to load balancing
– Mitzenmacher
- 1996
|
|
13
|
Friedhelm Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine
– Karp, Luby
- 1992
|
|
11
|
Recovery time of dynamic allocation processes
– Czumaj
- 1998
|
|
10
|
Analyzing an infinite parallel job allocation process
– Adler, Berenbrink, et al.
- 1998
|
|
7
|
Online network optimization problems
– Kalyanasundaram, Pruhs
- 1998
|
|
7
|
Matching Theory, volume 29
– Lovász, Plummer
- 1986
|
|
6
|
Parallel balanced allocations (extended abstract
– Stemann
- 1996
|
|
5
|
Allocating weighted balls in parallel
– Berenbrink, Heide, et al.
- 1997
|
|
3
|
Design of a fault tolerant realtime storage system for multimedia applications
– Muntz, Santos, et al.
- 1998
|
|
3
|
An O(jV j jEj) Algorithm for Finding Maximum Matchings in General Graphs
– Micali, Vazirani
- 1980
|
|
3
|
Online matching for scheduling problems
– Riedel
- 1999
|
|
1
|
Online scheduling of continuous media streams
– Monien, Berenbrink, et al.
- 1997
|
