
www.Usenet.com
| <-- __Chronological__ --> | <-- __Thread__ --> |
Rick wrote: > > I'm trying to work on a memory manager for real-time operating systems > and I was wondering if someone could help me out. > > Since we want the cost of allocation to be bounded at runtime, I was > wondering if there's any material (literature) out there that exaplains > how one can determine what allocation mechanism/policy to use according > to the type of the object being allocated (for example, I want all > objects that have the type VM_Type to be allocated using a best-case > free-list, whereas I want the rest to be allocated using a worst-case > free-list algorithm). > > Is such policy mechanism implemented in any system that anyone might be > aware of? I'm interested in employing static allocation policies that > are either determinable by the type of object being allocated or the > allocation site. You might want to look at my nmalloc, available at: <http://cbfalconer.home.att.net/download/> which was developed to make all operations O(1). This is definitely bounded :-) The system was written for use with djgpp, but requires only sbrk (and a suitable memory model) to function elsewhere. -- Chuck F ([EMAIL PROTECTED]) ([EMAIL PROTECTED]) Available for consulting/temporary embedded and systems. <http://cbfalconer.home.att.net> USE worldnet address!
| <-- __Chronological__ --> | <-- __Thread__ --> |