By Topic

Issues in reliable network memory paging

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Markatos, E.P. ; Comput. Archit. & VLSI Syst. Group, Inst. of Comput. Sci., Crete, Greece

Recent distributed systems are connected with high-performance networks that make possible the use of a new level of memory hierarchy: network memory. Network memory provides both high bandwidth and low latency, that make it attractive for uses like paging and file caching. In this paper we explore the issues of building a reliable network memory system that is resilient to single workstation failures. We propose novel parity-based policies and evaluate their performance using trace-driven simulation of realistic applications. The presented performance results suggest that our proposed policies provide reliability at a surprisingly small run-time overhead

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96., Proceedings of the Fourth International Workshop on

Date of Conference:

1-3 Feb 1996