Minimizing metadata access latency in wide area networked file systems

HIGH PERFORMANCE COMPUTING - HIPC 2006, PROCEEDINGS(2006)

引用 5|浏览0
暂无评分
摘要
Traditional network file systems, like NFS, do not extend to wide-area due to low bandwidth and high network latency. We present WireFS, a Wide Area File System, which enables delegation of metadata management to nodes at client sites (homes). The home of a file stores the most recent copy of the file, serializes all updates, and streams updates to the central file server. WireFS uses access history to migrate the home of a file to the client site which accesses the file most frequently. We formulate the home migration problem as an integer programming problem, and present two algorithms: a dynamic programming approach to find the optimal solution, and a non-optimal but more efficient greedy algorithm. We show through extensive simulations that even in the WAN setting, access latency over WireFS is comparable to NFS performance in the LAN setting; the migration overhead is also marginal.
更多
查看译文
关键词
client site,metadata access latency,wide area,networked file system,home migration problem,nfs performance,lan setting,wan setting,traditional network file system,access latency,central file server,file store,access history,network file system,greedy algorithm,data management
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要