TY - GEN
T1 - Remote subpaging across a fast network
AU - Bangalore, Manjunath
AU - Sivasubramaniam, Anand
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84957702142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957702142&partnerID=8YFLogxK
U2 - 10.1007/BFb0052208
DO - 10.1007/BFb0052208
M3 - Conference contribution
AN - SCOPUS:84957702142
SN - 3540641408
SN - 9783540641407
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 74
EP - 87
BT - Network-Based Parallel Computing
A2 - Stunkel, Craig B.
A2 - Panda, Dhabaleswar K.
PB - Springer Verlag
T2 - 2nd International Workshop on Communication, Architecture, and Applications for Network-Based Parallel Computing, CANPC 1998
Y2 - 31 January 1998 through 1 February 1998
ER -