An embedded pipeline/parallel architecture to support an extended quad-tree algorithm suitable for real-time estimation of the dense disparity map (DDM) for stereoscopic image processing is proposed. the system perfor...
详细信息
ISBN:
(纸本)3540664432
An embedded pipeline/parallel architecture to support an extended quad-tree algorithm suitable for real-time estimation of the dense disparity map (DDM) for stereoscopic image processing is proposed. the system performance has been analyzed by several simulations to qualify the results by both an objective measurement (Mean Square Error) and a subjective assessment (output images). the proposed extended quad-tree is based on the block-matching algorithm, then a fine-grain granularity analysis to estimate the DDM leads us to a systolic array design for the basic Processor Element. this basic design has been utilized to the next levels quad-tree's Processor Elements design.
We report recent results pertaining to the magnetic, optical, electronic, superconducting, and topographic properties of electrochemically self-assembled quantum dots. these dots self-order into two-dimensional hexago...
详细信息
We report recent results pertaining to the magnetic, optical, electronic, superconducting, and topographic properties of electrochemically self-assembled quantum dots. these dots self-order into two-dimensional hexagonal-close-packed arrays that are among the most periodic reported so far, they have revealed interesting properties with potential applications in magnetics, electronics, non-linear optics and novel neural architectures for ultrafast computation and signal processing.
In this work we investigate how Distributed Shared Memory (DSM) architectures affect performance of or-parallel logic programming systems and how this performance approaches that of conventional C systems. Our work co...
详细信息
Large, sparse, unsymmetric systems of linear equations appear frequently in areas such as chemical engineering. One way of speeding up the solution of these linear systems is to solve them in parallel by reordering th...
详细信息
ISBN:
(纸本)3540664432
Large, sparse, unsymmetric systems of linear equations appear frequently in areas such as chemical engineering. One way of speeding up the solution of these linear systems is to solve them in parallel by reordering the unsymmetric matrix into a bordered block-diagonal (BBD) form. A multilevel ordering algorithm is presented in this paper. Numerical results of the algorithm are given to demonstrate that this algorithm gives better orderings than existing algorithms.
In this paper a message-passing parallel implementation of the solution of linear systems by means of the Neville elimination is described. this type of approach is especially suited to the case of totally positive li...
详细信息
ISBN:
(纸本)3540664432
In this paper a message-passing parallel implementation of the solution of linear systems by means of the Neville elimination is described. this type of approach is especially suited to the case of totally positive linear systems, which appears in different application fields. Standard data partitioning techniques, such as block row and block column schemes, are considered on three different topologies: ring, mesh and hypercube. the theoretical performance of the proposed parallelalgorithms, in terms of run time, speed-up and efficiency, is derived. Experimental results obtained on an IBM SP2 multicomputer confirm the high performance of the block row parallel algorithm.
As the technology for high-speed networks has incredibly evolved this last decade, the interconnection of workstations at gigabits rates and low prices has become a reality. these clusters, based on regulars workstati...
详细信息
ISBN:
(纸本)3540664432
As the technology for high-speed networks has incredibly evolved this last decade, the interconnection of workstations at gigabits rates and low prices has become a reality. these clusters, based on regulars workstations (e.g. PCs), can now be used in place of traditional parallel computers with no possible comparison on the prices! In this article, 3 applications (high performance computing, distributed shared memory system and parallel simulation) that were traditionally executed on expensive parallel machines are ported on a Myrinet-based cluster of PCs. the results show that the performances of these new architectures can be very close to those obtained on state-of-the art parallel computers.
In this paper, we describe new parallel cyclic wavefront algorithms for solving the semidefinite discrete-time Lyapunov equation for the Cholesky factor using Hammarling's method by the message passing paradigm. T...
详细信息
this paper presents a system to produce efficient implementations of parallel array-based algorithms from high-level specifications. It is structured as a transformation through a series of progressively more detailed...
详细信息
ISBN:
(纸本)3540664432
this paper presents a system to produce efficient implementations of parallel array-based algorithms from high-level specifications. It is structured as a transformation through a series of progressively more detailed representations. this allows the use of high-level programming features without losing the fine control of low-level languages. During the transformation process, parallel implementation decisions are introduced. Finally, a representation is reached which can be translated to C+MPI.
In this paper we describe a parallel Performance Estimator suitable for the comparative evaluation of parallelalgorithms. the Estimator is designed for SPMD programs written in either C or FORTRAN. Simulation is used...
详细信息
ISBN:
(纸本)3540664432
In this paper we describe a parallel Performance Estimator suitable for the comparative evaluation of parallelalgorithms. the Estimator is designed for SPMD programs written in either C or FORTRAN. Simulation is used to produce estimates of execution times for varying numbers of processors and to analyse the communication overheads. Results from the estimator are compared with actual results (obtained on a 16 processor IBM SP2 machine) for an Alternating Direction Implicit (ADI) solver of linear equations and for a parallel Sort by Regular Sampling (PSRS) sorting program. In both cases the plots of Execution Time versus Number of Processors are accurate to 20% and show all of the features of the equivalent plots of the measured data.
algorithms for finding the prime factors of large composite numbers are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factor...
详细信息
暂无评论