In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning keys to different computers (known as "nodes"); a node will store the values for all the keys for which it is responsible. Chord specifies how keys are assigned to nodes, and how a node can discover the value for a given key by first locating the node responsible for that key.
Chord is one of the four original distributed hash table protocols, along with CAN, Tapestry, and Pastry. It was introduced in 2001 by Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan, and was developed at MIT.
Other articles related to "chord":
... if (finger(n,id)) return finger return n The pseudocode to stabilize the chordring/circle after node joins and departures is as follows // create a new Chordring ... n.create predecessor = nil successor = n // join a Chordring containing node n' ...
Famous quotes containing the word chord:
“Give me the keys. I feel for the common chord again,
Sliding by semi-tones till I sink to a minor,yes,
And I blunt it into a ninth, and I stand on alien ground,
Surveying a while the heights I rolled from into the deep;
Which, hark, I have dared and done, for my resting-place is found,
The C Major of this life: so, now I will try to sleep.”
—Robert Browning (18121889)