Performance analysis of a synchronous, circuit-switched interconnection cached network

Proceedings of the International Conference on Supercomputing

Volumn Part F129421, Issue , 1994, Pages 246-255

  Gupta, Vipul ^a   Schenfeld, Eugen ^b  

^a RUTGERS UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SWITCHING; TELECOMMUNICATION TRAFFIC; TIMING CIRCUITS;

CIRCUIT-SWITCHED NETWORKS; COMMUNICATION PATTERN; DISTRIBUTED COMMUNICATIONS; GRACEFUL DEGRADATION; PARALLEL APPLICATION; PERFORMANCE ANALYSIS; RECONFIGURABLE NETWORK; SWITCHING COMPONENTS;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 85010112016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181181.181540     Document Type: Conference Paper

References (27)

1. Grand Challenges: High Performance Computing and Communications. Committee on Physical, Mathematical, and Engineering Sciences, National Science Foundation, 1991.
2. B. W. Arden and K. W. Tang. Representation and Routing of Cayley Graphs. IEEE Transactions on Communications, 39(11):1533-1537, Nov 1991.
3. A. Barak and E. Schenfeld. Embedding classical communication topologies in the OPAM architecture. Technical Report TR 90-12, Department of Computer Sci-ence, The Hebrew University of Jerusalem, Jerusalem, Israel, Aug 1990.
4. K. E. Batcher. Design of a massively parallel processor. IEEE Transactions on Computers, C-29(9):836-840, Sep 1980.
5. J. Beetem, M. Denneau, and D. Weingarten. The GF11 Supercomputer. In Proceedings of the 12th International Symposium on Computer Architecture, pages 108-115, Jun 1985.
6. F. Berman and L. Snyder. On Mapping Parallel Algorithms into Parallel Architectures. Journal of Parallel and Distributed Computing, 4:439-458, 1987.
7. D. M. Dias and J. R. Jump. Analysis and Simulation of Buffered Delta Networks. IEEE Transactions on Computers, C-30(4):273-282, Apr 1981.
8. V. Gupta and E. Schenfeld. A Heuristic Approach for Embedding Communication Patterns in an Interconnection Cached Parallel Processing Network. In Proceedings of the 7th International Parallel Processing Symposium, pages 291-297, Apr 1993.
9. V. Gupta and E. Schenfeld. A Comparative Performance Study of an Interconnection Cached Network. In International Conference on Parallel Processing, Aug 1994, (to appear).
10. V. Gupta and E. Schenfeld. NetSim - A Tool for Modeling the Performance of Circuit Switched Multicomputer Networks. In 7th International Conference on Modeling Techniques and Tools for Computer Performance Evaluation, May 1994.
11. J.-M. Hsu and P. Banerjee. Performance Measurement and Trace Driven Simulation of Parallel CAD and Numeric Applications on a Hypercube Multicomputer. In Proceedings 17th International Symposium on Computer Architecture, pages 260-269, May 1990.
12. L. H. Jamieson. The Chracteristics of Parallel Algorithms, chapter Characterizing Parallel Algorithms, pages 65-100. MIT Press, 1987.
13. C. P. Kruskal and M. Snir. The Performace of Multistage Interconnection Networks for Multiprocessors. IEEE Transactions on Computers, C-32(12):1091-1098, Dec 1983.
14. H. T. Kung. The Structure of Parallel Algorithms. Advances in Computers, 19:65-112, 1980.
15. H. Li and M. Maresca. Polymorphic-Torus Network. IEEE Transactions on Computers, 38(9):1345-1351, Sep 1989.
16. W. Lin and C.-L. Wu. Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor. IEEE Transactions on Computers, C-35(10):910-916, Oct 1986.
17. J. C. Mogul. Network locality at the scale of processes. ACM Transactions on Computer Systems, 10(2):81-109, May 1992.
18. J. H. Patel. Performance of Processor-Memory Interon-nections for Multiprocessors. IEEE Transactions on Computers, C-30(10):771-780, Oct 1981.
19. B. Ramamurthy and M. S. Krishnamoorthy. Bounded p-contractability is NP-complete. Technical Report 9217, Department of Computer Science, Rennselaer Polytechnic Institute, Troy, New York, Jun 1992.
20. A. A. Sawchuck, B. K. Jenkins, C. S. Raghavendra, and A. Varma. Optical crossbar networks. Computer, 20(6):50-60, Jun 1987.
21. E. Schenfeld. The Optical Parallel Architecture Model (OPAM) experiment-project plan and motivations. Tech. Rep. TR 88-17, Dept. of Computer Science, He-brew University of Jerusalem, Israel, Aug 1988.
22. H. J. Siegel. The Theory Underlying the Partitioning of Permutation Networks. IEEE Transactions on Computers, C-29(9):791-800, Sep 1980.
23. L. Snyder. Introduction to the Configurable, Highly Parallel Computer. Computer, 15:47-56, Jan 1982.
24. L. Snyder. Languages, Compilers and Run-time Environments for Distributed Memory Machines, chapter Applications of the " Phase Abstractions" for Portable and Scalable Parallel Programming, pages 79-102. Elsevier, 1992.
25. K. W. Tang and B. W. Arden. Representation of Borel Cayley Graphs. In Proceedings of the 4th Symposium on the Frontiers of Massively Parallel Computation, pages 194-201, Oct 1992.
26. C.-L. Wu and M. Lee. Performance Analysis of Multistage Interconnection Network Configurations and Operations. IEEE Transactions on Computers, 41(1):18-27, Jan 1992.
27. D. W. L. Yen, J. H. Patel, and E. S. Davidson. Memory Interference in Synchronous Multiprocessor Systems. IEEE Transactions on Computers, C-31(11):1116-1121, Nov. 1982.