Beyond striping: the bridge multiprocessor file system

High-performance parallel computers require high-performance file systems. Exotic I/O hardware will be of little use if file system software runs on a single processor of a many-processor machine. We believe that cost-effective I/O for large multiprocessors can best be obtained by spreading both data and file system computation over a large number of processors and disks. To assess the effectiveness of this approach, we have implemented a prototype system called Bridge, and have studied its performance on several data intensive applications, among them external sorting. A detailed analysis of our sorting algorithm indicates that Bridge can profitably be used on configurations in excess of one hundred processors with disks. Empirical results on a 32-processor implementation agree with the analysis, providing us with a high degree of confidence in this prediction. Based on our experience, we argue that file systems such as Bridge will satisfy the I/O needs of a wide range of parallel architectures and applications.

[1]  Kevin Wilkinson,et al.  Sorting Large Files on a Backend Multiprocessor , 1988, IEEE Trans. Computers.

[2]  Richard E. Schantz,et al.  Programming Support in the Cronus Distributed Operating System , 1986, IEEE International Conference on Distributed Computing Systems.

[3]  Randy H. Katz,et al.  Failure correction techniques for large disk arrays , 1989, ASPLOS III.

[4]  Carla Schlatter Ellis,et al.  Bridge: a high performance file system for parallel processors , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[5]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[6]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[7]  David J. DeWitt,et al.  A taxonomy of parallel sorting , 1984, CSUR.

[8]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.