First Page | Document Content | |
---|---|---|
Date: 2009-08-05 10:48:33Computer programming Chord Trie B-tree Voldemort Replication Hash table Rope Computing Distributed data storage Data management | FAWN: A Fast Array of Wimpy Nodes David G. Andersen1 , Jason Franklin1 , Michael Kaminsky2 , Amar Phanishayee1 , Lawrence Tan1 , Vijay Vasudevan1 1 Carnegie Mellon University, 2 Intel LabsAdd to Reading ListSource URL: www.sigops.orgDownload Document from Source WebsiteFile Size: 755,65 KBShare Document on Facebook |