Research Note
Optical Interconnectivity in a Scalable Data-Parallel System

https://doi.org/10.1006/jpdc.1996.1290Get rights and content

First page preview

First page preview
Click to open first page preview

References (27)

  • P. Kermani et al.

    Virtual cut-through: A new computer communication switching technique

    Comput. Networks

    (1979)
  • W. F. McColl, 1993, Bulk synchronous parallel computing, Second Workshop on Abstract Models for Parallel Computation,...
  • High Performance Fortran Forum

    High Performance Fortran Language Specification

    (1993)
  • D. B. Barsky, 1995, Communication structures of an asynchronous massively-parallel system, University of...
  • K. Mehlhorn et al.

    Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

    Acta Informat.

    (1984)
  • M. H. Chesney, 1993, The Meiko CS-2 system architecture, Annual ACM Symposium on Parallel Algorithms and...
  • J. Y. Ngai, C. L. Seitz, 1989, A framework for adaptive routing in multicomputer networks, Proceedings of the Symposium...
  • D.A. Reed et al.

    Multicomputer Networks: Message-Based Parallel Processing

    (1987)
  • W. Dally, 1987, Wire-efficient VLSI multiprocessor communication networks, Proceedings of the Stanford Conference on...
  • W. Dally et al.

    Deadlock-free message routing in multiprocessor interconnection networks

    IEEE Trans. Comput.

    (1987)
  • S. Konstantinidou, 1990, Adaptive minimal routing in hypercubes, Proc. 6th MIT Conference on Advanced Research in VLSI,...
  • A. A. Chien, J. H. Kim, 1992, Planar-adaptive routing: Low-cost adaptive network for multiprocessors, Proc. 19th...
  • G. D. Pifarré, L. Gravano, S. A. Felperin, J. L. C. Sanz, 1991, Fully-adaptive minimal deadlock-free packet routing in...
  • Cited by (0)

    View full text