Pre-Grant Publication Number: 20070118712
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer-to-Patent forwards the Top 10 most relevant prior art submissions and their annotations to the United States Patent and Trademark Office.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | A parallel memory scheduler for execution on a high speed highly parallel multiprocessor architecture. The operating system software provides intelligence and efficiency in swapping out process images to facilitate swapping in another process. The splitting and coalescing of data segments are used to fit segments in to current free memory even though a single contiguous space of sufficient size does not exist. Mapping these splits through data control register sets retains the user's contiguous view of the address space. The existence of dual images and partial swapping allows efficient, high speed swapping |
Basic Information
| Type of Prior Art | Issued Patents - US |
| Country | United States of America |
| Patent/Application # | 5159678 |
| Kind Code | United States (US) - Patent (no previous Pre-Grant ... - BA |
| Patentee Name | Wengelski et al |
| Relevant Pages, Columns, or Lines | Claims 24, 27, 30 |
| URL | http://patft.uspto.gov/netacgi/... |
| Filing Date | October 27, 1992 |
| Additional Information | |
Notes / To Do
| Notes | |
Excerpt
Excerpt 24. An improved method for operating a non-virtual main memory manager using swapin and swapout operations to allocate and un-allocate space in non-virtual main memory for one or more segments of one or more process images residing on a swap device in a computer processing system that includes one or more processors sharing the main memory and the swap device wherein the segments require space of varying sizes and all of the segments for a process image must be resident in the main memory before the process image can be executed by the computer processing system, and wherein the main memory manager performs a swapin operation for the segments of a selected swapin process image ready to execute and performs a swapout operation for the segments of one or more process images currently stored in the main memory, the steps of the improved method comprising:
determining for each segment of the selected swapin process image if space in main memory has or has not been allocated for that segment,
in the event that space in the main memory has not been allocated for a segment, then determining if sufficient contiguous space in the main memory can or cannot be allocated for that segment,
in the event that sufficient contiguous space in the main memory cannot be allocated for that segment, then attempting to allocate space in the main memory for that segment by allowing segments shared by more than one process image to be forced out of the main memory.
27. The improved method of claim 24 wherein the step of allocating space in the main memory comprises:
performing a swapout operation on segments in the main memory which are associated with other process images which do not have all segments associated with the process image contained in the main memory.
30. The improved method of claim 24 wherein the step of allocating space in the main memory comprises:
performing a swapout operation on adjacent segments in the main memory associated with other process image which is not currently executable and associated with process image which is currently executable and, such adjacent segments are adjacent to un-allocated space in the main memory such that the memory size of each segment combined with the memory size of the adjacent un-allocated space in the main memory is sufficient contiguous space in the main memory to contain that segment which is to be swapped into main memory.
|
Relevance
Claims
1
A method for allocating memory freed by applications in a computer system having an operating system (O/S), said method comprising:
a) designating a status of said one or more freed memory units previously associated with an application as available for reuse;
b) organizing one or more freed memory units having said available for reuse status into one or more free memory pools, wherein freed memory units in a pool are directly allocated to an application requiring backing physical memory store without the O/S deleting data in the freed memory units.
Relevance
See claims 24, 27, 30 of 5159678
See claims 24, 27, 30 of 5159678
Claim Chart
All
0 days left
