Concurrent storage allocations or returns without need to lock f

Details Concurrent storage allocations or returns without need to lock f Concurrent storage allocations or returns without need to lock f

1994-09-23

1997-07-29

Chan, Eddie P.

39549701, 395600, 395650, G06F 1200

Patent

active

056528647

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.

REFERENCES:
patent: 4536837 (1985-08-01), Olson et al.
patent: 4937736 (1990-06-01), Chang et al.
patent: 4975870 (1990-12-01), Knicely et al.
patent: 5025367 (1991-06-01), Gurd et al.
patent: 5062038 (1991-10-01), Jordan, Jr.
patent: 5063501 (1991-11-01), Jordan, Jr.
patent: 5063502 (1991-11-01), Jordan, Jr.
patent: 5063504 (1991-11-01), Jordan, Jr.
patent: 5109336 (1992-04-01), Guenther et al.
patent: 5175852 (1992-12-01), Johnson et al.
patent: 5210848 (1993-05-01), Liu
patent: 5226155 (1993-07-01), Iijima
patent: 5247634 (1993-09-01), Cline et al.
patent: 5255387 (1993-10-01), Arnold et al.
patent: 5265245 (1993-11-01), Nordstrom et al.
patent: 5287521 (1994-02-01), Nitta et al.
patent: 5293600 (1994-03-01), Vriezen
patent: 5293614 (1994-03-01), Ferguson et al.
patent: 5339411 (1994-08-01), Heaton, Jr.
patent: 5418929 (1995-05-01), Tsuboi et al.
patent: 5420999 (1995-05-01), Mundy
patent: 5432908 (1995-07-01), Heddes et al.
patent: 5463776 (1995-10-01), Voigt et al.
patent: 5481702 (1996-01-01), Takahashi
patent: 5491810 (1996-02-01), Allen
patent: 5561785 (1996-10-01), Blandy et al.
IBM TDB, "Return On Consumption-Based Dynamic Butter Management Scheme in Query Environments", vol. 32, No. 12, May 1990, pp. 250-251.
IBM TDB, "Method for Managing Dynamic Storage", vol. 32 No. 1, Jun. 1987, p. 448.
IBM TDB, "Dynamic Allocation of Basic Storage Module and its Control Circuitry in a Dual Stream Processor System", vol. 27, No. 8, Jan. 1985, pp. 4763-4764.
C. Maples, "A High-Performance, Memory-Based Interconnection System for Multicomputer Environments", May 1990, pp. 295-304, Supercomputing '90.
Magnusson et al. "Queue Locks on Cache Coherent Multiprocessors", Jun. 1994, pp. 165-171, Parallel Processing 1994 Symposium.
Enterprise Systems Architecture/390 "Principles of Operation", SA22-7201-00 .

Affiliated with

Also associated with

Rating

Concurrent storage allocations or returns without need to lock f does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Concurrent storage allocations or returns without need to lock f, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concurrent storage allocations or returns without need to lock f will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-639919