By Topic

Programming Models for Massively Parallel Computers, 1995

Date 9-12 Oct. 1995

Filter Results

Displaying Results 1 - 25 of 29
  • Programming Models for Massively Parallel Computers

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (534 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • The parallel Fortran family and a new perspective

    Publication Year: 1995, Page(s):126 - 133
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Various parallel Fortran languages have been developed over the years. The research work in creating this Parallel Fortran Family has made significant contributions to parallel programming language design and implementation. In this paper, various parallel Fortran languages are studied based on a uniform co-ordination approach towards parallel programming. That is, new language constructs in paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a higher level of abstraction in parallel programming

    Publication Year: 1995, Page(s):78 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    There are substantial problems with exploiting parallelism, particularly massive parallelism. One attempt to solve these problems is general-purpose parallelism, which searches for models that are abstract enough to be useful for software development, but that map well enough to realistic architectures that they deliver performance. We show how the skeletons model is a suitable general-purpose mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of parallel algorithms

    Publication Year: 1995, Page(s):122 - 123
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    In this talk we present the intrinsic connection between modelling the suitable data type by algebraic specification and the correct and efficient implementation of high-speed parallel algorithms in hardware or software. The design tool IDEAS developed at the author's institution representing the first such instrument for automatic parallel algorithm generation is described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuration of the ALPHA language

    Publication Year: 1995, Page(s):18 - 24
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This paper presents extensions to ALPHA, a language based upon the formalism of affine recurrence equations (AREs). These extensions address the need for parametric and structured systems of such AREs. Similar to, but more general than the map operator of classical functional languages, the ALPHA structured techniques provide a dense and powerful description of complex systems referencing each oth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling SVM-Fortran for the Intel Paragon XP/S

    Publication Year: 1995, Page(s):52 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    SVM-Fortran is a language designed to program highly parallel systems with a global address space. A compiler for SVM-Fortran is described which generates code for parallel machines; our current target machine is the Intel Paragon XP/S with an SVM-extension called ASVM. Performance numbers are given for applications and compared to results obtained with corresponding HPF-versions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A-NETL: a language for massively parallel object-oriented computing

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

    A-NETL is a parallel object-oriented language intended to be used for managing small to massive parallelism with medium grain size. Its design goals are to support various styles of message passing, to treat data parallel operations at the same cost as programming languages of the SIMD type, to provide several synchronization facilities for autonomous control, and to provide information for the ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing atomic functions using compile-time information

    Publication Year: 1995, Page(s):68 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Functions that invoke operations on multiple objects atomically are a useful extension of object-based parallel languages, such as Orca. This paper introduces atomic functions and shows how compile-time information can drive run-time optimizations of such functions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing scalable programming techniques for weather prediction

    Publication Year: 1995, Page(s):111 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    In this paper we study the of issues of programmability and performance in the parallelization of weather prediction models. We compare parallelization using a high level library (the Nearest Neighbor Tool: NNT) and a high level language/directive approach (High Performance Fortran: HPF). We report on the performance of a complete weather prediction model (the Rapid Update Cycle, which is currentl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-limited procedures: a methodology for portable high-performance

    Publication Year: 1995, Page(s):10 - 17
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    This paper presents the generic program approach to achieving portable high-performance. This approach has three phases. In the first, a generic program, defining a family of semantically-equivalent program variants, is written. In the second, the generic program as specialized to the variant that performs best on an abstract model of the target computer. In the third, this variant is translated t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic mapping of stream-processing functional programs

    Publication Year: 1995, Page(s):44 - 51
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Functional programming languages are well suited to the expression and automatic mapping of parallel computations. The Paradigm compiler is being developed to automatically analyze and snap a class of Sisal programs amenable to static analysis for execution by distributed computer systems. A program description tree is constructed to represent the source program. In this form, the program is trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel EARS [edge addition rewrite systems]

    Publication Year: 1995, Page(s):198 - 204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    In this paper we show how edge addition rewrite systems (EARS) can be evaluated in parallel. EARS are a simple variant of graph rewrite systems, which only add edges to graphs. Because EARS are equivalent to a subset of Datalog, they provide a programming model for rule-based applications. EARS terminate and are strongly confluent, which makes them perfectly apt for parallel execution. In this pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • V-nested parallelism in C

    Publication Year: 1995, Page(s):167 - 174
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    This paper describes the integration of nested data parallelism into imperative languages using the example of C. Unlike flat data parallelism, nested data parallelism directly provides means for handling irregular data structures and certain forms of control parallelism, such as divide-and-conquer algorithms, thus enabling the programmer to express such algorithms far more naturally. Existing wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating synchronous and asynchronous paradigms: the Fork95 parallel programming language

    Publication Year: 1995, Page(s):134 - 141
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The SB-PRAM is a lock-step-synchronous, massively parallel multiprocessor currently being built at Saarbrucken University, with up to 4096 RISC-style processing elements and with a (from the programmer's view) physically shared memory of up to SGByte with uniform memory access time. Fork95 is a redesign of the PRAM language FORK, based on ANSI C, with additional constructs to create parallel proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realising a concurrent object-based programming model on parallel virtual shared memory architectures

    Publication Year: 1995, Page(s):88 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    In this paper, we investigate the suitability of parallel architectures for the realisation of a novel object-based computational model encapsulated within programming languages such as ConcurrentMeteteM. This model incorporates objects, groups, broadcast message-passing and asynchronous execution. As such it provides a high-level architecture-independent representation for a variety of concurrent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable tuple space model for structured parallel programming

    Publication Year: 1995, Page(s):25 - 32
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The paper proposes and analyses a scalable model of an associative distributed shared memory for massively parallel architectures. The proposed model is hierarchical and fits the modern style of structured parallel programming. If parallel applications are composed of a set of modules with a well-defined scope of interaction, the proposed model can induce a memory access latency time that only log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loop versus data scheduling: models, language and application for SVM

    Publication Year: 1995, Page(s):60 - 67
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    In this paper we show that, under different circumstances, data scheduling and loop scheduling are both useful models for parallel programs executing on shared virtual memory (SVM) systems. We therefore propose a unified programming model that permits both types of scheduling. We show that, given affine array references, a program segment which is parallel under loop scheduling can always be trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The refinement of high-level parallel algorithm specifications

    Publication Year: 1995, Page(s):106 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    PSETL is a prototyping language for developing efficient numeric code for massively parallel machines. PSETL enables parallel algorithms to be concisely specified at a very high level, and successively refined into lower level architecture-specific code. It includes a rich variety of parallel loops over sets, bags, and tuples, and a hierarchy of communication mechanisms, ranging from atomic assign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving data-parallel programs correct: the proof outlines approach

    Publication Year: 1995, Page(s):205 - 212
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We present a proof outline generation system for a simple data-parallel kernel language called L. Proof outlines for L are very similar to those for usual scalar-like languages. In particular, they can be mechanically generated backwards from the final post-assertion of the program. They appear thus as a valuable basis to implement a validation assistance tool for data-parallel programming. The eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Facilitating the development of portable parallel applications on distributed memory systems

    Publication Year: 1995, Page(s):176 - 183
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    In this paper, two programming tools are presented, facilitating the development of portable parallel applications on distributed memory systems. The Orchid system is a software platform, i.e. a set of facilities for parallel programming. It consists of mechanisms for transparent message passing and a set of primitive functions to support the distributed shared memory programming model. In order t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A taxonomy of programming models for symmetric multiprocessors and SMP clusters

    Publication Year: 1995, Page(s):2 - 7
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The basic processing element, from PCs to large systems, is rapidly becoming a symmetric multiprocessor (SMP). As a result, the nodes of a parallel computer will often be an SMP. The resulting mixed hardware models (combining shared-memory and distributed memory) provide a challenge to system software developers to provide users with programming models that are portable, understandable, and effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed memory implementation of elliptic partial differential equations in a dataparallel functional language

    Publication Year: 1995, Page(s):142 - 150
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    We show that the numerical solution of partial differential equations can be elegantly and efficiently addressed in a functional language. Two statistical numerical methods are considered. We discuss why current parallel imperative languages are difficult to use and why general (expression parallel) functional languages are not efficient enough. The key point of our approach is to offer “uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deriving optimal data distributions for group parallel numerical algorithms

    Publication Year: 1995, Page(s):33 - 41
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Numerical algorithms often exhibit potential parallelism caused by a coarse structure of submethods in addition to the medium grain parallelism of systems within submethods. We present a derivation methodology for parallel programs of numerical methods on distributed memory machines that exploits both levels of parallelism in a group-SPMD parallel computation model. The derivation process starts w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Provably correct vectorization of nested-parallel programs

    Publication Year: 1995, Page(s):213 - 222
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The work/step framework provides a high-level cost model for nested data-parallel programming languages, allowing programmers to understand the efficiency of their codes without concern for the eventual mapping of tasks to processors. Vectorization, or flattening, is the key technique for compiling nested-parallel languages. This paper presents a formal study of vectorization, considering three lo... View full abstract»

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