ACM Home Page
Please provide us with feedback. Feedback
An analytic model of multistage interconnection networks
Full text PdfPdf (1.09 MB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems table of contents
Univ. of Colorado, Boulder, Colorado, United States
Pages: 192 - 202  
Year of Publication: 1990
ISBN:0-89791-359-0
Also published in ...
Authors
Darryl L. Willick  Department of Computational Science, University of Saskatchewan
D. L. Eager  Department of Computational Science, University of Saskatchewan
Sponsor
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 11
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/98457.98758
What is a DOI?

ABSTRACT

Multiprocessors require an interconnection network to connect processors with memory modules. The performance of the interconnection network can have a large effect upon overall system performance, and, therefore, methods are needed to model and compare alternative network architectures. This paper is concerned with evaluating the performance of multistage interconnection networks consisting of k × s switching elements. Examples of such networks include omega, binary n-cube and baseline networks. We consider clocked, packet switched networks with buffers at switch output ports. An analytical model based on approximate Mean Value Analysis is developed, then validated through simulations.


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
V. E. Benes, "Mathematical Theory of Connecting Networks and Telephone Traffic," Academic Press, New York, 1965.
 
2
D.M. Dias and J. R. Jump, "Analysis and Simulation of Buffered Delta Networks," IEEE Trans. Comput., Vol. C-30, pp. 273-282, Apr. 1981.
 
3
D. M. Dias and J. R. Jump, "Packet Switching Interconnection Networks for Modular Systems," Computer, Vol. 14, pp. 43-53, Dec. 1981.
 
4
T. Y. Feng, "A Survey of Interconnection Networks," Computer, Vol. 14, pp. 12-27, Dec. 1981.
 
5
D. Gajski, D. Kuck, D. Lawrie and A. Sameh, "Cedar - A Large Scale Mulfiprocessor," Proc. 1983 Int'l Conf. Parallel Processing, pp. 524-529, 1983.
6
 
7
A. Gotflieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph and M. Snir, "/'he NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer," IEEE Trans. Comput., Vol. C-32, pp. 175-189, Feb. 1983.
8
 
9
C. P. Kruskal and M. Snir, "l'he Performance of Multistage Interconnection Networks for Multiprocessors," IEEE Trans. Comput., Vol. C-32, pp. 1091-1098, Dec. 1983.
 
10
 
11
D.H. Lawrie, "Access and Alignment of Data in an Array Processor," IEEE Trans. Compuc, Vol, C-24, pp. 1145- 1155, Dec. 1975.
 
12
 
13
Y. Liu and S. Dickey, "Simulation and Analysis of Different Switch Architectures for Interconnection Networks in MIMD Shared Memory Machines," Ultracomputer Note #141, June 1988.
 
14
J. A. Patel, "Performance of Processor-Memory Interconnections for Mulfiprocessors," IEEE "{',am. Comput., Vol. C-30, pp. 771-780, Dec. 1981.
 
15
G.F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. KleirLfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton and j. Weiss, "The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture," Proc. 1985 lnt'l Conf. Parallel Processing, pp. 764-771, 1985.
 
16
G.F. Pfister and V. A. Norton, "'Hot Spot' Contention and Combining in Multistage Interconnection Networks," Proc. 1985 Int'l Conf. Parallel Processing, pp. 790-797, 1985.
17

CITED BY  11

Collaborative Colleagues:
Darryl L. Willick: colleagues
D. L. Eager: colleagues