A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of mo...
详细信息
Cluster-M is a new parallelprogramming paradigm for designing portable software. The two main components of this paradigm are cluster-M specifications and cluster-M representations. Cluster-M specifications are high ...
详细信息
Cluster-M is a new parallelprogramming paradigm for designing portable software. The two main components of this paradigm are cluster-M specifications and cluster-M representations. Cluster-M specifications are high level machine independent parallel code which are mapped onto cluster-M representations, system graphs representing the topologies of the underlying architectures. An algorithm for generating cluster-M representations is presented. Also, a set of high-level constructs essential for writing cluster-M specifications are shown. Using these components, an efficient methodology is proposed to map parallel algorithms onto architectures.< >
Summary form only given, as follows. Recent advances in the parallel processing technology promise to provide an unprecedented level of computational power in the near future. A crucial factor to achieve the potential...
详细信息
Summary form only given, as follows. Recent advances in the parallel processing technology promise to provide an unprecedented level of computational power in the near future. A crucial factor to achieve the potential of this emerging technology is the development of efficient parallel algorithms that are scalable across architectures and parallel machines. The author reviews several paradigms for designing parallel algorithms and examines their efficiency relative to several programming models. Some of these techniques are discussed in the context of designing efficient image processing algorithms in the data parallel model, the message passing model, and the scan line array processor model.< >
We introduce a fast parallel approximation algorithm for the positive linear programming optimization problem, i.e. the special case of the linear programming optimization problem where the input constraint matrix and...
详细信息
ISBN:
(纸本)0897915917
We introduce a fast parallel approximation algorithm for the positive linear programming optimization problem, i.e. the special case of the linear programming optimization problem where the input constraint matrix and constraint vector consist entirely of positive entries. The algorithm is elementary, and has a simple parallel implementation that runs in polylog time using a linear number of processors.
The proposed distributed shared memory model is based on a data replication scheme that provides an environment for a collection of processes that interact to solve a parallelprogramming problem. In the implementatio...
详细信息
The authors present an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifies the development process by encapsulating the common aspects of stencil algori...
详细信息
The authors present an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifies the development process by encapsulating the common aspects of stencil algorithms in a base stencil class so that application-specific derived classes can be easily defined via inheritance and overloading. In addition, the stencil base class contains mechanisms for parallel execution. The result is a high-performance, parallel, application-specific stencil class. The authors present the design rationale for the base class and illustrate the derivation process by defining two subclasses, an image convolution class and a PDE solver. The classes have been implemented in Mentat, an object-oriented parallelprogramming system that is available on a variety of platforms. Performance results are given for a network of Sun SPARCstation IPCs.< >
Building the hardware for a high-performance distributed computer system is a lot easier than building its software. The authors describe a model for programming distributed systems based on abstract data types that c...
详细信息
This paper studies the problem of allocating the interacting task modules, of a parallel program, to the heterogeneous processors in a parallel architecture. The goal is to provide a load balanced allocation which min...
详细信息
Lee's (1961) maze-routing algorithm has been a popular method for routing wires in VLSI circuits. It can also be applied to a variety of other problems, such as robot path planning. Although the algorithm is simpl...
详细信息
To enhance performance on shared memory multiprocessors, various techniques have been proposed to reduce the latency of memory accesses, including pipelining of accesses, out-of-order execution of accesses, and branch...
详细信息
暂无评论