ACM Home Page
Please provide us with feedback. Feedback
Concurrent I/O system for the hypercube multiprocessor
Full text PdfPdf (814 KB)
Source Hypercube Concurrent Computers and Applications archive
Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 table of contents
Pasadena, California, United States
Pages: 1398 - 1407  
Year of Publication: 1989
ISBN:0-89791-278-0
Authors
A. Witkowski  California Institute of Technology, Jet Propulsion Laboratory, 4800 Oak Grove, Pasadena, CA
K. Chandrakumar  California Institute of Technology, Jet Propulsion Laboratory, 4800 Oak Grove, Pasadena, CA
G. Macchio  California Institute of Technology, Jet Propulsion Laboratory, 4800 Oak Grove, Pasadena, CA
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 5,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/63047.63096
What is a DOI?

ABSTRACT

This paper describes the Concurrent I/O (CIO) system for the Hypercube Multiprocessor. Our system has three components: Architecture, User Interface, and Programming Paradigm. The architecture of the system is based on clusters. Each cluster has a hypercube topology and contains either computing nodes or I/O nodes. This architecture scales well, provides a convenient naming convention and offers independent connectivity between the I/O nodes. The routing algorithm confines the I/O traffic within the I/O clusters. Clusters can be connected in a variety of ways suitable for such diverse applications as graphics and database systems. The system provides a programming paradigm where several nodes of a multiprocessor can cooperate on creating a file.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Ch. K. Baru, O. Frieder, "Database and Data Redistribution Algorithms for a Cube Connected Multi~:omputer System", Abstracts of The Third Conference Or~ Hypercube Concurrent Computers and Applications, January 1988, Pasadena, California.
4
5
6
 
7
 
8
H. Katseff, "Incomplete Hypercubes", Abstracts of the Second Conference on Hypercube Multiprocessors, September 1986, Knoxville, Tennessee.
9
10
 
11
J. Mukerji, R. Kieburtz, "A Distributed File System for a Hierarchical Multicomputer", Proceedings of the 1st Conf. on Distributed Computing Systems., 1979
12
 
13
J. Peterson, J. Tuazon, M. Pniel, D. Liberman, "The MARK 111 Hypercube Ensemble Concurrent Computer", Proceedings of the 1985 International Conference on Parallel Processing, August 1985.
 
14
D. Reed, L. Svobodova, "A Distributed Data Storage System For Local Area Network", Local Area Network for Computer Communication, North-Holland, 1981.
15
 
16
J. Salmon, "Cubix: an I/O system for the Hypercube", Caltech Concurrent Computation Project, Technical Report 293, July 1986.
17
19
20
21
22
23
24
25
 
26
B. Welch, J. Ousterhout, "Prefix Tables: A Simple Mechanism for Locating Files in a Distributed System", Operating System Review, 1986.


Collaborative Colleagues:
A. Witkowski: colleagues
K. Chandrakumar: colleagues
G. Macchio: colleagues