A guided tour of Chernoff bounds
Information Processing Letters
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
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Batched disk scheduling with delays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Suppose $n$ circular arcs of lengths $\len_i \in [0,1],0\leq imaximum overlap, i.e., the number of arcs that overlap at the same position of the circle. In particular, we give almost exact tail bounds for this random variable. By applying these tail bounds we can characterize the expected maximum overlap exactly up to constant factors in lower order terms. We illustrate the strength of our results by presenting new performance guarantees for three algorithmic applications: minimizing rotational delays for disks, scheduling accesses to parallel disks, and allocating memory blocks to limit cache interference misses.