follows. The descriptions are based on the assumption that neither
either was specified, then the algorithm must be appropriately modified.
soon as one of the steps succeeds, then processing can terminate.
2.
size.
3. Extends high-storage user storage downward into the user program
area, modifying
4. For fixed requests, there is nothing
requests,
largest block available on either the high-storage user chain or
the low-storage user chain. The allocated block is not
satisfactory, if it is not larger then the
request, until one succeeds.
is
the
1.
size.
2. Gets free pages from low-storage user chain, if any are available,
and removes them to the low-storage nucleus chain.
3.
size.
4. Gets free pages from the high-storage user chain, if they are
5. Extends high-storage nucleus storage downward into the user
6. For fixed requests, there is nothing
requests,
the user program area onto the nucleus chains, and allocates the
largest
the high-storage nucleus chains.
placed on the appropriate chain. At that point, the cleanup operation
is performed, if necessary, to advance
to
2-104 IBM