By Topic

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

19-21 Oct. 1992

Filter Results

Displaying Results 1 - 25 of 96
  • Scientific visualization theatre

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (35 KB)

    Summary form only given. Discusses the latest in massively parallel processing (MPP) applications' results through high-resolution graphics and animation. Three themes are represented, demonstrating the relationship between massively parallel computing and scientific visualization. Results of applications computed on MPPs and visualized on graphics workstations are shown for many of the cases. Exa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourth Symposium on the Frontiers of Massively Parallel Computation (Cat. No.92CH3185-6)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (9 KB)
    Freely Available from IEEE
  • Throughput analysis of pipelined multiprocessor modules

    Publication Year: 1992, Page(s):548 - 550
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    A feasible form of parallel architecture would be one which consists of several pipeline stages, each of which is a multiprocessor module of a large number of processing elements (PEs). In many applications, such as real-time image processing and dynamic control, the optimized computing structure would be in this form. In the present study, the performance of a parallel processing model of such an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative studies of processing element granularity

    Publication Year: 1992, Page(s):551 - 552
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Quantitative results of experiments on PE (processing element) granularities are presented. An architecture simulation workbench has been developed for experiments on PE granularities of 1, 4, 8, and 16-b. An analysis of the impact of various I/O (input/output) and communication path widths is also possible. Overall performance, communication balance, PE utilization, and operand lengths can be mon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single source shortest path problem on processor arrays

    Publication Year: 1992, Page(s):553 - 556
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Algorithms for computing the shortest paths to every vertex from a single source vertex in nonnegatively weighted graphs are examined. A conventional data parallel algorithm and a replicated data algorithm for the single-source shortest path problem are presented. Both algorithms have been implemented on a Connection Machine CM-2 and a MasPar MP-1. Analytical and experimental speedups using the da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The virtual-time data-parallel machine

    Publication Year: 1992, Page(s):46 - 53
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The authors propose the virtual-time data-parallel machine to execute SIMD (single instruction multiple data) programs asynchronously. They first illustrate how asynchronous execution is more efficient than synchronous execution. For a simple model, they show that asynchronous execution outperforms synchronous execution roughly by a factor of (ln N), where N is the number of proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel holographic image calculation and compression

    Publication Year: 1992, Page(s):557 - 559
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The authors describe the parallel implementation of an algorithm suitable for hologram creation on a 16384 processor SIMD (single-instruction multiple-data) MasPar machine. When computing an image of typical complexity, the parallel implementation sacrifices up to 11% efficiency in data compression to gain a performance up to 250 times greater than that achieved on a uniprocessor workstation. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding multilevel structures into massively parallel hypercubes-connection machine results for computer vision algorithms

    Publication Year: 1992, Page(s):586 - 589
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Investigates the problem of embedding multilevel structures into hypercubes. The widely used pyramid belongs to the class of multilevel structures. Although several algorithms have been proposed for embedding pyramids into hypercubes, there do not exist algorithms for embedding general multilevel structures. For the special case of the pyramid, this research carries out a comparative analysis that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular lattices

    Publication Year: 1992, Page(s):54 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    The authors present parallel solutions to the AMESCS (all maximal equally-spaced collinear subset) and AMRSS (all maximal regularly-spaced subset) problems and show how their solutions to the latter generalize to the AMRSDLS (all maximal regularly-spaced D-dimensional lattice subsets) problem. Their algorithms differ significantly from the optimal sequential algorithms presented in A.B. Kahng and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction of message passing SIMD multiprocessor systems

    Publication Year: 1992, Page(s):560 - 561
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    The paper focuses on two points: (1) the prediction of the execution signature of massively parallel applications prior to execution/implementation based on a more informative characterization of the workload, and (2) the definition of a more general form of speedup and efficiency. The systems considered are of SIMD message passing paradigm View full abstract»

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

    Publication Year: 1992, Page(s):216 - 223
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    The authors compare two methods which compute an approximation to the Hausdorff distance between pairs of binary images. They also implement a parallel vision of one of the methods, which can provide a fast image distance algorithm to calibrate algorithms performing such tasks as image recognition, image compression, or image browsing. For this purpose, they have shown a simple application of sele... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for locating a core of a tree network with a specified length

    Publication Year: 1992, Page(s):59 - 66
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    The authors present efficient algorithms for finding a core of tree with a specified length for both sequential and parallel computational models. The algorithms can be readily extended to a tree network in which arcs have nonnegative integer lengths. The authors also present a parallel version of the algorithm on an EREW PRAM (parallel random access machine) model. The results presented might pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The MetaMP approach to parallel programming

    Publication Year: 1992, Page(s):562 - 565
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    The authors are researching techniques for the programming of large-scale parallel machines for scientific computation. They use an intermediate-level language, MetaMP, that sits between High Performance Fortran (HPF) and low-level message passing. They are developing an efficient set of primitives in the intermediate language and are investigating compilation methods that can semi-automatically r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation routing in 2-stage recirculating delta networks

    Publication Year: 1992, Page(s):502 - 503
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hyper-pyramid network topology for image processing

    Publication Year: 1992, Page(s):224 - 229
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The authors describe a novel network topology for image processing, called the hyper-pyramid network topology. This structure is hierarchical and implements local, inside-region communications at each level, and upward/downward communications in the whole structure. Intraregion communications are shown by an image processing algorithm study. The authors display the implementation of a component la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling Fortran 77D and 90D for MIMD distributed-memory machines

    Publication Year: 1992, Page(s):4 - 11
    Cited by:  Papers (13)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The authors present an integrated approach to compiling Fortran 77D and Fortran 90D programs for efficient execution on MIMD (multiple-instruction multiple-data) distributed-memory machines. the integrated Fortran D compiler relies on two key observations. First, array constructs may be scalarized into FORALL loops without loss of information. Second, loop fusion, partitioning, and sectioning opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards efficient parallelizations of a computer algebra algorithm

    Publication Year: 1992, Page(s):67 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors summarize the results of a preliminary study that examines the feasibility of implementing computer algebra systems on massively parallel single-instruction multiple-data architectures. On serial computers, these systems rely on B.Buchberger's (1970, 1985) algorithm for computing Grobner bases. A parallelization of this algorithm that addresses the potential growth in the number of pol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance studies of packet switched augmented shuffle exchange networks

    Publication Year: 1992, Page(s):566 - 568
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Extends previous research efforts related to the performance modeling of the fault-tolerant Augmented Shuffle Exchange Network (ASEN). The authors examine the ASEN run-time performance characteristics in a packet switched environment. The network performance is examined under a fault-free but congested network operating environment. Network performance parameters of time-in-system, queue lengths a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel simulation of a class of discrete event systems

    Publication Year: 1992, Page(s):412 - 419
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The authors describe a novel approach for the simulation of discrete-event systems on massively parallel computers. In spite of considerable partial parallelism that exists in discrete-event systems, the simulation of a single discrete-event system is intrinsically asynchronous and highly data dependent, and its implementation on massively parallel SIMD (single-instruction multiple-data) computers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of hot spot on the performance of multistage interconnection networks

    Publication Year: 1992, Page(s):504 - 505
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Hot spots in multistage interconnection networks (MSINs) results in performance degradation of the network. The authors develop an analytical model for the performance evaluation of unbuffered MSINs under a single hot spot, followed by a performance comparison with buffered MSINs. For uniform traffic, a buffered network performs better than an unbuffered network. For a nonuniform traffic pattern c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-parallel visualisation using multi-dimensional transformations

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

    The authors show how a flexible resampling approach can be embedded within massively parallel implementations of multidimensional transformation algorithms based on one-dimensional resampling operations. They provide a consistent solution to the resampling requirements across visualization applications. Based on this framework, two applications are outlined: a surface perspective viewing algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compiler for a massively parallel distributed memory MIMD computer

    Publication Year: 1992, Page(s):12 - 20
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The author describes the techniques that are used by the CM Compiler Engine to map the fine-grained array parallelism of languages such as Fortan 90 and C onto the Connection Machine (CM) architectures. The same compiler is used for node-level programming of the CM-5, for global programming of the CM-5, and for global programming of the SIMD (single-instruction multiple-data) CM-2. A new compiler ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable multicast service for mesh networks

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

    The authors investigate the scalability of a multicast algorithm designed for wormhole-routed mesh networks. The algorithm, known as the U-mesh algorithm, is shown to scale well in four ways: with the dimension of the mesh, with the number of destinations, with the system size, and with the problem size. It is demonstrated that the only factor that affects the multicast latency is the number of de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPPs, Amdahl's law, and comparing computers

    Publication Year: 1992, Page(s):465 - 470
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The author examines Amdahl's law in the context of parallel processing and provides some arguments as to what the applicability of this law really is. Amdahl's law establishes an upper bound on the available parallelism given the fraction of sequential code present in an application. In this paper, Amdahl's law is revisited to derive a formulation which allows one to carry out some quantitative an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A CPU utilization limit for massively parallel MIMD computers

    Publication Year: 1992, Page(s):83 - 92
    Cited by:  Papers (7)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Massively parallel computer systems based on off-the-shelf CPU chip-sets have become commercially available. The authors demonstrate a theoretical limit on the silicon (or other circuitry media) utilization of such architectures as the number of processors is scaled up. In addition, case studies of the Thinking Machines Corporation CM-5 and of the Intel Touchstone are presented in order to quantif... View full abstract»

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