Re: T Trees

"Learner" <g.ankush1@xxxxxxxxx> writes:

Ya I actually searched many papers for it. What advantage I found out
in using T Trees is that it ll help in searching me the memory
location when I arracng the tree in order of memory address.
And usually a free should be much faster than a malloc
operation.

A memory allocator doesn't normally need to search for a block at
free time. Instead, the caller of the free function provides a
direct pointer to the block that needs to be freed.

So T tree might be much benefitial for it. Please let me know
if u think there might be some other data structure that could
be more appropriate than it . Becasuse linear linked lists need
sequential search and also normal trees would be quite some
tardy to search the node. Just see the link I had sent you, n u
could see the benefits of it. The only problem I m facing is in
understanding that how actually I ll be able to implement the
insert ,delete and rebalance the tree.

Seriously, read some papers on memory allocators instead of
trying to reinvent the wheel.
--
Aim to please, shoot to kill.
.

Relevant Pages

  • Re: On the road again...
    ... With a background of a large cattail swamp, a few trees and lingering wisps of fog was a small tree with 7 dead branches and each branch held a hunched up green heron. ... I hope my memory has captured it though. ... Be a big man..don't make Espoza use her own quarters at the laundry.. ...
    (rec.outdoors.rv-travel)
  • Re: On the road again...
    ... With a background of a large cattail swamp, a few trees and lingering wisps of fog was a small tree with 7 dead branches and each branch held a hunched up green heron. ... I hope my memory has captured it though. ... Be a big man..don't make Espoza use her own quarters at the laundry.. ...
    (rec.outdoors.rv-travel)
  • Re: Binary tree
    ... will be frequently searching / updated, ... trees without malloc in comp.programming / ... For fast, disk based trees, I doubt if you will beat this groovy ... memory, I would suggest the use of a self-balancing tree structure, ...
    (comp.lang.c)
  • Re: T Trees
    ... out in using T Trees is that it ll help in searching me the memory ... location when I arracng the tree in order of memory address. ... to combine with the freed space. ...
    (comp.programming)
  • Re: [PATCH/RFCv3 0/6] The Contiguous Memory Allocator framework
    ... this adds a new memory allocator implementation that steals ... completely different from the API for memory allocator. ... CMA adds notion of devices and memory ...
    (Linux-Kernel)