Abstract A Comparison of Sorting Algorithms for the Connection Machine CM-2 (2008)
Guy E. Blelloch, Bruce M. Maggs, C. Greg, Plaxton Stephen, J. Smith, ...
We have implemented three parallel sorting algorithms on the Con-nection Machine Supercomputer model CM-2: B atcher’s bitonic sort, a parallel radix sor ~ and a sample sort similar to Reif and...
Accessing Nearby Copies of Replicated Objects in a Distributed Environment (2008)
C. Greg, Plaxton Rajmohan, W. Richa
Abstract Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient...
Placement Algorithms for Hierarchical Cooperative Caching (2008)
Madhukar R. Korupolu\lambda, C. Greg, Plaxton\lambda Rajmohan Rajaramany
Online hierarchical cooperative caching (2008)
Xiaozhou Li, C. Greg, Plaxton Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set ofÒmachines residing in an ultrametric space cooperate with one...
Xiaozhou Li, C. Greg, Plaxton Mitul, Tiwari Arun Venkataramani
�Ð�ÓÖ�Ø�ÑÛ�Ø��Ô��ØÝ�ÐÓÛÙÔÇÐÓ�Ò �Û��Ö��� � �ÐÐÝÛ��×Ø��Ð�×��ÒªÐÓ�ÐÓ�ÒÐÓÛ�Ö�ÓÙÒ�ÓÒØ��ÓÑ...
586 Abstract Placement Algorithms for Hierarchical Cooperative Caching (2008)
Madhukar R. Korupolu, C. Greg, Plaxton Rajmohan Rajaramant
Consider a hierarchical network of machines in which each machine periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following...
Accessing Nearby Copies of Replicated Objects in a Distributed Environment (2008)
C. Greg, Plaxton Rajmohan, W. Richa
Abstract Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient...
Fast Fault-Tolerant Concurrent Access to Shared Objects (2007)
C. Greg, Plaxton Rajmohan Rajaraman
We consider a synchronous model of distributed computation in which n nodes communicate via point-topoint messages, subject to the following constraints: (i) in a single "step", a...
Optimal time bounds for approximate clustering (2002)
Clustering is a fundamental problem in unsuper-vised learning, and has been studied widely both as a problem of learning mixture models andas an optimization problem. In this paper, we study...
Verification of a concurrent deque implementation (1999)
Robert D. Blumofe, C. Greg, Plaxton Sandip Ray
We prove the correctness of the concurrent deque component of a recent implementation of the work-stealing algorithm. Specifically, we prove that this concurrent deque implementation is...
Verification of a Concurrent Deque Implementation (1999)
Robert D. Blumofe, C. Greg Plaxton, Sandip Ray, C. Greg, Plaxton Sandip Ray
We prove the correctness of the concurrent deque component of a recent implementation of the work-stealing algorithm. Specifically, we prove that this concurrent deque implementation is...
Placement Algorithms for Hierarchical Cooperative Caching \Lambda (1999)
Madhukar R. Korupoluy, C. Greg, Plaxton\lambda Rajmohan Rajaramanz
Verification of a concurrent deque implementation (1999)
Robert D. Blumofe, C. Greg, Plaxton Sandip Ray
We prove the correctness of the concurrent deque component of a recent implementation of the work-stealing algorithm. Specifically, we prove that this concurrent deque implementation is...
Placement Algorithms for Hierarchical Cooperative Caching \Lambda (1999)
Madhukar R. Korupoluy, C. Greg, Plaxton\lambda Rajmohan Rajaramanz
Verification of a Concurrent Deque Implementation (1999)
Robert Blumofe Greg, C. Greg, Plaxton Sandip Ray
We prove the correctness of the concurrent deque component of a recent implementation of the work-stealing algorithm. Specifically, we prove that this concurrent deque implementation is...
Analysis of a local search heuristic for facility location problems (1998)
Madhukar R. Korupolu, C. Greg, Plaxton Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomial-time constant-factor approximation...
Fast Fault-Tolerant Concurrent Access to Shared Objects (1996)
C. Greg Plaxton, C. Greg, Rajmohan Rajaraman
We consider a synchronous model of distributed computation in which n nodes communicate via point-to-point messages, subject to the following constraints: (i) in a single "step", a node can...