E
Edward F. Grove
Researcher at Duke University
Publications - 15
Citations - 857
Edward F. Grove is an academic researcher from Duke University. The author has contributed to research in topics: Competitive analysis & Cache. The author has an hindex of 12, co-authored 15 publications receiving 844 citations. Previous affiliations of Edward F. Grove include University of Rhode Island & Max Planck Society.
Papers
More filters
Proceedings ArticleDOI
External-memory graph algorithms
Yi-Jen Chiang,Michael T. Goodrich,Edward F. Grove,Roberto Tamassia,Darren Erik Vengroff,Jeffrey Scott Vitter +5 more
TL;DR: A collection of new techniques for designing and analyzing external-memory algorithms for graph problems and illustrating how these techniques can be applied to a wide variety of speci c problems are presented.
Proceedings Article
Load Balancing in the Lp Norm
TL;DR: For any fixed p, 1 < p < M, it is shown that the greedy algorithm performs within a con- stant factor of the ofline optimal with respect to the L, norm, which grows linearly with p, which is best possible, but does not depend on the number of servers and jobs.
Journal ArticleDOI
Simple randomized mergesort on parallel disks
TL;DR: The upper bound derived on expected I/O performance of SRM indicates that SRM is provably better than disk-striped mergesort (DSM) for realistic parameter values D, M and B.
Proceedings ArticleDOI
Simple randomized mergesort on parallel disks
TL;DR: The expected I/O performance of SRM is efficient under varyingsizes of memory and that it compares favorably in practice todisk-striped mergesort (DSM), and studies indicate that SRM outperforms DSM even when the number D of parallel disks is fairlysmall.
Proceedings ArticleDOI
Load balancing in the L/sub p/ norm
TL;DR: It is shown that the greedy algorithm performs within a constant factor of the offline optimal with respect to the L/sub p/ norm, which grows linearly with p, which is best possible, but does not depend on the number of servers and jobs.