Method for efficient non-virtual main memory management

The present invention provides a parallel memory scheduler (1120) for execution on a high speed parallel multiprocessor architecture (10). 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 into current free memory (50) even though a single contiguous space of sufficient size does not exist. Mapping these splits trough data control register sets (80) retains the user's contiguous view of the address space. The existence of dual images (14, 70) and partial swapping allows efficient, high speed swapping. Candidates for swap (150, 160, 170) our are chosen in an intelligent fashion, selecting only those candidates which will most efficiently allow the swapin of another process.