More Web Proxy on the site http://driver.im/

research-article

Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors

Authors:

A. L. N. Reddy,

P. BanerjeeAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 1, Issue 2

Pages 140 - 151

https://doi.org/10.1109/71.80142

Published: 01 April 1990 Publication History

Abstract

Several issues concerning the design of an I/O (input/output) system for a multiprocessor such as a hypercube are examined. A methodology is proposed for connecting the I/O processors to such a system for efficient I/O access. The effect of I/O communication onthe multiprocessor network is analyzed. Different disk organizations that can be employed within such a system are evaluated to see which organization has a better performance. It is observed that parallelism in serving an I/O request plays a dominant role in the scientific workload. The problem of mapping specific data structures such as matrices onto the disks so that the data can be accessed efficiently is considered.

References

[1]

{1} J. P. Hayes et al., "Architecture of a hypercube supercomputer," Proc. ICPP, pp. 653-660, 1986.

[2]

{2} "Intel IPSC system product summary," Intel, OR.

[3]

{3} J. Tuazon, J. Peterson, M. Pniel, and D. Liberman, "Caltech/JPL mark II hypercube concurrent processor," Proc. ICPP, pp. 666-673, 1985.

[4]

{4} G. C. Fox and S. W. Otto, "Algorithms for concurrent processors," Phys. Today, pp. 13-20, May 1984.

[5]

{5} H. T. Kung, "Memory requirements for balanced computer architectures," in Proc. 13th Annu. Int. Symp. Comput. Architecture, 1986, pp. 49-54.

Digital Library

[6]

{6} S. Cannon, "Concurrent file system-Making highly parallel mass storage transparent," in Proc. Supercomputing '89, St. Petersberg, FL, Apr.-May 1989.

[7]

{7} M. Livny, S. Khoshafian, and H. Boral, "Multi-disk management algorithms," in Proc. ACM SIGMETRICS, May 1987, pp. 69-77.

[8]

{8} M. Y. Kim, "Synchronized disk interleaving," IEEE Trans. Comput. , vol. C-35, pp. 978-988, Nov. 1986.

[9]

{9} Kai Hwang and J. Ghosh, "Hypernet: A communication-efficient architecture for constructing massively parallel computers," IEEE Trans. Comput., vol. C-36, pp. 1450-1466, Dec. 1987.

[10]

{10} W. W. Peterson and E. J. Weldon, Error-Correcting Codes. Cambridge, MA: M.I.T. Press, 1984.

[11]

{11} A. L. Narasimha Reddy, P. Banerjee, and S. G. Abraham, "I/O embedding in hypercubes," in Proc. Int. Conf. Parallel Process., 1988.

[12]

{12} M. Livingston and Q. F. Stout, "Distributing resources in hypercube computers, " in Proc. 3rd Conf. Hypercube Concurrent Comp. Apps., Jan. 1988.

[13]

{13} H. Sullivan and T. R. Bashkow, "A large scale homogeneous machine," in Proc. 4th Annu. Symp. Comput. Architecture, 1977, pp. 105-114.

[14]

{14} J. H. Patel, "Analysis of multiprocessors with private cache memories," IEEE Trans. Comput., vol. C-31, pp. 296-304, Apr. 1982.

[15]

{15} C. P. Kruskal and M. Snir, "The performance of multistage interconnection networks for multiprocessors," IEEE Trans. Comput., vol. C-32, pp. 1091-1098, Dec. 1983.

[16]

{16} D. M. Dias and R. Jump, "Analysis and simulation of buffered delta networks," IEEE Trans. Comput., vol. C-30, pp. 273-282, Apr. 1981.

[17]

{17} S. Abraham and K. Padmanabhan, "Performance of the direct binary n-cube network for multiprocessors," IEEE Trans. Comput., vol. 38, pp. 1000-1011, July 1989.

Digital Library

[18]

{18} G. F. Pfister and V. A. Norton, "Hot spot contention and combining in multistage interconnection networks," IEEE Trans. Comput., vol. C-34, pp. 943-948, Oct. 1985.

[19]

{19} A. L. N. Reddy and P. Banerjee, "An evaluation of multiple-disk I/O systems," IEEE Trans. Comput., vol. 38, pp. 1680-1690, Dec. 1989.

Digital Library

[20]

{20} RA81 Disk Drive User Guide. Digital Equipment Corp., 1982.

[21]

{21} S. Sivaramakrishnan, "Evaluation of logical external memory architectures for multiprocessor systems," Tech. Rep. TR-88-32, Dep. Comp. Sci., Univ. Texas, Austin, Sept. 1988.

