• DocumentCode
    2767110
  • Title

    A bit-parallel, word-parallel, massively parallel associative processor for scientific computing

  • Author

    Alleyne, B.D. ; Kramer, David A. ; Scherson, Isaac D.

  • Author_Institution
    Dept. of Electr. Eng., Princeton Univ., NJ, USA
  • fYear
    1990
  • fDate
    8-10 Oct 1990
  • Firstpage
    176
  • Lastpage
    185
  • Abstract
    A simple but powerful parallel architecture based on the classical associative processor model, which allows bit-parallel computation and communication, is proposed. Complex operations such as multiplication execute in O(m) cycles, as opposed to O(m 2) for bit-serial machines. This permits very fast processing of floating-point data. A bit-parallel communication network that exploits associative data location independence is presented. It provides the system with a reconfiguration capability, which improves chip yield, as well as fault tolerance. The simplicity of the architecture lends itself to VLSI implementation and hence allows the construction of a bit-parallel, word-parallel, and massively parallel (P 3) computing system
  • Keywords
    multiprocessor interconnection networks; parallel architectures; P3 computing system; VLSI; associative data location independence; bit-parallel communication network; chip yield; fault tolerance; floating-point data; massively parallel associative processor; parallel architecture; reconfiguration; scientific computing; word-parallel; Arithmetic; Associative processing; Computer architecture; Concurrent computing; Fault tolerant systems; Parallel processing; Power engineering computing; Power system modeling; Scientific computing; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
  • Conference_Location
    College Park, MD
  • Print_ISBN
    0-8186-2053-6
  • Type

    conf

  • DOI
    10.1109/FMPC.1990.89457
  • Filename
    89457