swapping order?

Sheldon E. Newhouse (sen@math.msu.edu)
Mon, 3 Jun 1996 23:15:10 -0400

When real memory is exhausted, how does the system choose to swap? Is it
based on programs which have been idle the longest, use the fewest
resources, or what? Is there a specific algorithm which is used,
relating cache, etc? Also, how and when does the system relinquish the
swapped space when it no longer needs it? Where might I find out about
these things?

Thanks,
-sen

---------------------------------------------------------------------------
| Sheldon E. Newhouse | mail: newhouse@math.msu.edu |
| Mathematics Department | www: http://www.mth.msu.edu/~sen |
| Michigan State University | telephone: 517-355-9684 |
| E. Lansing, MI 48824-1027 USA | FAX: 517-432-1562 |
---------------------------------------------------------------------------
RH Reg. No. 300031,