[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation

8-10 Oct. 1990

Filter Results

Displaying Results 1 - 25 of 81
  • How to use up processors

    Publication Year: 1990, Page(s):515 - 518
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB)

    Most parallelization aims for a decomposition in which the resulting units are data independent, each of the units contributes to the final output in the data flow, and synchronization is minimized. The paradigm of `possible-worlds computing' aims to explore a model in which parallelization is achieved by disregarding the first two goals in order to preserve the third. The Tahiti programming langu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What are the two most important issues facing the design and use of massively parallel computers?

    Publication Year: 1990, Page(s):526 - 529
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB)

    A variety of views is presented by the participants in this panel discussion. Concerns are expressed regarding communication, control, software, programming, cost, performance measures, among others. The responses reflect the varied backgrounds and perspectives of the panelists.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Third Symposium on the Frontiers of Massively Parallel Computation. Proceedings. (Cat. No.90CH2908-2)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • Multiple channel architecture

    Publication Year: 1990, Page(s):315 - 323
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A parallel processing architecture based on multiple-channel optical communication is described. A large number of independent, selectable channels (or virtual buses) are available using a single optical fiber. Arbitrary interconnection patterns, as well as machine partitions, can be emulated by using appropriate channel assignments. Hierarchies of parallel architectures and simultaneous execution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data optimization: minimizing residual interprocessor data motion on SIMD machines

    Publication Year: 1990, Page(s):416 - 423
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    Basic concepts in array layout are summarized, and unhonored preferences and residual data motion are discussed. A technique for minimizing such motion is presented. For each array the source program is divided into regions, each associated with a single home. This enables efficient handling of residual data motion. The partitioning into regions is based on control flow and data dependence. Prelim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new parallel algorithm for the knapsack problem and its implementation on a hypercube

    Publication Year: 1990, Page(s):2 - 7
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A new parallel algorithm is presented for the 0/1 knapsack problem. On a hypercube of n processors, the algorithm runs in time O(mc(log n)/n), where m is the number of objects and c is the knapsack size. The best previous known hypercube algorithm takes time O(mc /n+c log n+c2<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating numerically controlled machining in parallel

    Publication Year: 1990, Page(s):80 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Several parallel algorithms for simulating numerically controlled machining are presented. Various implementations of these algorithms on the Connection Machine are discussed. These experiments provide information about the various performance tradeoffs involved in writing programs for the Connection Machine. They also show that this particular problem is well suited to parallel solutions, since t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerance and learning performance of the back-propagation algorithm using massively parallel implementation

    Publication Year: 1990, Page(s):364 - 367
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Mapping the backpropagation (BP) algorithm onto an SIMD (single-instruction-stream, multiple-data-stream) machine, such as the Massively Parallel Processor, is considered. It is shown that the size of the connectionist network underlying BP can be scaled up to large sizes, resulting in improved performance. Specifically, both fault tolerance and learning speed can be enhanced View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rearrangeability of shuffle-exchange networks

    Publication Year: 1990, Page(s):303 - 314
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    A proof for the rearrangeability of (2n-1)-stage shuffle-exchange networks with N=2n inputs is given. The proof makes use of the notion of balanced matrices for representing passable permutations through a shuffle-exchange network. Because the proof is not constructive, it does not lead to a routing algorithm directly. Therefore, a heuristic algorithm is provided for r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massive parallelism through program restructuring

    Publication Year: 1990, Page(s):407 - 415
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    A technique for mapping algorithms to massively parallel processors is described. It differs from previous work by focusing on explicit program restructuring, as opposed to manual or algebraic mapping. The method is flexible, and it allows nonlinear, as well as linear, mappings. Some restructuring transformations and how they would be used are described. A limitation of the approach is the restric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A silicon compiler for massively parallel image processing ASICs

    Publication Year: 1990, Page(s):519 - 524
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    A silicon compiler design methodology for massively parallel architecture for image processing is introduced. It starts from an algorithmic description of the application in a language comparable to the GAPP NCR language (GAL) and generates an optimized circuit organized as a 2-D array of 1-b processing elements with minimized resources. The effectiveness of the approach is shown by two examples. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical hypercube algorithms for computational geometry

    Publication Year: 1990, Page(s):75 - 78
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The use of the cross-stitching technique to solve problems in computational geometry on the hypercube is discussed. Given n inputs distributed one per processor on a hypercube with n processors. The cross-stitching paradigm runs in Θ(log2 n) time with very low constants. This form of 2-D divide-and-conquer is illustrated, some of its applications are con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indirect addressing and load balancing for faster solution to Mandelbrot set on SIMD architectures

    Publication Year: 1990, Page(s):443 - 450
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The authors present a method for using local indirect addressing to achieve faster solutions for some problems with data-dependent convergence rates on SIMD (single-instruction-stream, multiple-data-stream) architectures. A class of problems characterized by computations on data points where the computation is identical but the convergence rate is data dependent is examined. In the absence of indi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel production system extending OPS5

    Publication Year: 1990, Page(s):110 - 118
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    It is shown that by assuming a common model of SIMD (single-instruction-stream, multiple-data-stream) computing and extending the OPS5 production system formalism to take advantage of the SIMD model, an entirely new class of problems lends itself to solution through the intuitive use of a parallel production system (PPS) language. The PPS allows actions on the right-hand sides of a rule to act on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed backpropagation algorithm of neural networks on distributed-memory multiprocessors

    Publication Year: 1990, Page(s):358 - 363
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    A distributed backpropagation algorithm for a fully connected multilayered neural network on a distributed-memory multiprocessor system is presented. The neurons on each layer are partitioned into p disjoint sets, and each set is mapped on a processor of a p-processor system. The algorithm, the communication pattern among the processors, and their time/space complexities are inve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random number generators with inherent parallel properties

    Publication Year: 1990, Page(s):34 - 37
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    By incorporating the spatial variable into a one-dimensional array of numbers, it is possible to generalize the well-known linear congruential random-number generator (LCG) to the spatially coupled random-number generator (SCG) given by Xi(t+1)=f[{Xi( t)}] (mod m) where i=1, 2, . . ., n can be regarded as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On bit-serial packet routing for the mesh and the torus

    Publication Year: 1990, Page(s):294 - 302
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The bit-serial routing problem wherein each packet consists of a sequence of k flits and is thus called a snake, is considered. On the basis of the properties of the snake during the routing, a formal definition is given for three different packet routing models, namely, the store-and-forward model, the cut-through model, and the wormhole model. The wormhole model, which is most commonly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data management and control-flow constructs in a SIMD/SPMD parallel language/compiler

    Publication Year: 1990, Page(s):397 - 406
    Cited by:  Papers (3)  |  Patents (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Features of an explicitly parallel language targeted for reconfigurable massively parallel processing systems capable of operating in the SIMD (single-instruction-stream, multiple-data-stream) and SPMD (single-program, multiple-data-stream) modes of parallelism are presented (SPMD is a subset of MIMD (multiple-instruction stream, multiple-data stream)). All aspects of the language have been provid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the scalability of FFT on parallel computers

    Publication Year: 1990, Page(s):69 - 74
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The scalability of the parallel fast Fourier transform (FFT) algorithm on mesh- and hypercube-connected multicomputers is analyzed. The hypercube architecture provides linearly increasing performance for the FFT algorithm with an increasing number of processors and a moderately increasing problem size. However, there is a limit on the efficiency, which is determined by the communication bandwidth ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel optimization of stack filters

    Publication Year: 1990, Page(s):511 - 514
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    An open problem associated with designing stack filters is finding the optimum configuration for a given noise type and the signal characteristics which need to be preserved. This problem is modeled here as a combinatorial search problem. Efficient search methods that can be easily implemented on any massively parallel computer were developed and tested in two parallel computing environments. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Array processors with pipelined optical busses

    Publication Year: 1990, Page(s):333 - 342
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A synchronous multiprocessor architecture based on pipelined optical bus interconnections is presented. The processors are placed in a square grid and are interconnected to one another through horizontal and vertical optical buses. This architecture has an effective diameter as small as two owing to its orthogonal bus connections, and it allows all processors to have simultaneous access to the bus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solution to an architectural problem in parallel computing

    Publication Year: 1990, Page(s):434 - 442
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The author presents a solution to the previously unsolved problem of how to construct an array processor with N processing elements, N memory modules, and an interconnection network that allows parallel access and alignment of rows, columns, diagonals, contiguous blocks, and distributed blocks of N×N arrays. The solution leads to an array processor that is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward scalable algorithms for orthogonal shared-memory parallel computers

    Publication Year: 1990, Page(s):12 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The problem of developing scalable and near-optimal algorithms for orthogonal shared-memory multiprocessing systems with a multidimensional access (MDA) memory array is considered. An orthogonal shared-memory system consists of 2n processors and 2m memory modules accessed in any one of m possible access modes. Data stored in memory modules are available to processors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Too many cooks don't spoil the broth: light simulation on massively parallel computers

    Publication Year: 1990, Page(s):100 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A computer graphics algorithm for simulating the propagation of light and its interaction with matter on a massively parallel computer is presented. This algorithm, called the tagged shooting method, is designed for a virtual machine containing a great number of simple communicating processors arrayed into a cubical three-dimensional lattice. Only nearest neighbor communication among processors is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for efficient execution of array-based languages on SIMD computers

    Publication Year: 1990, Page(s):462 - 470
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The author presents a framework for supporting efficient execution of machine-independent, array-based, data-parallel languages, such as Fortran-90 and Parallel Pascal, on distributed-memory SIMD (single-instruction-stream, multiple-data-stream) machines with mesh or hypercube interconnection topologies. The framework supports (1) a wide class of mappings of arrays into machines, (2) the implement... View full abstract»

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