Memory allocation maintaining ordering across multiple heaps

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 12/02 (2006.01) G06F 9/445 (2006.01)

Patent

CA 2173819

A method and apparatus for adding and deleting data in a plurality of heaps stored in memory, where the ordering of the data in the heaps is maintained across the heaps as the additions and deletions are performed. Not all entries in the heaps have a corresponding entry in all of the other heaps, hut the ordering of the data in the heaps is in accordance with an order dependent list stored in memory. Such ordered heaps are useful for example, in a incremental linker software program.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Memory allocation maintaining ordering across multiple heaps does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory allocation maintaining ordering across multiple heaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory allocation maintaining ordering across multiple heaps will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1490795

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.