Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Drawback in linked list is that to malloc() a chunk ,memory allocator has to search the link list and then if that address is found, return it.. So why not use a binary tree to reduce the search-time ?
One of the questions asked by NVIDIA
http://www.careercup.com/question?id=9765724
Found a relevant article that discusses it here
If I’m understanding you correctly, check this link out:
Time complexity of memory allocation
Heap allocation can be done by representing free memory as a linked list, but any reasonably sophisticated memory manager will use something faster, such as the AVL tree mentioned in an answer in the question I posted. There is even an O(1) solution called TLSF (Two Level Segregated Fit), also mentioned in the answer.