by Peter S, Berthold Vocking
http://www.mpi-sb.mpg.de/~sanders/papers/swat02full.ps.gz
Add To MetaCart
Abstract:
The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths a i, 0 i! n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give bounds that are tight up to constant factors in the lower order terms using a technique that combines Chernoff bounds with random walks. These bounds yield performance guarantees for several application: Minimizing rotational delays of disks, scheduling accesses to parallel disks and allocating memory to limit cache interference misses.
Citations
|
852
|
An introduction to probability theory and its applications
– Feller
- 1968
|
|
421
|
An Introduction to Disk Drive Mod-eling
– Ruemmler, Wilkes
- 1994
|
|
166
|
A guided tour of Chernoff bounds
– Hagerup, Rub
- 1990
|
|
163
|
Balanced allocations
– Azar, Broder, et al.
- 1999
|
|
95
|
The complexity of coloring circular arcs and chords
– Garey, Johnson, et al.
- 1979
|
|
82
|
auf der Heide. Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
52
|
On the Lambert W function
– Corless, Gonnet, et al.
- 1996
|
|
39
|
The power of two random choices: A survey of the techniques and results
– Mitzenmacher, Richa, et al.
- 2001
|
|
32
|
Balanced Allocations: The Heavily Loaded Case
– Berenbrink, Czumaj, et al.
- 2000
|
|
29
|
Fast concurrent access to parallel disks
– Sanders, Egner, et al.
- 2000
|
|
19
|
Accessing multiple sequences through set associative caches
– Sanders
- 1999
|
|
13
|
A linear algorithm for maximum weight cliques in proper circular arc graphs
– Bhattacharya, Hell, et al.
- 1996
|
|
9
|
Average case analysis of algorithms and data structures
– Vitter, Flajolet
- 1990
|
|
8
|
balls into bins" --- A simple and tight analysis
– Raab, Steger
- 1998
|
|
7
|
What are the intersection graphs of arcs in a circle
– Klee
- 1969
|
|
5
|
An optimal drum scheduling algorithm
– Fuller
- 1972
|
|
4
|
Covering the circle with random arcs of random sizes
– Siegel, Holst
- 1982
|
|
3
|
Technical developments: Magnetic drum storage for digital information processing systems
– Cohen
- 1950
|
|
2
|
On the near-optimality of the shortest-access-time-first drum scheduling discipline
– Stone, Fuller
- 1973
|
