By Topic

Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments

30-30 March 1998

Filter Results

Displaying Results 1 - 12 of 12
  • Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments

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

    Publication Year: 1998, Page(s): 101
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • Further results for improving loop interchange in non-adjacent and imperfectly nested loops

    Publication Year: 1998, Page(s):93 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. We propose an improved technique to determine whether loops can be interchanged between two non adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are also presented to show the effectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving performance of multi-dimensional array redistribution on distributed memory machines

    Publication Year: 1998, Page(s):82 - 92
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Array redistribution is required very often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of the programs may degrade considerably. We focus on automatic generation of communication routines for multi dimensional redistribution. The principal advantage of this work is to gain the ability to handle red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive and adaptable distributed shared memory

    Publication Year: 1998, Page(s):15 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system a shared address space through which they can communicate with each other. The main problem of a DSM implementation on top of a message passing system is performance. Performance of an implementation is closely related to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph based framework for the definition of tools dealing with sparse and irregular distributed data structures

    Publication Year: 1998, Page(s):62 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Industrial applications use specific problem oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for developers to visualize their applications in terms of these data, their structure, and the operations that are applied to them, whatever their effective implementation and their distribution are. We present both a framework ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ViC*: a compiler for virtual-memory C*

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

    The paper describes the functionality of ViC*, a compiler for a variant of the data parallel language C* with support for out-of-core data. The compiler translates C* programs with shapes declared out of core, which describe parallel data stored on disk. The compiler output is a SPMD style program in standard C with I/O and library calls added to efficiently access out-of-core parallel data. The V... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing automatic coordination on networks of workstations

    Publication Year: 1998, Page(s):72 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    Distributed shared objects are a well known approach to achieve independence of the memory model for parallel programming. The illusion of shared (global) objects is a convenient abstraction which leads to ease of programming on both kinds of parallel architectures, shared memory and distributed memory machines. We present several different implementation variants for distributed shared objects on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making distributed shared memory simple, yet efficient

    Publication Year: 1998, Page(s):2 - 13
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Recent research on distributed shared memory (DSM) has focussed on improving performance by reducing the communication overhead of DSM. Features added include lazy release consistency based coherence protocols and new interfaces that give programmers the ability to hand tune communication. These features have increased DSM performance at the expense of requiring increasingly complex DSM systems or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and distributed programming with Pthreads and Rthreads

    Publication Year: 1998, Page(s):34 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    The paper describes Rthreads (Remote threads), a software distributed shared memory system that supports sharing of global variables on clusters of computers with physically distributed memory. Other DSM systems either use virtual memory to implement coherence on networks of workstations or require programmers to adopt a special programming model. Rthreads uses primitives to read and write remote ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language bindings for a data-parallel runtime

    Publication Year: 1998, Page(s):42 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    The NPAC kernel runtime, developed in the PCRC (Parallel Compiler Runtime Consortium) project, is a runtime library with special support for the High Performance Fortran data model. It provides array descriptors for a generalized class of HPF like distributed arrays, support for parallel access to their elements, and a rich library of collective communication and arithmetic operations for manipula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ZPL's WYSIWYG performance model

    Publication Year: 1998, Page(s):50 - 61
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine model (the CTA) that accurately abstracts contemporary MIMD parallel computers. This makes it possible to correlate ZPL programs with machine behavior. As a result, programmers can reason about how code will perform on a typical parall... View full abstract»

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