Prefix tables provide a mechanism for locating files in a system whose storage is distributed among many servers. The result is a single file system hierarchy visible uniformly and transparently to all clients. Each client of the file system maintains a local prefix table that identifies the server for a file based on the initial part of the file name. Prefix tables are built and modified using a simple broadcast protocol that is flexible enough to allow dynamic server reconfiguration and a simple form of replication.
Cited By
- Zhang W, Tang H, Byna S and Chen Y DART Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques, (1-12)
- Lindbäck L, Vlassov V, Mokarizadeh S and Violino G Churn tolerant virtual organization file system for grids Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II, (194-203)
- Patterson D (1987). A progress report on SPUR: February 1, 1987, ACM SIGARCH Computer Architecture News, 15:1, (15-21), Online publication date: 1-Mar-1987.
Recommendations
Large files, small writes, and pNFS
ICS '06: Proceedings of the 20th annual international conference on SupercomputingWorkload characterization studies highlight the prevalence of small and sequential data requests in scientific applications. Parallel file systems excel at large data transfers but sometimes at the expense of small I/O performance. pNFS is an NFSv4.1 ...
Global namespace for files
We propose a name service that enables construction of a uniform, global, hierarchical namespace, a key feature needed to create a file-system grid. Combined with other grid replication and location-lookup mechanisms, it supports independence of ...
Computing covers using prefix tables
An indeterminate stringx=x[1..n] on an alphabet is a sequence of nonempty subsets of ; x is said to be regular if every subset is of size one. A proper substring u of regular x is said to be a cover of x iff for every i1..n, an occurrence of u in x ...