Swap-Out Candidate Selection for Storage Management
Original Publication Date: 1986-Feb-01
Included in the Prior Art Database: 2005-Mar-08
All implemented storage management strategies are approximations of the optimum strategy: to release those pages whose use will be requested furthest in the future. The optimum has never been implemented because systems are unable to precisely determine future events. Implemented strategies include random page selection, first-in/first-out, least recently used, least frequently used, not recently used, and combinations and permutations of these. They generally involve some evaluation of past events to predict those of the future. The history evaluation is driven by the specific swapping objectives defined by the system environment. Items selected for swap out are pages within a virtual area. A virtual area is a program or a virtual work space.