Memory allocation method for allocating two logical store areas

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 364243, 3642547, 39549702, 395412, 395413, G06F 1200, G06F 1300

Patent

active

057271852

ABSTRACT:
A method for dynamic management of a free store of a computer system, the free store being subdivided into at least two logical store areas with different access characteristics. Each logical store area of the at least two logical stores is separately managed. A segment is assigned size to a logical store area of the free store, the segment size corresponding to a maximum size described as a maximum in a buddy algorithm. In the event of a store request regarding a first logical store area of the at least two logical store areas, a segment from the free store is assigned to the first logical store area if there is no store segment of sufficient size available. In the event of a store request regarding a second logical store area of the at least two logical store areas, a segment from the free store which has not been assigned to any other logical store area is assigned to the second logical store area and which is adjacent to already assigned segments if no store segment of sufficient size is available. If it is no longer possible to satisfy a store request from a logical store area of the at least two logical store areas, which requires an assignment from the free store, since the free store has already been completely assigned, store managements of the other store areas are evaluated via a store management of this store area to ascertain whether there are other segments in the other store areas with the maximum size. If this condition is met, it takes over such other segment from a respective other store area and the other segment is assigned to this store area.

REFERENCES:
patent: 4084225 (1978-04-01), Anderson et al.
patent: 4445170 (1984-04-01), Hughes et al.
patent: 5159678 (1992-10-01), Wengelski et al.
"A Weighted Buddy Method for Dynamic Storage Allocation", Kenneth K. Shen et al, Communications of the ACM, vol. 17, No. 10, Oct. 1974, pp. 558-562.
"Mainframe Memory For Microcomputers", J.F. Stockton, Computer Design, vol. 21, No. 1, Jan. 1982, pp. 139-147.
386 DX Programmer's Reference Manual 1989, INTEL "Kapitel", chapter 5, Memory Management; chapter 6 Protection; 26 pages, double sided.
"The Art of Computer Programming", D.E. Knuth, vol. 1, Addison-Wesley, Reading Mass., 1986, 2nd edition, 1973, pp. 435-441.
386 DX Programmer's Reference manual 1990, INTEL the Microcomputer Company, "Microprocessors", chapter 4, pp. 202-211.
"An Efficient Database Storage Structure for Large Dynamic Objects", Alexandros Biliris, Eighth International Conference on Data Engineering, 2 Feb. 1992, pp. 301-308.
"Space Efficient Parallel Buddy Memory Management", Proceedings. ICCI '92, Fourth International Conference on Computing and Information, pp. 128-132, May 28, 1992.

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

Memory allocation method for allocating two logical store areas 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 method for allocating two logical store areas , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory allocation method for allocating two logical store areas will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-149212

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