I just finished reading the "CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data” paper and it looks like the Tree algorithm is the best compromise between mapping calculations and efficiency of reorganization. I know the default is Straw and see that almost everyone is using that default, including me. Is there a reason that Straw is favored over Tree other than it’s just the default. I’m interested in Tree because it looks like it provides performance improvements over Straw with only a small reorganization hit when OSD’s fail etc…
Thanks, James.
_______________________________________________ ceph-users mailing list ceph-users@lists.ceph.com http://lists.ceph.com/listinfo.cgi/ceph-users-ceph.com
