Proceedings of the IEEE

Issue 4 • Apr 1991

Filter Results

Displaying Results 1 - 15 of 15
  • Scientific modeling with massively parallel SIMD computers

    Publication Year: 1991, Page(s):574 - 585
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1276 KB)

    A number of scientific models are discussed that possess a high degree of inherent parallelism. For simulation purposes this is exploited by employing a massively parallel SIMD (single instruction multiple data) computer. The authors describe one such computer, the distributed array processor (DAP), and discuss the optimal mapping of a typical problem onto the computer architecture to best exploit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel computational simulations in light scattering

    Publication Year: 1991, Page(s):567 - 573
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Described is the Connection Machine, a massively parallel SIMD (single instruction multiple data) computer of 64K processors, used to simulate optical scattering and absorption phenomena where the scattering objects are much larger than the wavelength of the incident light. One processor of the connection machine is assigned to an individual incident ray. The processor tracks the ray through the o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Teaching network connectivity using simulated annealing on a massively parallel processor

    Publication Year: 1991, Page(s):559 - 566
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A simulated annealing technique for automatically training a machine vision system to recognize and locate complex objects is described. In this method, the training is used to find an optimum connectivity pattern of a fixed number of inputs that have fixed weights, rather than the usual technique of finding the optimum weights for a fixed connectivity. The recognition model uses a two-layer artif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient high-level programming on the AMT DAP

    Publication Year: 1991, Page(s):524 - 536
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    This study is concerned with efficient use of a high-level machine-independent language in the AMT DAP (distributed array processor) series of computers. The AMT DAP is a single instruction multiple data stream computer. The recent enhancement of Fortran-Plus is described. This enhancement removed the restrictions on array shapes and sizes, giving a language which is independent of the available h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computations on the massively parallel processor at the Goddard Space Flight Center

    Publication Year: 1991, Page(s):548 - 558
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Described are four significant algorithms implemented on the massively parallel processor (MPP) at the Goddard Space Flight Center. Two are in the area of image analysis. Of the other two, one is a mathematical simulation experiment and the other deals with the efficient transfer of data between distantly separated processors in the MPP array. The first algorithm presented is the automatic determi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Associative massively parallel computers

    Publication Year: 1991, Page(s):469 - 479
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Associative processing architectures as candidates for second-generation massive parallel computers (MPCs) are discussed. The authors outline the principle of operation of associative processors, and briefly review their development. They explore the associative string processor (ASP) architecture as a representative case study in the development of a second-generation MPC View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collection-oriented languages

    Publication Year: 1991, Page(s):504 - 523
    Cited by:  Papers (20)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    The authors outline, compare, and contrast the collections and operations found in many collection-oriented languages by putting them into a common framework. In the process, many problems that can occur in specifying such languages are elucidated. These languages are ideal for use with massively parallel machines, even though many of them were developed before parallelism. Some extended examples ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping neural nets onto a massively parallel architecture: a defect-tolerance solution

    Publication Year: 1991, Page(s):444 - 460
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1608 KB)

    The problem of mapping neural nets onto massively parallel architectures is considered. The solution examined, based upon regular array structures, can support the mapping of any neural graph. In particular, the case of feed-forward multilayered nets is analyzed, and is proven that in this case the mapping suggested is easily implemented and optimizes a number of relevant figures of merit. The str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural requirements of image understanding with respect to parallel processing

    Publication Year: 1991, Page(s):537 - 547
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    An overview of the architectural requirements for parallel processing in support of real-time, knowledge-based computer vision is given. One of the goals of this work is to provide an appreciation for the diversity, complexity, and computational intensity of vision processing. It begins with a description of common vision algorithms, analyzes their requirements in terms of the inherent structures ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of shared and nonshared memory models of parallel computation

    Publication Year: 1991, Page(s):480 - 487
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Four algorithms are analyzed in the shared and nonshared (distributed) memory models of parallel computation. The analysis shows that the shared memory model predicts optimality for algorithms and programming styles that cannot be realized on any physical parallel computers. Programs based on these techniques are inferior to programs written in the nonshared memory model. The unit cost charged for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The characterization and representation of massively parallel computing structures

    Publication Year: 1991, Page(s):461 - 468
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The problem of graphical representations for massively parallel computers is addressed. Concise graphical representations that provide details of individual processing elements, describe their interconnections, and delineate the function of control signals are needed. Various types of massively parallel depictions in use are presented, as well as methods under development that utilize computationa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing techniques for massively parallel communication

    Publication Year: 1991, Page(s):488 - 503
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB)

    A survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routing methods are compared in terms of their efficiency in supporting programming models, efficiency in mapping to parallel machines, and practicality. Among the outlined methods, three nonadaptive tec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory systems for highly parallel computers

    Publication Year: 1991, Page(s):403 - 415
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    Some recent developments in computer memories are discussed, and proposals are made to enhance the memory systems of highly parallel SIMD (single instruction multiple data) computers. The topics covered include increases in density and speed; adding new logic functions to memory chips; local autonomy in addressing; a parallel indexed RAM (PIRAM); impact of memory on numerical computation in SIMD; ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of homogeneous hierarchical interconnection structures

    Publication Year: 1991, Page(s):416 - 428
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1244 KB)

    Among the various proposal advanced to build massive parallel systems in which the number of computing units ranges in the thousands, hierarchical topologies share a number of interesting properties. The authors review these architectures and their applicability and reliability, with particular attention to connections complexity and the ability to exchange messages. The usual assumption of the mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfigurable SIMD massively parallel computers

    Publication Year: 1991, Page(s):429 - 443
    Cited by:  Papers (33)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1428 KB)

    This paper is a brief introduction to a new class of computers, the reconfigurable massively parallel computer. Its most distinguishing feature is the utilization of the reconfigurability of the interconnection network to establish a network topology well mapped to the algorithm communication graph so that higher efficiency can be achieved, and to remove faulty processors from the network so that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Joel Trussell
North Carolina State University