Edward F. Grove

Learn More
Michael T. GoodrichjS Edward F. Grovefll Roberto Tamassia*t Darren Erik Vengrofftt Jeffrey Scott Vitterqt We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our results include:(More)
We consider the problem of sorting a file of N records on theD-disk model of parallel I/0 [VS94] in which there are two sourcesof parallehsm. Records are transferred to and from diskconcurrently in blocks of B con-tiguous records. In each I/Ooperation, up to one block can be transferred to or from each ofthe D disks in parallel. We propose a simple,(More)
In the load balancing problem, there is a set of servers, and jobs arrive sequentially. Each job can be run on some subset of the servers, and must be assigned to one of them in an online fashion. Traditionally, the assignment of jobs to servers is measured by the L1 norm; in other words, an assignment of jobs to servers is quanti ed by the maximum load(More)
We first present a simple algorithm for bin-packing that is worst-case optimal among bounded-space algorithms. However, it is not an online algorithm. We present a new definition of lookahead for online algorithms, and show how to convert the simple algorithm into a more complicated optimal algorithm that is online with bounded lookahead. The main(More)
We present a natural online perfect matching problem motivated by problems in mobile computing. A total of n customers connect and disconnect sequentially, and each customer has an associated set of stations to which it may connect. Each station has a capacity limit. We allow the network to preemptively switch a customer between allowed stations to make(More)
The <italic>k</italic>-server problem is a generalization of the paging problems, and is the most studied problem in the area of competive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the <italic>k</italic>-server problem. We give a simple proof that the Harmonic <italic>k<italic>-server algorithm is(More)
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in IR3 such that the aspect ratio of each rectangle in S is at most , for some constant 1. We present an n2O(plogn )-time algorithm to build a binary space partition of size n2O(plogn ) for S. We also show(More)
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to information about its own future page requests, and by using that local information along with randomization in the context of a global caching algorithm, we are able to break through(More)
We de ne a new complexity measure, called object complexity, for hidden-surface elimination algorithms. This model is more appropriate than the standard scene complexity measure used in computational geometry for predicting the performance of these algorithms on current graphics rendering systems. We also present an algorithm to determine the set of visible(More)
W e consider a cache shared by several concurrently running application processes and propose a provably efficient application-controlled global strategy for the shared cache. Using future information implicitly in the form of good decisions by application processes, we are able to break through the Hk lower bound on competitive ratio proved for classical(More)