z-logo
open-access-imgOpen Access
Remote subpaging across a fast network
Author(s) -
Manjunath Bangalore,
Anand Sivasubramaniam
Publication year - 1998
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-64140-8
DOI - 10.1007/bfb0052208
Subject(s) - paging , demand paging , computer science , flexibility (engineering) , virtual memory , transfer (computing) , set (abstract data type) , working set , embedded system , operating system , memory management , semiconductor memory , statistics , mathematics , programming language
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 im- provements 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 ne grain (a subpage) data transfer unit for remote memory paging and to employ dierent algorithms for determining when and how to transfer these units. The novelty of our implementation is that all the policy deci- sions 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 benet signicantly from this flexibility.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom