Re: my kmalloc implementation

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

 



Hi Bond,

On Fri, Oct 1, 2010 at 3:36 AM, Bond <jamesbond.2k.g@xxxxxxxxx> wrote:
> Wouldn't a sparse matrix implementation of this be a better thing.

There are many different algorithms, and you wanted to know how
indexes would work for tracking 1 byte allocations.

I guess it depends on how you define better...
The algorithm I presented is very fast, and it's O(1). It's limited to
255 bytes, but there are ways of extending it and still making it O(1)
(with the free portion perhaps being O(log2(n) in the general case).

You can spend a lifetime writing and analyzing different heap algorithms.

-- 
Dave Hylands
Shuswap, BC, Canada
http://www.DaveHylands.com/

--
To unsubscribe from this list: send an email with
"unsubscribe kernelnewbies" to ecartis@xxxxxxxxxxxx
Please read the FAQ at http://kernelnewbies.org/FAQ



[Index of Archives]     [Newbies FAQ]     [Linux Kernel Mentors]     [Linux Kernel Development]     [IETF Annouce]     [Git]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux RAID]     [Linux SCSI]     [Linux ACPI]
  Powered by Linux