ceph: CRUSH mapping algorithm
CRUSH is a pseudorandom data distribution function designed to map inputs onto a dynamic hierarchy of devices, while minimizing the extent to which inputs are remapped when the devices are added or removed. It includes some features that are specifically useful for storage, most notably the ability to map each input onto a set of N devices that are separated across administrator-defined failure domains. CRUSH is used to distribute data across the cluster of Ceph storage nodes. More information about CRUSH can be found in this paper: http://www.ssrc.ucsc.edu/Papers/weil-sc06.pdfSigned-off-by: NSage Weil <sage@newdream.net>
Showing
fs/ceph/crush/crush.c
0 → 100644
fs/ceph/crush/crush.h
0 → 100644
fs/ceph/crush/hash.h
0 → 100644
fs/ceph/crush/mapper.c
0 → 100644
fs/ceph/crush/mapper.h
0 → 100644
想要评论请 注册 或 登录