By Topic

A dynamic migration algorithm for a distributed memory-based file management system

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

3 Author(s)
Griffioen, J. ; Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA ; Anderson, T.A. ; Breitbart, Y.

Conventional migration strategies attempt to evenly balance the load across all available server machines. The paper discusses why conventional migration approaches are not necessarily appropriate for distributed memory based file systems and presents an alternative approach that spreads data (possibly unevenly) across as few machines as possible and involves other available machines only as needed. The main advantage of our approach is that it keeps the system minimally distributed, thereby reducing the failure rate among servers, the communication overhead among servers, the time needed to compute data relocation, distributed addressing costs, and the probability of unanticipated migrations (e.g., caused by, and an inconvenience to, returning users)

Published in:

Research Issues in Data Engineering, 1997. Proceedings. Seventh International Workshop on

Date of Conference:

7-8 Apr 1997