The compensation of scale factor imposes significant computation overhead on the CORDIC algorithm. In this paper we present two algorithms and the corresponding architectures (one for both rotation and vectoring modes...
详细信息
The compensation of scale factor imposes significant computation overhead on the CORDIC algorithm. In this paper we present two algorithms and the corresponding architectures (one for both rotation and vectoring modes and the other only for rotation mode) to perform the scaling factor compensation in parallel with the classical CORDIC iterations. With these methods, the scale factor compensation overhead is reduced to a couple of iterations for any word length. The architectures presented have been optimized for conventional and redundant arithmetic.
We present a parallel bisection mesh refinement algorithm based on ALBERT (Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques). The goal is to develop a par...
详细信息
We present a parallel bisection mesh refinement algorithm based on ALBERT (Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques). The goal is to develop a parallel adaptive finite element code suitable for distributed memory parallel computers or PC clusters. An overview on the basic strategy for the parallelization of ALBERT is given. Issues on the parallel mesh refinement are addressed. A modified mesh refinement algorithm, which can be implemented efficiently on distributed memory parallel computers, is proposed and its properties are discussed. Numerical experiments with parallel bisection mesh refinement algorithm are shown.
This paper describes efficient deterministic techniques for breaking symmetry in parallel. These techniques work well on rooted trees and graphs of constant degree or genus. The primary technique allows us to 3-color ...
详细信息
This paper describes efficient deterministic techniques for breaking symmetry in parallel. These techniques work well on rooted trees and graphs of constant degree or genus. The primary technique allows us to 3-color a rooted tree in O(lg∗
We propose a parallel algorithm for dynamic slicing of distributed Java programs in non-Distributed Shared Memory (DSM) systems. Given a distributed Java program, we first construct an intermediate representation in t...
详细信息
In this paper results obtained from the parallelisation of existing 3D electromagnetic Finite Element codes within the ESPRIT HPCN project PARTEL are presented. The parallelisation procedure, based on the Bulk Synchro...
详细信息
In this paper results obtained from the parallelisation of existing 3D electromagnetic Finite Element codes within the ESPRIT HPCN project PARTEL are presented. The parallelisation procedure, based on the Bulk Synchronous parallel approach, is outlined and the encouraging results obtained in terms of speed-up on some industrially significant test cases are described and discussed.
The parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the un...
详细信息
ISBN:
(纸本)9781450384414
The parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used, the most powerful of which is the Concurrent Read Concurrent Write (CRCW) model. A PRAM algorithm describes a series of rounds, each of which consists of a collection of operations that can be executed concurrently within the same time step. However, the lack of support for concurrent memory accesses and the prevalence of asynchronous programming models led to the belief that implementing CRCW PRAM algorithms is unattainable and prompted many to avoid this model except for theoretical studies of optimal performance. In this work, we study the arbitrary and common concurrent writes in the CRCW PRAM model and explore implementation challenges on general-purpose systems. Moreover, we examine current practices for implementing common/arbitrary concurrent writes and propose a new efficient lightweight and thread-safe method to implement concurrent writes through leveraging atomic instructions. To demonstrate the efficacy of our method, we developed OpenMP kernels for classical CRCW PRAM algorithms and provide experimental results and comparisons based on run time performance measured over the x86 multicore architecture. Our results show a performance speedup compared to current practices up to 4.5x across all our benchmarks.
A method to schedule and program operations based on manufacture cells and use of parallel processing is presented in this paper. The factory is organized in cells with the aim of decomposing the global problem of sch...
详细信息
A method to schedule and program operations based on manufacture cells and use of parallel processing is presented in this paper. The factory is organized in cells with the aim of decomposing the global problem of scheduling in subproblems of reduced dimension. This decomposition allows a simplification of tasks related to the control and supervision of the factory. Besides, parallel processing enables faster computations and the use of the program in real time.
This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization of the workload of processors and a mec...
详细信息
This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization of the workload of processors and a mechanism of its adaptive folding/unfolding. The application is implemented and experimented with MARS in dedicated and non-dedicated environments. The results show that an absolute efficiency of 92% is possible on a cluster of DEC/ALPHA processors interconnected by a Gigaswitch network and an absolute efficiency of 67% can be obtained on an Ethernet network of SUN-Sparc4 workstations. Moreover, the adaptability of the algorithm is experimented on a non-dedicated meta-system including both the two parks of machines.
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log3n) time with n processors. The algorithms uses a divide and conquer approach and is based...
详细信息
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the idea of a one-way separator, which has the property that any directed path can be crossed only once.
New parallel orderings for a computation of the block singular value decomposition algorithm are developed. The orderings are of two types, and both of them reflect the requirements of hypercube topology. The first on...
详细信息
New parallel orderings for a computation of the block singular value decomposition algorithm are developed. The orderings are of two types, and both of them reflect the requirements of hypercube topology. The first one is represented by a scheme producing a class of orderings the number of which is equal to the number of processors in the hypercube. The second scheme yields an ordering where the exchange pattern is composed of permutations with parameter values that are powers of 2. The orderings can be considered optimal for this topology from the point of view of communication and exchange demands. Computational experiments performed on a hypercube multiprocessor iPSC-2 are also described.
暂无评论