360 Zhihui Cloud Developer
Apr 8, 2018 · Operations
How DPRD Improves Data Placement Over CRUSH in Distributed Storage
This article introduces the DPRD hierarchical data placement strategy, explains its roots in the CRUSH algorithm, highlights CRUSH's migration inefficiencies, and details how DPRD achieves near‑theoretical replica movement and balanced distribution during both expansion and shrinkage of a distributed storage system.
CRUSH algorithmCephDPRD strategy
0 likes · 11 min read