A distributed hypercube file system

Authors:
R. J. Flynn;H. Hadimioglu
Affiliations:
Electrical Engineering and Computer Science Department, Polytechnic University, 333 Jay Street, Brooklyn, New York;Electrical Engineering and Computer Science Department, Polytechnic University, 333 Jay Street, Brooklyn, New York
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 7
Cited 1

The cosmic cube

Communications of the ACM - Special section on computer architecture
Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1

SIGARCH Third Conference on Hypercube Concurrent Computers and Applications
The iPSC/2 direct-connect communications technology

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The second generation FPS T series: an enhanced parallel vector supercomputer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Concurrent I/O system for the hypercube multiprocessor

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
The extension of object-oriented languages to a homogeneous, concurrent architecture

The extension of object-oriented languages to a homogeneous, concurrent architecture

Prefetching in File Systems for MIMD Multiprocessors

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the hypercube, an autonomous physically interconnected file system is proposed. The resulting distributed file system consists of an I/O organization and a software interface. The system is loosely-coupled architecturally but from operating systems point of view a tightly-coupled system is formed in which interprocessor messages are handled differently from file accesses. A matrix multiplication algorithm is given to show how the distributed file system is utilized.