Parallel file systems for the IBM SP computers
IBM Systems Journal
Server-directed collective I/O in Panda
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Input/output characteristics of scalable parallel applications
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
PPFS: a high performance portable parallel file system
ICS '95 Proceedings of the 9th international conference on Supercomputing
The Vesta parallel file system
ACM Transactions on Computer Systems (TOCS)
File-Access Characteristics of Parallel Scientific Workloads
IEEE Transactions on Parallel and Distributed Systems
The Galley parallel file system
Parallel Computing - Special double issue: parallel I/O
IEEE Parallel & Distributed Technology: Systems & Technology
Workload Characterization of Input/Output Intensive Parallel Applications
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Clusterfile: A Flexible Physical Layout Parallel File System
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
PVFS: a parallel file system for linux clusters
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Localization techniques for cluster-based data grid
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Localized communications of data parallel programs on multi-cluster grid systems
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Optimizations of data distribution localities in cluster grid environments
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.01 |
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between two arbitrary distributions of a parallel file. Each of the two distributions may be physical or logical. The algorithms are optimized for multidimensional array partitions. We motivate our approach and present potential utilizations. We compare and contrast with related work. The paper also presents a study case, the employment of mapping functions and redistribution algorithms in a parallel file system.