[22]

{22} A. C. McKellar and E. G. Coffman, "Organizing matrices and matrix operations for paged memory systems," Commun. ACM, vol. 12, no. 3, pp. 153-165, Mar. 1969.

Digital Library

[23]

{23} K. Gallivan, W. Jalby, U. Meier, and A. Sameh, "The impact of hierarchical memory systems on linear algebra algorithm design," CSRD Rep. No. 625, Sept. 1987.

Cited By

Imani NSarbazi-Azad HAkl S(2007)Resource placement in networks using chromatic sets of power graphsProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391928(158-167)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391928
AlBdaiwi BBose B(2005)Quasi-perfect resource placements for two-dimensional toroidal networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.02.00565:7(815-831)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1016/j.jpdc.2005.02.005
Albdaiwi BLivingston M(2004)Perfect Distance-d Placements in 2D Toroidal NetworksThe Journal of Supercomputing10.1023/B:SUPE.0000022572.95414.2729:1(45-57)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1023/B%3ASUPE.0000022572.95414.27
Show More Cited By

Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
1. General and reference
  1. Cross-computing tools and techniques

Recommendations

The Banyan-Hypercube Networks

The authors introduce a family of networks that are a synthesis of banyans and hypercubes and are called the banyan-hypercubes (BH). They combine the advantageous features of banyans and hypercubes and thus have better communication capabilities.The ...
Performance Analysis of Multilevel Bus Networks for Hierarchical Multiprocessors

A multiple bus system provides more bandwidth and a high degree of fault tolerance than a single bus system. But such a system becomes very expensive for a large number of processors and memory modules, due to the requirement of too many connections (...
Optical interconnect design for a manufacturable multicomputer
MPPOI '95: Proceedings of the Second Workshop on Massively Parallel Processing Using Optical Interconnections

In spite of the clear bandwidth advantages of optical technologies, current commercial multicomputers are still designed exclusively using electronic interconnects. This is due, in part, to the manufacturing complexity of existing optical interconnects, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 1, Issue 2

April 1990

129 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © Copyright © 1990 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 April 1990

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Imani NSarbazi-Azad HAkl S(2007)Resource placement in networks using chromatic sets of power graphsProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391928(158-167)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391928
AlBdaiwi BBose B(2005)Quasi-perfect resource placements for two-dimensional toroidal networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.02.00565:7(815-831)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1016/j.jpdc.2005.02.005
Albdaiwi BLivingston M(2004)Perfect Distance-d Placements in 2D Toroidal NetworksThe Journal of Supercomputing10.1023/B:SUPE.0000022572.95414.2729:1(45-57)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1023/B%3ASUPE.0000022572.95414.27
Al Bdaiwi BBose B(2003)On resource placements in 3D toriJournal of Parallel and Distributed Computing10.1016/S0743-7315(03)00122-963:9(838-845)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1016/S0743-7315%2803%2900122-9
Varman PVerma R(1999)Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.81994810:12(1262-1275)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1109/71.819948
Almohammad BBose BKim J(1997)I/O Placement Strategies and their Data Locality Sensitivities in kxk Toroidal NetworksProceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '9710.5555/523549.822902Online publication date: 28-Apr-1997
https://dl.acm.org/doi/10.5555/523549.822902
Mourad AFuchs WSaab D(1996)Site Partitioning for Redundant Arrays of Distributed DisksJournal of Parallel and Distributed Computing10.1006/jpdc.1996.001933:1(1-11)Online publication date: 25-Feb-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0019
Baylor SBenveniste CHsu YValero M(1995)Performance evaluation of a parallel I/O architectureProceedings of the 9th international conference on Supercomputing10.1145/224538.224645(404-413)Online publication date: 3-Jul-1995
https://dl.acm.org/doi/10.1145/224538.224645
Baylor SBenveniste CHsu Y(1994)Performance evaluation of a massively parallel I/O subsystemACM SIGARCH Computer Architecture News10.1145/190787.19078822:4(5-10)Online publication date: 1-Sep-1994
https://dl.acm.org/doi/10.1145/190787.190788
Kaushal RBedi J(1992)Comparison of hypercube, hypernet, and symmetric hypernet architecturesACM SIGARCH Computer Architecture News10.1145/141408.14141220:5(13-25)Online publication date: 1-Dec-1992
https://dl.acm.org/doi/10.1145/141408.141412
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents