Method for providing concurrent non-blocking heap memory...

Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S100000, C711S150000, C711S168000

Reexamination Certificate

active

07076629

ABSTRACT:
The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return is to the end or bottom of the linked list. In this way, software streams may remove and return blocks of heap memory simultaneously with hardware devices returning blocks of heap memory.

REFERENCES:
patent: 6076151 (2000-06-01), Meier
patent: 6412053 (2002-06-01), Bonola
patent: 6504768 (2003-01-01), Roohparvar et al.
patent: 2001/0056420 (2001-12-01), Steele et al.
patent: 2002/0144073 (2002-10-01), Trainin et al.
Non-Blocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors, Maged M. Michael, Michael L. Scott, Mar. 1997 (35 pg.).

LandOfFree

Say what you really think

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

Rating

Method for providing concurrent non-blocking heap memory... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for providing concurrent non-blocking heap memory..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for providing concurrent non-blocking heap memory... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3530473

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