Abstract | ||
---|---|---|
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matching the I/O access patterns and file data layout. Without this matching the applications may face the following problems: contention at I/O nodes, fragmentation of file data, false sharing, small network messages, high overhead of scattering/gathering the data. Clusterfile addresses some of these inefficiencies. Parallel applications can physically partition a file in arbitrary patterns. They can also set arbitrary views on a file. Views hide the parallel structure of the file and ease the programmer's burden of computing complex access indices. The intersections between views and layouts are computed by a memory redistribution algorithm. Read and write operations are optimized by pre-computing the direct mapping between access patterns and disks. Clusterfile uses the same data representation for file layouts, access patterns, and the mappings between each other. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1002/cpe.724 | Concurrency and Computation: Practice and Experience |
Keywords | DocType | Volume |
o access pattern,parallel file system,flexible physical layout,parallel structure,file data,parallel application,complex access index,access pattern,data layout,data representation,file layout,computational complexity | Journal | 15 |
Issue | ISSN | ISBN |
7-8 | 1552-5244 | 0-7695-1116-3 |
Citations | PageRank | References |
23 | 1.35 | 13 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Florin Isaila | 1 | 234 | 24.01 |
Walter F. Tichy | 2 | 2546 | 438.90 |