This is my personal blog. The views expressed on these pages are mine alone and not those of my employer.

Tuesday, February 03, 2004

Coral: The New York University Distribution Network: "Coral is built on a novel distributed lookup abstraction we call a distributed sloppy hash table, or DSHT. DSHTs simply map keys to values, but do so in a way that avoids hot spots when large numbers of (key, value) pairs have the same key. Even if every node of a DSHT repeatedly stores the same key, the rate of store requests at the most heavily-loaded node is only logarithmic in the total number of nodes. When nodes retrieve a key from a DSHT, they receive only a subset of the values stored. DSHTs are well-suited to indexing the locations of replicated objects, because while many replicas may need to be indexed, those seeking objects really only need to find one good replica."

Comments: Post a Comment

Subscribe to Post Comments [Atom]



Links to this post:

Create a Link



<< Home

This page is powered by Blogger. Isn't yours?

Subscribe to Posts [Atom]