By Topic

Massively Parallel Programming Models, 1997. Proceedings. Third Working Conference on

Date 14-14 Nov. 1997

Filter Results

Displaying Results 1 - 24 of 24
  • Proceedings. Third Working Conference on Massively Parallel Programming Models (Cat. No.97TB100228)

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1997, Page(s): 221
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • Portability of performance with the BSPLib communications library

    Publication Year: 1997, Page(s):33 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The BSP cost model makes a new level of power available for designing parallel algorithms. First, it models the actual behaviour of today's parallel computers, and so can be used to choose appropriate algorithms without completely implementing them. Second, it becomes possible to characterise the range of architecture performance over which a particular algorithm is the best choice. This provides ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Potential parallelism in iteration methods

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

    The execution of iteration methods, including iteration methods for time-dependent differential equations, is one of the most time-consuming tasks in scientific computing, especially when large systems have to be solved, large time scales have to be computed or solutions of high quality are required. To decrease the computation time, parallel machines can be used but a detailed analysis of the pot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable multicomputer object spaces: a foundation for high performance systems

    Publication Year: 1997, Page(s):185 - 197
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    The development of scalable architectures at store levels of a layered model has concentrated on processor parallelism balanced against scalable memory bandwidth, primarily through distributed memory structures of one kind or another. A great deal of attention has been paid to hiding the distribution of memory to produce a single store image across the memory structure. It is unlikely that the dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Datarol: a parallel machine architecture for fine-grain multithreading

    Publication Year: 1997, Page(s):151 - 162
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    We discuss a design principle of massively parallel distributed-memory multiprocessor architecture which solves latency problem, and present the Datarol machine architecture. Latencies, caused by remote memory access and remote procedure call, are most serious problems in massively parallel computers. In order to eliminate the processor idle times caused by these latencies, processors must perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BaLinda: a simple parallel programming model

    Publication Year: 1997, Page(s):12 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    This paper argues for the development of more general and user-friendly parallel programming models, independent of hardware structures and concurrency concepts of operating systems theory, leading to portable programs and easy to use languages. It then presents the BaLinda model, based on last in/first out threads that interact via a shared tuplespace, and argues that it is simple enough to be bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspects of the compilation of nested parallel imperative languages

    Publication Year: 1997, Page(s):102 - 109
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    We report on our experiences with the implementation of the imperative nested parallel language V. We give an overview of the compiler and a description of its building blocks and their interplay. We show how functional and imperative constructs such as control structures and pointers are handled by transformation rules. We justify additional restrictions that had to be placed on side effects and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating computation and information resources-an MPP perspective

    Publication Year: 1997, Page(s):174 - 184
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1044 KB)

    This paper is concerned with the use of Massively Parallel Processing (MPP) systems by industry and commerce. In this context, it is argued that the definition of MPP should be extended to include LAN/WAN clusters or `meta-computers'. The frontier for research for industry has moved on from mere parallel implementations of scientific simulations or commercial databases-rather, it is concerned with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commercial applications on the AP3000 parallel computer

    Publication Year: 1997, Page(s):198 - 205
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Recently, commercial parallel applications became important in parallel computing with the increase of parallel computer users. In this study, we parallelize two commercial applications, a fulltext search system and a data mining system. In this paper, the implementation of each application and its performance evaluation on the AP3000 parallel computer are shown. A parallel framework, a novel para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HPF+ investigations with crash-simulation kernels

    Publication Year: 1997, Page(s):206 - 212
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    This paper reports on the use of HPF language extensions for the irregular computational and communications requirements arising in the algorithms found in crashworthiness simulation codes. The HPF language extensions, forming the HPF+ language definition, have been designed to deal with the requirements of complex, scientific applications which involve irregular constructs (from meshes to data st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Market-based massively parallel Internet computing

    Publication Year: 1997, Page(s):118 - 129
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    Recent advances in Internet connectivity and implementations of safer distributed computing through languages such as Java provide the foundation for transforming computing resources into tradable commodities. We have developed Javelin, a Java-based prototype of a globally distributed heterogeneous, high-performance computational infrastructure that conveniently enables rapid execution of massivel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPI-2: standards beyond the message-passing model

    Publication Year: 1997, Page(s):43 - 49
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The MPI (Message-Passing Interface) Standard has been successful in its goal of promoting portable parallel programming for both application writers and library implementors. MPI-I confined itself to the well-known and understood message-passing model, in which a fixed number of processes with separate address spaces communicate only though cooperative operations such as send/receive or collective... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel program execution model supporting modular software construction

    Publication Year: 1997, Page(s):50 - 60
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A watershed is near in the architecture of computer systems. There is overwhelming demand for systems that support a universal format for computer programs and software components so users may benefit from their use on a wide variety of computing platforms. At present this demand is being met by commodity microprocessors together with standard operating system interfaces. However current systems d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving irregular problems with High Performance Fortran

    Publication Year: 1997, Page(s):2 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    High Performance Fortran (HPF) provides a high-level interface for data-parallel scientific applications, while delegating to the compiler the task of generating an explicitly parallel message-passing program. The main objective of this paper is to study the applicability of the language to a class of irregular scientific applications. After giving an outline of developments that led to HPF and sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The high performance solution of irregular problems

    Publication Year: 1997, Page(s):90 - 101
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Progress in networking technologies now allows the implementation of a 1,000 processor machine which scales linearly in performance The key to realising the potential of these machines is in the support for high performance code which is both scalable (in problem size and number of processors) and portable, using structured software design methods. Work at Leeds has been studying the use of a type... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The SB-PRAM: concept, design and construction

    Publication Year: 1997, Page(s):163 - 172
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    We summarize the project at the Computer Science Department at the University of Saarbrucken that aims at building the parallel computer SB-PRAM, a scalable shared memory multi-processor machine based on a modified Fluent Machine. We present the concept of the architecture, highlight some of the design decisions, and describe in some detail the construction of both hardware and software modules View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling and supporting skeletons on MPP

    Publication Year: 1997, Page(s):140 - 150
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Parallel programming needs a high level programming model in which compilers and run time supports take care of traditionally intractable problems related to efficient usage of the target machine (mapping, scheduling, data decomposition, etc.). The matter of designing a real system providing such a model is highly simplified by constructing the parallel programs using scalable skeletons which capt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming and complexity analysis using Actors

    Publication Year: 1997, Page(s):68 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    We describe Actors, a flexible, scalable and efficient model of computation, and develop a framework for analyzing the parallel complexity of programs written in it. Actors are asynchronous, autonomous objects which interact by message-passing. The data and process decomposition inherent in Actors simplifies modeling real-world systems. High-level concurrent programming abstractions have been deve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel programming model for irregular dynamic neural networks

    Publication Year: 1997, Page(s):214 - 219
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The compilation of high-level programming languages for parallel machines faces two challenges: maximizing data/process locality and balancing load. No solutions for the general case are known that solve both problems at once. The present paper describes a programming model that allows to solve both problems for the special case of neural network learning algorithms, even for irregular networks wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (De) composition rules for parallel scan and reduction

    Publication Year: 1997, Page(s):23 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We study the use of well-defined building blocks for SPMD programming of machines with distributed memory. Our general framework is based on homomorphisms, functions that capture the idea of data-parallelism and have a close correspondence with collective operations of the MPI standard, e.g., scan and reduction. We prove two composition rules: under certain conditions, a composition of a scan and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance driven programmimg models

    Publication Year: 1997, Page(s):61 - 67
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    Most projections for high-performance, massively parallel processors (MPPs) include deep and complex memory hierarchies. Making efficient use of these systems will require making efficient use of these memory hierarchies, without sacrificing the advancements that have been made in algorithms. Efficient programming models were developed for vector computers, particularly the memory system structure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel computing in Java

    Publication Year: 1997, Page(s):112 - 117
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Although Java was not specifically designed for the computationally intensive numeric applications that are the typical fodder of highly parallel machines, its widespread popularity and portability make it an interesting candidate vehicle for massively parallel programming. With the advent of high-performance optimizing Java compilers, the open question is: How can Java programs best exploit massi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable grain architectures for MPP computation and structured parallel programming

    Publication Year: 1997, Page(s):132 - 139
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The paper discusses the relationships between hierarchically composite MPP architectures and the software technology derived from the structured parallel programming methodology, in particular the architectural support to successive modular refinements of parallel applications, and the architectural support to the parallel programming paradigms and their combinations. The structured parallel progr... View full abstract»

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