By Topic

High-Level Programming Models and Supportive Environments, 1997. Proceedings., Second International Workshop on

Date 1-1 April 1997

Filter Results

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

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

    Publication Year: 1997, Page(s): 133
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Supporting multiple parallel programming paradigms on top of the Millipede virtual parallel machine

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

    The MILLIPEDE system is a small yet powerful interface of a virtual parallel machine (VPM) on top of distributed computing environments. MILLIPEDE is thus a convenient environment for porting various existing parallel programming languages, for the design of new parallel programming languages, and for the development of parallel applications. MILLIPEDE is fully implemented at the Technion on a clu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm design and analysis using the WPRAM model

    Publication Year: 1997, Page(s):125 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The takeup of parallel computing has been hampered by the lack of portable software. The BSP model allows the design of portable code for regular computations. This paper describes the use of the WPRAM model to support more irregular problems. A shared queue data type is described which provides predictable and scalable performance characteristics. The queue can be used to structure the sharing of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-level data parallel programming in Promoter

    Publication Year: 1997, Page(s):47 - 54
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Implementing realistic scientific applications on parallel platforms requires a high level, problem adequate and flexible programming environment. The hybrid system PROMOTER pursues a two level approach allowing easy and flexible programming at both language and library levels. The core concept of PROMOTER's language model is its highly abstract and unified concept of data and communication struct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-level cellular programming model for massively parallel processing

    Publication Year: 1997, Page(s):55 - 63
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Cellular automata are used for designing high performance applications in many areas. The paper describes CARPET, a high level programming language based on the cellular automata model. CARPET is a programming language designed to support the development of parallel high performance software. It exploits the computing power of a highly parallel computer releasing a user from using explicit paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Eden coordination model for distributed memory systems

    Publication Year: 1997, Page(s):120 - 124
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Eden is a concurrent declarative language that aims at both the programming of reactive systems and parallel algorithms on distributed memory systems. In this paper, we explain the computation and coordination model of Eden. We show how lazy evaluation in the computation language is fruitfully combined with the coordination language that is specifically designed for multicomputers and that aims at... View full abstract»

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

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

    CoOperative Objects (COOs) are a concurrent object oriented modelling and programming language, which uses the Petri net theory to define the concurrency within each object, among objects, and also the inter object asynchronous communication. SYROCO is a C++ implementation of CoOperative Objects which proves to be efficient and convenient enough to support real size applications. The paper aims to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting high level programming with high performance: the Illinois Concert system

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

    Programmers of concurrent applications are faced with a complex performance space in which data distribution and concurrency management exacerbate the difficulty of building large, complex applications. To address these challenges, the Illinois Concert system provides a global names-pace, implicit concurrency control and granularity management, implicit storage management, and object oriented prog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCL-Chan: an asynchronous data-parallel language for irregular algorithms

    Publication Year: 1997, Page(s):64 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Parallelism suffers from a lack of programming languages both simple to handle and able to take advantage of the power of present parallel computers. If parallelism expression is too high level, compilers have to perform complex optimizations leading often to poor performances. One the other hand, too low level parallelism transfers difficulties toward the programmer. We propose a programming lang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rule-based approach for automatic bottleneck detection in programs on shared virtual memory systems

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

    Programming distributed memory multiprocessors requires program parallelization as well as program optimization with respect to data locality. SVM-Fortran is a programming language for shared virtual memory architectures with special language features for specifying the distribution of parallel tasks onto the processors. It is realized on top of a shared virtual memory implementation on Intel Para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing high-level and low-level implementations of a molecular dynamics algorithm

    Publication Year: 1997, Page(s):130 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    The author addresses through a specific example the question about the overhead incurred with the use of higher abstraction levels for parallel programming. He develops a simple molecular dynamics application in ALWAN and in MPI, and compares the execution performances on an Intel Paragon machine View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing HPF programs by migrating virtual processors

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

    The paper explores the integration of load balancing features in the data parallel language, HPF, targeting semi regular applications. We show that the HPF virtual processors are good candidates to be the unit of migration. Then, we compare 3 possible implementations and show that threads provide a good trade-off between efficiency and ease of implementation. We finally describe a preliminary impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity and performance in parallel programming languages

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

    Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often point out various language features that are designed to provide the programmer with a simple programming interface. However, virtually no data exists that quantitatively evaluates the relative ease of use of different pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperating agents: language support and load distribution

    Publication Year: 1997, Page(s):115 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    This paper presents a new language concept for the support of application integrated load distribution. Load distribution is realized by assigning tasks to cooperating agents and also by migrating agents from overloaded to under-loaded processes. Flexible and portable implementation of load distribution mechanisms is achieved by user implemented move and restart tasks. The paper describes the new ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-level directives to drive the allocation of parallel object-oriented applications

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

    The paper presents the Abstract Configuration Language (ACL) implemented within the Parallel Objects object oriented parallel programming environment. ACL defines a set of directives that allow users to specify the allocation needs of his/her application components without being aware of the architectural details. ACL directives drive the allocation decisions of the run time support, by adapting i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel programming through configurable interconnectable objects

    Publication Year: 1997, Page(s):110 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    This paper presents P-RIO, a parallel programming environment that supports an object based software configuration methodology. It promotes a clear separation of the individual sequential computation components from the interconnection structure used for the interaction between these components. This makes the data and control interactions explicit, simplifying program visualization and understand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDE-oriented language compilation and optimization with CTADEL for parallel computing

    Publication Year: 1997, Page(s):105 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    In this paper we focus on generating efficient parallel codes for solving scientific problems within large-scale performance-critical applications. More specifically we present techniques for high-level symbolic optimization for automatic generation of efficient codes that numerically solve sets of computationally expensive right-hand sides (RHSs) of systems of partial differential equations (PDEs... View full abstract»

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