The proceedings contain 42 papers. The topics discussed include: improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes;cohesion : an efficient distributed shared me...
ISBN:
(纸本)081867038X
The proceedings contain 42 papers. The topics discussed include: improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes;cohesion : an efficient distributed shared memory system supporting multiple memory consistency models;supercompilers for massively parallelarchitectures;investigation of some hardware accelerators for relational algebra operations;implementing higher-order gamma on MasPar: a case study;a framework for visual parallelprogramming;parallelizing a PDE solver: experiences with PISCES-MP;efficient scalable mesh algorithms for merging, sorting and selection;and constructing parallel implement at ions with algebraic programming tools.
A transactional paradigm is suggested for computer-assisted parallelization of programs and register-cache scheduling. It can serve as a building tool for pipelining, data parallelism, or generic parallelism in a vari...
详细信息
ISBN:
(纸本)0780320182
A transactional paradigm is suggested for computer-assisted parallelization of programs and register-cache scheduling. It can serve as a building tool for pipelining, data parallelism, or generic parallelism in a variety of architectures and the cost of execution can be estimated realistically.
Two of the currently most promising programming paradigms, namely Object-Oriented programming and Concurrent Constraint programming are combined into a single, highly parallel computational model based on Term Graph R...
详细信息
Two of the currently most promising programming paradigms, namely Object-Oriented programming and Concurrent Constraint programming are combined into a single, highly parallel computational model based on Term Graph Rewriting Systems. In particular, we show how multi-headed Term Graph rewrite rules provide a powerful tool able to manipulate Term Graphs which themselves represent in a homogeneous way objects, concurrently executing agents and constraints. Due to the inherent fine grain parallelism of Term Graph Rewriting the proposed model is highly parallel with all activities (object communication, agent execution and constraint solving) executing concurrently.
作者：
Bode, ArndtInstitut für Informatik
Lehrstuhl für Rechnertechnik und Rechnerorganisation Technische Universitat Munchen MunchenD-80290 Germany
This article covers research at Technische Universität München on distributed and parallelarchitectures and applications. First, an overview on the parallel processing research organization is given. The se...
详细信息
The transition from sequential object-oriented programming (OOP) to parallelism has been in the focus of active research. Experimental languages that try to integrate objects and parallelism are often seriously compro...
详细信息
The transition from sequential object-oriented programming (OOP) to parallelism has been in the focus of active research. Experimental languages that try to integrate objects and parallelism are often seriously compromised in their capability to provide inheritance for parallel objects. Even languages that permit some amalgamation of parallelism and inheritance tend to support only single-class inheritance. The purpose of this paper is to specify a strongly typed language framework for parallel object-oriented programming which provides easy-to-use multiple inheritance for parallel objects, including inheritance for synchronization code. The proposed approach to parallelism is based on 'separate' methods which generate processes and provide rendezvous-type coordination;it succeeds in cases where known languages fail to combine inheritance with parallelism, or do it inefficiently and inconveniently.
Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (conc...
详细信息
Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) logic programming ones and various amalgamations of them, to (concurrent) object-oriented ones. More recently, the relationship between TGRS and process calculi (such as the π-calculus) as well as Linear Logic has also been explored. In this paper we describe our experience in using an intermediate Compiler Target Language (CTL) based on TGRS for mapping a variety of programming paradigms of the aforementioned types onto it, highlighting in the process some of the issues which we feel any such intermediate representation should address and which form effectively a minimum set of features every CTL should possess.
In this paper, we present an abstract model of the RAPID-2 SIMD architecture. RAPID-2 is a massively parallel add-on board for PCs. It implements a 'paginated set-associative' model of architecture, and has sy...
详细信息
In this paper, we present an abstract model of the RAPID-2 SIMD architecture. RAPID-2 is a massively parallel add-on board for PCs. It implements a 'paginated set-associative' model of architecture, and has systolic capabilities. The L1 language implements the abstract model. L1 is a co-specification language for the programming and micro-programming of RAPID-2. It is derived from C. In order to check their semantic, L1 programs can be emulated in a C++ environment. In the near future, they should be compiled into C application programs and the corresponding micro-programs.
Most high-level parallelprogramming languages allow for fine-grained parallelism. Programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to ...
详细信息
ISBN:
(纸本)9780897917179
Most high-level parallelprogramming languages allow for fine-grained parallelism. Programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. When executing such programs, the major concern is to dynamically schedule tasks to processors in order to minimize execution time and the amount of memory needed. In this paper, a class of parallel schedules that are provably efficient in both time and space, even for programs whose task structure is revealed only during execution are identified. Following this, an efficient dynamic scheduling algorithm that generates schedules in this class, for languages with nested fine-grained parallelism is described.
Methods and tools for debugging parallel programs by visualization and animation of the execution behavior of the programs are described. Based on an evaluation and classification of existing visualization environment...
详细信息
ISBN:
(纸本)0780320182
Methods and tools for debugging parallel programs by visualization and animation of the execution behavior of the programs are described. Based on an evaluation and classification of existing visualization environments, the visualization and animation tool VISTOP (VISualization TOol for parallel Systems) has been developed in a PhD-thesis as part of the integrated tool environment TOPSYS (TOols for parallel SYStems) for programming distributed memory multiprocessors. VISTOP supports the interactive on-line visualization of the message passing programs based on various views, particularly a process graph based concurrency view for detecting synchronization and communication bugs.
We propose some non-standard, yet straightforward, and highly efficacious alternative modes of data assignment which induce a significant reduction in communication volume and hence in execution time for stencil opera...
详细信息
We propose some non-standard, yet straightforward, and highly efficacious alternative modes of data assignment which induce a significant reduction in communication volume and hence in execution time for stencil operations, i.e. local iterative updates, implemented within a data-parallelprogramming environment. Performance results obtained in the solution of two three-dimensional elliptic partial differential equations (PDEs) using iterative methods entailing such updates indicate that substantial performance increases can be realized using these alternative data assignment schemes.
暂无评论