By Topic

Scalable High Performance Computing Conference, 1992. SHPCC-92, Proceedings.

Date 26-29 April 1992

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings. Scalable High Performance Computing Conference SHPCC-92 (Cat. No.92TH0432-5)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • Evaluating parallel languages for molecular dynamics computations

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

    The paper describes the practicalities of porting a basic molecular dynamics computation to a distributed-memory machine. In the process, it shows how program annotations can aid in parallelizing a moderately complex code. It also argues that algorithm replacement may be necessary in parallelization, a task which cannot be performed automatically. The paper closes with some results from a parallel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel molecular dynamics on a torus network

    Publication Year: 1992, Page(s):106 - 112
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The paper presents some theoretical results concerning molecular dynamics simulations on parallel networks. Specifically, it gives rules which, depending on the system to be simulated and on the processor network, gives the optimal mapping for a class of algorithms. It also shows that multi-particle potentials can efficiently be implemented when geometric parallelism is used. The paper demonstrate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelization of AMBER molecular dynamics program for the AP1000 highly parallel computer

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

    The authors have parallelized the AMBER molecular dynamics program for the AP1000 highly parallel computer. To obtain a high degree of parallelism and an even load balance between processors for model problems of protein and water molecules, protein amino acid residues and water molecules are distributed to processors randomly. Global interprocessor communication required by this data mapping is e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual-aural representations of performance for a scalable application program

    Publication Year: 1992, Page(s):433 - 440
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Visual and aural portrayals of parallel program execution are used to gain insight into how a program is working. The combination of portrayals in a coordinated performance environment provides the user with multiple perspectives and stimuli to comprehend complex, multidimensional run-time information. An open question for either medium is how well does it scale? That is, how effectively can it be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Multicomputer Toolbox approach to concurrent BLAS and LACS

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

    The authors describe many of the issues involved in general-purpose concurrent basic linear algebra subprograms (concurrent BLAS or CBLAS) and discuss data-distribution independence, while further generalizing data distributions. They comment on the utility of linear algebra communication subprograms (LACS). They also describe an algorithm for dense matrix-matrix multiplication and also discuss ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network-attached storage systems

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

    With the dramatic shift towards distributed computing, and its associated client-server model of computation, storage facilities are now found attached to file servers and distributed throughout the network. The paper discusses the underlying technology trends that are leading to high performance network-based storage, namely advances in networks, storage devices, and I/O controller and server arc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Portable execution traces for parallel program debugging and performance visualization

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

    There is much interest in defining a standard for event traces collected from parallel architectures. A standard would support free data and tool sharing among researchers working on varied architectures. But defining that standard has proved to be difficult. Any standard must allow user-defined events and avoid or hide event semantics as much as possible. The authors propose a standard based on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging mapped parallel programs

    Publication Year: 1992, Page(s):200 - 203
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    As more sophisticated tools for parallel programming become available, programmers will inevitably want to use them together. However, some parallel programming tools can interact with each other in ways that make them less useful. In particular, it a mapping tool is used to adapt a parallel program to run on relatively few processors, the information presented by a debugger may become difficult t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HeNCE: graphical development tools for network-based concurrent computing

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

    HeNCE (heterogeneous network computing environment) is an X Window based graphical parallel programming environment that was created to assist scientists and engineers with the development of parallel programs. HeNCE provides a graphical interface for creating, compiling, executing, and debugging parallel programs, as well as configuring a distributed virtual computer (using PVM). HeNCE programs c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective monitoring using performance metric predicates

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

    The field of parallel processing is going through an important evolution in technology characterized by a significant increase in the number of processors within such systems. As the number of processors increases, the conventional techniques for monitoring the performance of parallel systems will produce large amounts of data in the form of event trace files. The authors propose one possible solu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse data representation for data-parallel computation

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

    Performance optimization has ben achieved by a transparent parallel sparse data representation in a data-parallel programming environment. In a sparse data representation, only the non-zero data elements of an array are stored and processed. The parallel sparse data representation is designed to efficiently utilize system resources on multicomputer systems for a broad class of problems; the main f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel preconditioning and approximation inverses on the Connection Machine

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

    The authors present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. It explicitly computes an approximate inverse to the original matrix that can be applied most efficiently for iterative methods on massively parallel machines. The algorithm and its implementation on the Connection Machine CM-2 are discussed in detail and supported by timings obtained from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive methods and rectangular partitioning problem

    Publication Year: 1992, Page(s):409 - 415
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Partitioning problems for rectangular domains having nonuniform workload for mesh-connected SIMD architectures are discussed. The considered rectangular workloads result from application of adaptive methods to the solution of hyperbolic differential equations on SIMD machines. A new form of the partitioning problem is defined in which sub-meshes of processors are assigned to tasks, each task being... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data remapping for distributed-memory multicomputers

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

    The fragmented memory model of distributed-memory multicomputers, such as the Intel iPSC and Paragon series of computers, and the Thinking Machines CM-5, introduces significant complexity into the compilation process. Since most conventional programming languages provide a model of a global memory, a distributed-memory compiler must translate all data references to correspond to the fragmented mem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterized memory/processor optimizing FORTRAN compiler for parallel computers

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

    A new approach to generating low-conflict parallel instructions for complex applications is introduced in this paper. This method is presented within the context of a FORTRAN compiler. An approximate simulator has been incorporated within a parallel-code/domain-decomposition loop within the compiler. The simulator estimates the performance of candidate instruction segments, and guides the selectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phase modeling of a parallel scientific code

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

    Describes a performance model for a parallel program that solves the nonlinear shallow water equations using the spectral transform method. The model is generated via a phase analysis, and consists of a sequence of simple models whose sum describes the performance of the entire code. This use of a sequence of simple models increases the range of validity of the model as the problem and machine par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstractions for parallel N-body simulations

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

    Introduces C++ programming abstractions for maintaining load-balanced partitions of irregular and adaptive trees. Such abstractions are useful across a range of applications and MIMD architectures. The use of these abstractions is illustrated for gravitational N-body simulation. The strategy for parallel N-body simulation is based on a technique for implicitly representing a glob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel solution of the generalized Helmholtz equation

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

    Uses the reduced system conjugate gradient algorithm to find the solution of large, sparse, symmetric, positive definite systems of linear equations arising from finite difference discretization of the generalized Helmholtz equation. The authors examine in detail three spatial domain decompositions on distributed memory machines. They use a two-step damped Jacobi preconditioner for the Schur compl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalability issues for a class of CFD applications

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

    Considers the performance scalability of a class of computational fluid dynamics applications. The results indicate that neither the scalability in time nor the scalability in problem size can be obtained by simply scaling up the processing power. Results are presented to show that latency, packet size, and transmission speeds play an important role. However, improvements only in the architectural... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of message-passing applications by multithreading

    Publication Year: 1992, Page(s):84 - 89
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Achieving maximum performance in message-passing programs requires that calculation and communication be overlapped. However, the program transformations required to achieve this overlap are error-prone and add significant complexity to the application program. The authors argue that calculation/communication overlap can be achieved easily and consistently by executing multiple threads of control ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Portable parallel Level-3 BLAS in Linda

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

    Describes an approach towards providing an efficient Level-3 BLAS library over a variety of parallel architectures using C-Linda. A blocked linear algebra program calling the sequential Level-3 BLAS can now run on both shared and distributed memory environments (which support Linda) by simply replacing each call by a call to the corresponding parallel Linda Level-3 BLAS. The authors summarise some... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of a parallel pressure-correction algorithm to 3D turbomachinery flows

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

    A parallel algorithm for the solution of three-dimensional compressible flows in turbomachinery has been developed and demonstrated on a scalable distributed memory multicomputer. The algorithm solves the compressible form of the Euler or Navier-Stokes equations via a compressible pressure correction formulation. To achieve high accuracy for highly turning blade rows, the computational grid is con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object oriented approach to boundary conditions in finite difference fluid dynamics codes

    Publication Year: 1992, Page(s):145 - 148
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Parallel computers have been used to solve computational fluid dynamics (CFD) problems for many years; however, while the hardware has greatly improved, the software methods for describing CFD algorithms have remained largely unchanged. From the physics and software engineering points of view, the boundary conditions consume most of the algorithmic development and programming time, but only a smal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An expressive annotation model for generating SPMD programs

    Publication Year: 1992, Page(s):208 - 211
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    This paper illustrates two major points. First, the authors discuss a general, conceptual model for SPMD program generating systems, and demonstrate that this model allows one to capture a broad range of different program semantics. Second, they show that it is possible to fit the concepts of this model into an annotation language that allows an SPMD program generating system to fully utilize all ... View full abstract»

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