hybrid allocator based on btree allocator

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

 



hi Adam,

while looking at Hybrid Allocator [0] and the newly introduced Btree
Allocator [1], i am wondering if we still need the bitmap allocator to
cap the memory usage due to the large overhead of AVL allocator?
because btree is much more spatially efficient than AVL tree.

cheers

---
[0] https://github.com/ceph/ceph/pull/33365
[1] https://github.com/ceph/ceph/pull/41828
_______________________________________________
Dev mailing list -- dev@xxxxxxx
To unsubscribe send an email to dev-leave@xxxxxxx



[Index of Archives]     [CEPH Users]     [Ceph Devel]     [Ceph Large]     [Information on CEPH]     [Linux BTRFS]     [Linux USB Devel]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]

  Powered by Linux