Abstract
Our NFS implementation, NFSP (NFS Parallèle) aims at providing some transparent ways to aggregate unused disk space by means of dividing a usually centralized NFS server into smaller entities: a metadata server and I/O servers. This paper illustrates the issues related to increasing the performances of such an implementation. Two different approaches have been taken: distributing the load across several servers and implementing the server in a more efficient and intrusive way (in kernel mode). The results obtained with both versions are given and compared to the ones of the first user-mode implementation. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Lombard, P., Denneulin, Y., Valentin, O., & Lebre, A. (2004). Improving the performances of a distributed NFS implementation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 405–412. https://doi.org/10.1007/978-3-540-24669-5_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
