Distributed Resource Selection using Cone


Cone is a distributed data structure that provides a distributed heap-based resource selection. Cone can address queries such as "Find me 10 machines that have CPU speed > 1 GHz", and "Find the host with the maximum available storage". Hence it can be used to build distributed systems which require scalable resource selection.

Publications



R. Bhagwan, P. Mahadevan, G. Varghese, G. M. Voelker.
Cone: A Distributed Heap Approach to Resource Selection
UCSD Technical Report CS2004-0784.

R. Bhagwan, G. Varghese, G. M. Voelker
Cone: Augmenting DHTs to Support Distributed Resource Discovery
SOSP poster session, October 2003.

R. Bhagwan, G. Varghese, G. M. Voelker
Cone: Augmenting DHTs to Support Distributed Resource Discovery
UCSD Technical Report No. CS2003-0755, July 2003.

People



Ranjita Bhagwan

Priya Mahadevan

George Varghese

Geoff Voelker