Conference
Distributed Memory Computing Conference
About: Distributed Memory Computing Conference is an academic conference. The conference publishes majorly in the area(s): Concurrent computing & Hypercube. Over the lifetime, 309 publications have been published by the conference receiving 2585 citations.
Papers
[...]
TL;DR: By rearranging some of the connections in the hypercube, the Mobius cubes are obtained which have smaller distances (as measured in communication links) between processors.
Abstract: The Mobius cubes are hypercube variants that give better performance with the same number of links and processors. We show that the diameter of the Mobius cubes is about one half the diameter of the equivalent hypercube, and that the average number of steps between processors for a Mobius cube is about two-thirds of the average for a hypercube. We give an efficient routing algorithm for the Mobius cubes. This routing algorithm finds a shortest path and operates in time proportional to the dimension of the cube. We also give efficient broadcast algorithms for the Mobius cubes. We show that the Mobius cubes contain ring networks and other networks. We report results of simulation studies on the dynamic message-passing performance of the hypercube, the Twisted Cube of P.A.J. Hilbers et al. (1987), and the Mobius cubes. Our results are in agreement with S. Abraham (1990), showing that the Twisted Cube has worse dynamic performance than the hypercube, but our results show that the 1-Mobius cube has dynamic performance superior to that of the hypercube. This contradicts current literature, which implies that twisted cube variants will have worse dynamic performance. >
106 citations
28 Apr 1991
TL;DR: DELTA is the third of four major Touchstone Program prototype systems and provides aggregate peak performance in excess of 30 GFLOP’s, and contains a new ,interconnect network based on a Caltech-designed router device.
Abstract: In Sep tember , 1990, the Intel C o r p o r a t i o n demonstrated the third of four major Touchstone Program prototype systems. Denoted DELTA, the prototype scales to over 500 nodes, provides aggregate peak performance in excess of 30 GFLOP’s, and contains a new ,interconnect network based on a Caltech-designed router device. DELTA contains four heterogeneous node types f o r numeric, service, inputloutput, and network fmctions. The operating system supports message-passing paradigms and intefaces with a Concurrent File System. Users access DELTA across a local area network and may select either the C or FORTRAN programmin,g languages. An interactive parallel debugger assists in application development and performance tuning.
87 citations
8 Apr 1990
TL;DR: An interactive software tool is proposed that provides assistance in determining the data decouiposition scheme that gives the best performance on tlie target machine and computes performance estimates for any chosen data partitioning scheme, allowing the programmer to experiment with several different schemes.
Abstract: An a.pproach to distributed riieiiiory pa.ralle1 programining that has recently become popular is oue where the programmer explicitly specilies t.he data decoiriposit.ion using language extensions, and a. compiler geuerates all the coiriinunicatioii. While this frees the prograiniuer froin tlie tedium of thinking about message-passing, no assistance is provided in determining the data decouiposition scheme that gives the best performance on tlie target machine. In this paper, we propose an interactive software tool that provides assistance for this very task. The proposed tool also computes performance estimates for any chosen data partitioning scheme, allowing tlie programmer to experiment with several different stra.tegies without ever running the program on the rnacliine.
85 citations
8 Apr 1990
TL;DR: ASAR (Automatic and Symbolic PARallelization) is described which consists of a source-to-source parallelizer and a set of interactive graphic tools and is designed for easy modification for other languages such as Fortran.
Abstract: This paper describes ASPAR (Automatic and Symbolic PARallelization) which consists of a source-to-source parallelizer and a set of interactive graphic tools. While the issues of data dependency have already been explored and used in many parallel computer systems such as vector and shared memory machines, distributed memory parallel computers require, in addition, explicit data decomposition. New symbolic analysis and data-dependency analysis methods are used to determine an explicit data decomposition scheme. Automatic parallelization models using high level communications are also described in this paper. The target applications are of the “regular-mesh" type typical of many scientific calculations.
The system has been implemented for the language C, and is designed for easy modification for other languages such as Fortran.
70 citations
1 Jan 1991
TL;DR: The PVM system and two example applications running on it are described, which enables supercomputer level concurrent computations to be performed on interconnected networks of heterogeneous computer systems.
Abstract: The PVM (Parallel Virtual Machine) system enables supercomputer level concurrent computations to be performed on interconnected networks of heterogeneous computer systems. Specifically, a network of 13 IBM RS/6000 powerstations has been used to run superconductor modeling codes at more than 250 Mflops. This paper describes the PVM system and two example applications running on it. 3 refs., 1 fig., 2 tabs.
62 citations
Performance Metrics
| Year | Papers |
|---|---|
| 1991 | 118 |
| 1990 | 191 |