Remote subpaging across a fast network
Manjunath Bangalore1
and Anand Sivasubramaniam1 
| (1) |
Department of Computer Science & Engineering, The Pennsylvania State University, 16802 University Park, PA |
Abstract
While improvements in semiconductor technology have made it possible to accommodate a large physical memory in today's machines,
the need for supporting an even larger virtual address space continues unabated. Improvements in disk access times have however
lagged improvements in both processor and memory speeds. Recent advances in networking technology has made it possible to
go out on the network and access the physical memory on other machines at a cost lower than accessing the local disk. This
paper describes a system implemented for such a remote paging environment. This system allows us to use a fine grain (a subpage)
data transfer unit for remote memory paging and to employ different algorithms for determining when and how to transfer these
units. The novelty of our implementation is that all the policy decisions about the subpage size and the subpaging algorithm
are made at the user level, thus letting applications choose their own set of parameters. Performance results indicate that
applications can benefit significantly from this flexibility.
This research is supported in part by a NSF Career Award MIP-9701475, EPA grant R825195-01-0, and equipment grants from NSF
and IBM.
References secured to subscribers.