Concurrent storage allocations or returns without need to lock free storage chain
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jul 29, 1997
Grant Date -
N/A
app pub date -
Sep 23, 1994
filing date -
Sep 23, 1994
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Two or more storage allocation requests in a computer system can be made concurrently. Available storage blocks are chained together. A length of the respective block and a pointer to the next block in the chain are stored in each block. The chain is searched to identify one of the available blocks to satisfy one storage allocation request while permitting allocation of another block on the chain pursuant to another storage allocation request. While permitting allocation of another block on the chain pursuant to another storage allocation request, access to the one block is prevented pursuant to this other request and the length of the one block is reduced by an amount equal or greater than that of the one request such that after the preventing step another storage allocation request cannot be satisfied from the length by which the one block was reduced. Storage block return and allocation requests can also be made concurrently.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully