Shape theory is a new approach to data types and programming based on the separation of a data type into its 'shape' and 'data' parts. Shape is common in parallel computing. This paper identifies areas...
详细信息
Shape theory is a new approach to data types and programming based on the separation of a data type into its 'shape' and 'data' parts. Shape is common in parallel computing. This paper identifies areas where the explicit use of shape reduces the burden of programming a parallel computer, using examples from an implementation of Cholesky decomposition.
Software generation in the OORHS (object-oriented reciprocative hypercomputing system) is user-transparent. It addresses the issue of ease of use by minimizing the number of steps leading to a programming solution. Th...
详细信息
Software generation in the OORHS (object-oriented reciprocative hypercomputing system) is user-transparent. It addresses the issue of ease of use by minimizing the number of steps leading to a programming solution. The OORHS requires from the user only a highlevel APPL program, which is, in effect, a specification. For every APPL program, the system automatically performs all the necessary distributed computing steps. The precompiler, based on the object-oriented paradigm, instantiates the encapsulated program objects embedded in an APPL program. These program objects are distributed at the source level. They are compiled and then executed at the allocated sites. This unique approach, known as local compilation, eliminates the need to store the compilers used by other machines locally. It enhances the compatibility between the compiled program and the host processor. The precompiler generates a program objects dictionary for every APPL program. The contents in the dictionary facilitates program visualization.
In this paper, we discuss scalability of parallel systems from three aspects and point out some of the weakness of several existing main schemes for scalability. As an extension to the isoefficiency metric and isospee...
详细信息
ISBN:
(纸本)0818674601
In this paper, we discuss scalability of parallel systems from three aspects and point out some of the weakness of several existing main schemes for scalability. As an extension to the isoefficiency metric and isospeed metric, we present and define scalability of parallel algorithm implementation, and analyze some relevant theoretical perspectives.
Nondeterminacy is an important issue of testing and debugging parallel programs. For a message passing program the inter-process communication is the main cause of nondeterminacy. From a event-based view, the executio...
详细信息
ISBN:
(纸本)0818674601
Nondeterminacy is an important issue of testing and debugging parallel programs. For a message passing program the inter-process communication is the main cause of nondeterminacy. From a event-based view, the execution of a message passing parallel program can be modeled as partially ordered set of events. The nondeterminacy is reflected in the partially ordered set. In this paper, we present a method to analyze the messagewise nondeterminacy of a message passing program based on the execution trace which preserves the partial order relations.
Compilers perform interprocedural parallelization and optimization become an essential component of modern high performance computer systems. A compiler system that is called PORT is presented in this paper. Its impor...
详细信息
ISBN:
(纸本)0818674601
Compilers perform interprocedural parallelization and optimization become an essential component of modern high performance computer systems. A compiler system that is called PORT is presented in this paper. Its important features, such as flow analysis, data dependence analysis and visualization tools are addressed.
This paper describes the DOSMOS(1) parallelprogramming environment. Based on a DSM layer, this system has been specially designed to ensure scalability and efficiency. Several novel features are introduced as the gro...
详细信息
ISBN:
(纸本)0780335295
This paper describes the DOSMOS(1) parallelprogramming environment. Based on a DSM layer, this system has been specially designed to ensure scalability and efficiency. Several novel features are introduced as the grouping of processes, the possibility of mixing message-passing (PVM) code and DSM code, the definition of optimized weak consistency protocols, the integration of monitoring facilities. First experiments on networks of workstations show the effectiveness of these features.
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. parallelization of scheduling algorithms is a new research area. This paper discusses the...
详细信息
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms.
PASM is a concept for a parallel processing system that allows experimentation with different architectural design alternatives. PASM is dynamically reconfigurable along three dimensions: partitionability into indepen...
详细信息
PASM is a concept for a parallel processing system that allows experimentation with different architectural design alternatives. PASM is dynamically reconfigurable along three dimensions: partitionability into independent or communicating submachines, variable interprocessor connections, and mixed-mode SIMD/MIMD parallelism. With mixed-mode parallelism, a program can switch between SIMD (synchronous) and MIMD (asynchronous) parallelism at instruction-level granularity, allowing the use of both modes in a single machine. The PASM concept is presented, showing the ways in which reconfiguration can be accomplished. Trade-offs among SIMD, MIMD, and mixed-mode parallelism are explored. The small-scale PASM prototype with 16 processing elements is described. The ELP mixed-mode programming language used on the prototype is discussed. An example of a prototype-based study that demonstrates the potential of mixed-mode parallelism is given.
An active object is a function that returns a pointer to its environment when an execution thread is attached to it. This facility of BaLinda K, a parallel Lisp dialect with an imperative appearance, is shown to be us...
详细信息
An active object is a function that returns a pointer to its environment when an execution thread is attached to it. This facility of BaLinda K, a parallel Lisp dialect with an imperative appearance, is shown to be useful for constructing I/O interfaces and execution control mechanisms, and has potential as a tool for system program implementation.
We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first ...
We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n(log2 3) processors, but present different behavior for inputs of practical size. The third algorithm has complexity O(n log(2) n) on n processors, offering therefore better asymptotic efficiency. A refinement of the asymptotic analysis for the important case of a constant number of processors takes into account sequential parts of the algorithm and communications overhead. It is shown that the theoretically best speed-up and efficiency can be obtained with two of the algorithms for sufficient problem size. The experimental results confirm the analysis. (C) 1996 Academic Press Limited
暂无评论