CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data

By S. Weil, Scott A. Brandt, Ethan L. Miller, C. Maltzahn. International Conference on Software Composition, 2006

439 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/d88ae008c11859ff72c1b8b16f2fd0f58dc47964

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Darrell D. E. Long
2. Ethan L. Miller
3. Nick Puz
4. Utkarsh Srivastava
5. Hans-Arno Jacobsen
6. Scott A. Brandt
7. Raghu Ramakrishnan
8. Philip Bohannon

Citations in the corpus

• Secure data deduplication (2008, methodology): “Alternatively , d terministic placement algorithms can be used to locate the correct storage devices based on the chunk’s identifier [18, 36, 8].”
• PNUTS: Yahoo!'s hosted data serving platform (2008, background): “Several investigators have argued for using a hash function that automatically assigns data to servers [14, 28].”
• Ceph: a scalable, high-performance distributed file system (2006, methodology): “Placement groups are then assigned to OSDs using CRUSH (Controlled Replication Under Scalable Hashing) [29], a pseudo-random data distribution function that efficiently maps each PG to an ordered list of OSDs upon which to store object replicas.”