Crush - nuts and bolts

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



I'd be interested in CRUSH algorithm simplified in series of
pictures. How does a storage node write and client  read, and
how do they calculate what they're after? What gets where/Where is it found/Why?

I suggest over-simplified storage system of e.g. 1 monitor, 4 storage nodes, 2 OSDs/node, 
3 PGs/OSD, 2 pools? 

http://ceph.com/papers/weil-crush-sc06.pdf did not solve this for me.


_______________________________________________
ceph-users mailing list
ceph-users@xxxxxxxxxxxxxx
http://lists.ceph.com/listinfo.cgi/ceph-users-ceph.com

[Index of Archives]     [Information on CEPH]     [Linux Filesystem Development]     [Ceph Development]     [Ceph Large]     [Ceph Dev]     [Linux USB Development]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]     [xfs]


  Powered by Linux