[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
  • Superscalar SIMD architecture

    Publication Year: 1992, Page(s):573 - 576
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Presents a parallel computer architecture which synthesizes the notions of instruction level parallelism and data parallelism. Extending the work of Siegel and others on reconfigurable SIMD/MIMD architecture, it attains most of the advantages of those machines, via selective execution of a superscalar instruction stream, while retaining most of the cost advantage of the SIMD architectural style. F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A routing algorithm for PEC networks

    Publication Year: 1992, Page(s):170 - 177
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A routing algorithm is shown which can route in O(√log N×2√2logN) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N×2√2logN) parallel steps View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding the hypercube into the 3-dimension mesh

    Publication Year: 1992, Page(s):577 - 578
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    A constant time and space algorithm for embedding the hypercube architecture into the 3-dimension mesh (3D-mesh) is presented. This enables the cubei operation to be performed on the embedded hypercube machine where the interprocessor communication function cube i is defined on the embedded hypercube's PEs as cubei (bn-1···<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving massively data parallel system performance with heterogeneity

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

    The authors introduce a new type of combined SIMD/MIMD (single-instruction multiple-data/multiple-instruction multiple-data) architecture called a hybrid system. The hybrid system consists of two components. The first component is massively parallel and consists of a large number of slow processors that are organized in an SIMD architecture. The second component consists of only a few fast process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic data distribution for nearest neighbor networks

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

    An algorithm for mapping an arbitrary, multidimensional array onto an arbitrarily shaped multidimensional nearest-neighbor network of a distributed memory machine is presented. The individual dimensions of the array are labeled with high-level usage descriptors that either can be provided by the programmer or can be derived by sophisticated static compiler analysis. The presented algorithm achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information hiding in parallel programs: model and experimental evaluation on the Connection Machine

    Publication Year: 1992, Page(s):326 - 333
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    An approach for incorporating information hiding within parallel software components is developed. The loss of performance is overcome by having intracomponent encapsulation layers, massive state transition operations, multiple-entry data structures, and program transformation. The approach was experimentally evaluated for three types of objects and application programs on a Connection Machine (CM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An overview of the nCUBE 3 supercomputer

    Publication Year: 1992, Page(s):458 - 464
    Cited by:  Papers (16)  |  Patents (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    nCUBE is developing a new family of massively parallel products-the nCUBE 3 systems. These next-generation supercomputers will be the industry's first implementable multi-TeraFLOPS platforms and will be 100% compatible with previous-generation nCUBE systems. The nCUBE 3 family will carry nCUBE's philosophy of high integration and scalability to new, industry-leading levels, offering systems that s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Radiation-magnetohydrodynamics of plasmas on parallel supercomputers

    Publication Year: 1992, Page(s):579 - 582
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Presents a parallel computational model to simulate plasmas in the radiation-magnetohydrodynamics (R-MHD) framework. The solution of the radiation field usually dominates the R-MHD computation. The authors solve the linear Boltzmann equation for the radiation field intensity, using the deterministic SN discrete ordinates method. Choosing an energy-domain decomposition the authors have i... 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.
  • Off-line permutation scheduling on circuit-switched fixed routing networks

    Publication Year: 1992, Page(s):389 - 396
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The problem of offline permutation scheduling on linear arrays, rings, hypercubes, and two-dimensional arrays, assuming the CSFR (circuit-switched fixed routing) model, is examined. Optimal permutation scheduling involves finding a minimum number of subsets of nonconflicting source-destination paths. Every subset of paths can be established to run in one pass. Optimal permutation scheduling on lin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmarking the CM-5 multicomputer

    Publication Year: 1992, Page(s):100 - 107
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The authors study the performance of the CM-5 multiprocessor. They provide a number of benchmarks for its communication and computation performance. Many of the operations, like scans and global reduction, can be performed using special hardware available on the CM-5. These operations have been benchmarked. The authors also describe how to embed a mesh and a hypercube on a CM-5 architecture and pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel computers: why not parallel computers for the masses?

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

    The developments in high-performance computers towards achieving the goal of a teraflops supercomputer that would operate at a peak speed of 1012 floating-point operations per second are reviewed. The net result of the quest for parallelism as chronicled by the Gordon Bell Prize is that applications evolved 115% per year and will most likely achieve 1 teraflop in 1995. The physical char... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network design and performance for a massively parallel SIMD system

    Publication Year: 1992, Page(s):186 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    It is shown that a nearest neighbor communication network can be complimented with a log-diameter multistage network to handle different communications patterns. This is especially useful when the pattern of data movement is not uniform. The designed network is evaluated for two cases: a dense case with many processing elements communicating and a sparse case. For 32-b data, the algorithm for comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation and performance estimation for the Rewrite Rule Machine

    Publication Year: 1992, Page(s):336 - 344
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    The authors give an overview of the Rewrite Rule Machine's (RRM's) architecture and discuss performance estimates based on very detailed register-level simulations at the chip level, together with more abstract simulations and modeling for higher levels. For a 10000 ensemble RRM, the present estimates are as follows. (1) The raw peak performance is 576 trillion operations per second. (2) For gener... 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 large scale comparison of option pricing models with historical market data

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

    A set of stock option pricing models is implemented on the Connection Machine-2 and the DECmpp-12000 to compare model prices and historical market data. Improved models which incorporate stochastic volatility with American call generally have smaller pricing errors than simpler models which are based on constant volatility and European call. In a refinement of the comparison between model and mark... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture independent analysis of sorting and list ranking on the hierarchical PRAM model

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

    The authors consider the performance of sorting and list ranking on the hierarchical parallel random access machine (H-PRAM), a model of computation which represents general degrees of locality (neighborhoods of activity), considering communication and synchronization simultaneously. The sorting result gives a significant improvement over that for the LPRAM (local-memory PRAM, i.e. unit-size neigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal implementation of parallel divide-and-conquer algorithms on de Bruijn networks

    Publication Year: 1992, Page(s):583 - 585
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Studies the problem of optimal implementation of parallel divide-and-conquer algorithms on binary de Bruijn networks. A divide-and-conquer algorithm is modeled as a temporal complete binary tree computation structure. An important contraction property between two successive binary de Bruijn networks is revealed. A twice-size complete binary tree is mapped to a de Bruijn network. Two nodes in the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The LINPACK benchmark on the Fujitsu FAP 1000

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

    The author describes an implementation of the LINPACK benchmark on the Fujitsu AP 1000. Design considerations include communication primitives, data distribution, use of blocking to reduce memory references, and effective use of the cache. The LINPACK benchmark results show that the AP 1000 is a good machine for numerical linear algebra, and that one can consistently achieve close to 80 percent of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing the scaling behavior of parallel algorithm-machine combinations

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

    The scaling of algorithms and machines is essential to achieve the goals of high-performance computing. Thus, scalability has become an important aspect of parallel algorithm and machine design. It is a desirable property that has been used to describe the demand for proportionate changes in performance with adjustments in system size. It should provide guidance toward an optimal choice of an arch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Petri net modeling and analysis of centralized timeout and batching arbitration units

    Publication Year: 1992, Page(s):369 - 376
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    The authors consider two novel arbitration techniques, timeout and batching arbitration, and establish the validity of their operations by using generalized and deterministic Petri net models. After a brief review of Petri net theory and the fundamentals of generalized and deterministic models, Petri net models for the timeout and batching arbitration schemes are presented, followed by a discussio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel software package for solving linear systems

    Publication Year: 1992, Page(s):397 - 401
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    A problem arising in scientific computation is the solution of Ax=b, where A is a large, sparse matrix. One of the most robust algorithms for solving the above equation is the conjugate gradient method, especially when combined with a preconditioner. The authors discuss a new software package, MP-PCGPAK2, that implements a parallel version of the conjugate gradient metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication overhead on the CM5: an experimental performance evaluation

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

    The authors present experimental results for communication overhead on the scalable parallel machine CM-5. It is observed that the communication latency of the data network is 88 μs. It was also observed that the communication cost for messages that are a multiple of 16 bytes is much smaller than for messages that are not, and therefore, for better performance, a user should pad messages to mak... View full abstract»

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