The Chord project aims to build scalable, robust distributed systems using peer-to-peer ideas. The basis for much of our work is the Chord distributed hash lookup primitive. Chord is completely decentralized and symmetric, and can find data using only log(N) messages, where N is the number of nodes in the system. Chord's lookup mechanism is provably robust in the face of frequent node failures and re-joins. One way that we use Chord is as the basis for the CFS (Cooperative File System) storage system. CFS allows anyone to publish and update their own file system, and provides read-only access to others. CFS distributes the load of serving data very widely to achieve high performance despite flash crowds. It also replicates all data, and maintains that replication as nodes fail and re-join the system. This has been added to Grid Resources Subject Tracer™ Information Blog.
posted by Marcus Zillman |
4:10 AM
