Links

Tools

Export citation

Search in Google Scholar

Removing Bottlenecks in Distributed Filesystems: Coda InterMezzo as examples

Journal article published in 1999 by As Examples, Peter J. Braam, Philip A. Nelson
This paper was not found in any repository; the policy of its publisher is unknown or unclear.
This paper was not found in any repository; the policy of its publisher is unknown or unclear.

Full text: Unavailable

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

Is it possible for a distributed filesystem to perform at the same speed as local disk filesystems, at least in important cases? This paper is trying to answer this question for traditional client-server distributed filesystems, not for distributed filesystems exploiting very fast networks and disk striping techniques. We claim the answer is "yes". Systems such as AFS, Sprite, Coda, Arla and DFS showed what can be achieved by eliminating much RPC traffic, while NFS showed how aggressive kernel optimizations can help. Performance analysis of Coda and NFS shows that in order to achieve local disk performance on read traffic the kernel needs more autonomy. In Coda this leads to satisfactory results, both in micro benchmarks and in a http server benchmark. For read/write traffic performance is worse. Many operations lead to synchronous RPCs, but a new write-back caching model can permit a client to proceed without server interference and will eliminate most of the remaining...