<--- Back to Details
First PageDocument Content
Distributed data storage / Computing / Concurrent computing / Distributed computing / Kademlia / Peer-to-peer / Distributed hash table / Mainline DHT
Date: 2014-12-08 14:33:02
Distributed data storage
Computing
Concurrent computing
Distributed computing
Kademlia
Peer-to-peer
Distributed hash table
Mainline DHT

A Kademlia­Based Peer­to­peer Filesystem  Bangert (bangert), Ezeaka (clezeaka), Liu (cliu2014), Zingales (zingales)    Code and writeup: http://github.mit.edu/2014­6824/final­6824    1 OVERVIEW 

Add to Reading List

Source URL: css.csail.mit.edu

Download Document from Source Website

File Size: 135,11 KB

Share Document on Facebook

Similar Documents

DATASHEET| 1 DATASHEET HEDVIG DISTRIBUTED STORAGE PLATFORM Hedvig’s software-defined storage solution provides the flexibility needed for rapidly changing data, application, and user requirements in private, hybrid, an

DocID: 1uRqj - View Document

BuildingDepot: An Extensible and Distributed Architecture for Building Data Storage, Access and Sharing Yuvraj Agarwal, Rajesh Gupta, Daisuke Komaki, Thomas Weng Department of Computer Science and Engineering, UCSD {yuv

DocID: 1uuFR - View Document

Ceph Software Defined Storage Appliance Unified distributed data storage cluster with self-healing, auto-balancing and no single point of failure Lowest power consumption in the industry: 70% power saving Infinite Scale

DocID: 1utGb - View Document

Computing / Data management / Data / Software / Database / Isolation / Data independence / Concurrency control / Extensible Storage Engine / Distributed database / Outline of databases

DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL THIRD EDITION Raghu Ramakrishnan

DocID: 1rsHj - View Document

Concurrent computing / Computing / Consensus / Distributed computing / Distributed data storage / Distributed algorithms

Exercise 4: Extreme Democracy Task 1: Everyone Gets exactly one Vote. . . The goal of this exercise is to prove correct the asynchronous safe broadcast algorithm by Bracha. It tolerates f < n/3 Byzantine faults, so we wi

DocID: 1rrE3 - View Document