Download
BTFF Features
O(log n) time with First-Fit behavior, as n is the number of allocated & free blocks.
No boundary tag.
Separation between payload and bookkeeping meta data.
It does not use any free payload area.
As of v1.0, payloads are located in data segment area which is acquired by brk(), and bookkeeping meta data are located in separated area which is acquired by mmap().
Small bookkeeping meta data overhead.
Applicable to any kind of resource allocation.
Memory, Disk, File, ...
Features
- O(log n) time with First-Fit behavior, as n is the number of allocated & free blocks.
- No boundary tag.
- Separation between payload and bookkeeping meta data.
- Small bookkeeping meta data overhead.
Follow B Tree First-Fit malloc()
Other Useful Business Software
Build Data Resilience - Take the Assessment Today
Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of B Tree First-Fit malloc()!
