Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs
SIAM Journal on Discrete Mathematics
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
On the near-optimality of the shortest-latency-time-first drum scheduling discipline
Communications of the ACM
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An Optimal Drum Scheduling Algorithm
IEEE Transactions on Computers
| Hi-index | 0.00 |
The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths 驴1, ..., 驴n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give almost exact tail bounds on the maximum overlap of the arcs. These tail bounds yield a characterization of the expected maximum overlap that is tight up to constant factors in the lower order terms. We illustrate the strength of our results by presenting new performance guarantees for several application: Minimizing rotational delays of disks, scheduling accesses to parallel disks and allocating memory to limit cache interference misses.