Results 1  10
of
42
Parallel Solution Of Sparse Linear Least Squares Problems On DistributedMemory Multiprocessors
"... This paper studies the solution of largescale sparse linear least squares problems on distributedmemory multiprocessors. The method of corrected seminormal equations is considered. New blockoriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmeti ..."
Abstract
 Add to MetaCart
This paper studies the solution of largescale sparse linear least squares problems on distributedmemory multiprocessors. The method of corrected seminormal equations is considered. New blockoriented parallel algorithms are developed for solving the related sparse triangular systems
Parallel triangular system solving on a mesh network of transputers
 SIAM J. Sci. Stat. Comput
, 1991
"... Abstract. A parallel algorithm is presented for triangular system solving on a distributedmemory MIMD computer with a square mesh topology. The algorithm is based on the square grid (scattered) distribution of matrix elements across the processors. The theoretical time complexity is 12/p qO(n), fo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. A parallel algorithm is presented for triangular system solving on a distributedmemory MIMD computer with a square mesh topology. The algorithm is based on the square grid (scattered) distribution of matrix elements across the processors. The theoretical time complexity is 12/p q
Image Template Matching on Distributed Memory and Vector Multiprocessors
, 1995
"... this paper we focus on the computational features that make this kind of loop structured codes suitable for parallel and vector machines. We found that a block distribution of the image and a replication of the template in every processor will produce a high efficiency in the parallel algorithm on d ..."
Abstract
 Add to MetaCart
on distributed memory systems, and in particular in systems with mesh interconnexion topology. On the other hand, we found that vectorization is a more efficient solution than spatial parallelization in order to increase the processing speed of this kind of codes due to the communication costs. The best solution
Sparse Block and Cyclic Data Distributions for Matrix Computations
 In High Performance Computing: Technology and Application. Grandinetti et al. (Eds.) Elsevier Science
, 1995
"... this paper we will concentrate on distributed memory mesh multiprocessors. Multiprocessor systems with mesh topology present a simple interconnection network that makes them attractive for massively parallel computation. An important number of real machines based on this architecture are currently a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
this paper we will concentrate on distributed memory mesh multiprocessors. Multiprocessor systems with mesh topology present a simple interconnection network that makes them attractive for massively parallel computation. An important number of real machines based on this architecture are currently
Interleaving Partitions of Systolic Algorithms for Programming Distributed Memory Multiprocessors
 Proceedings of the 2nd European Distributed Memory Computers Conference, SpringerVerlag (in this volume
, 1991
"... In this paper we present a systematic method for mapping systolizable problems onto Distributed Memory Multiprocessors. A systolizable problem is a problem for which it is possible to design a Systolic Algorithm. As a first stage, we design a Systolic Algorithm for the problem to be solved. Then, di ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
consisting in the design of a parallel algorithm to solve a triangular system of equations on a Distributed Memory Multiprocessor System with a ring topology. Some measurements of performance are presented for the case of a Transputerbased network. 1.
Finite Element Simulation Of Semiconductor Devices On Multiprocessor Computers
 Parallel Computing
, 1994
"... In this work we describe a methodology for solving the basic set of state stationary semiconductor device equations. We present a new iterative method for the solution using finite elements of the non linear Poisson equation and use a Conjugate Gradient type method for solving the non symmetric cont ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
continuity equations. The parallelization of this approach and its projection onto a multiprocessor system with a hypercube topology are carried out. We study the distribution of an irregular mesh of triangular elements over a hypercube and the later parallelization of the resolution method. Keywords
Parallel Implicit Adaptive Mesh Refinement Scheme for BodyFitted MultiBlock Mesh
, 2005
"... A parallel implicit adaptive mesh refinement (AMR) algorithm is described for the system of partialdifferential equations governing steady twodimensional compressible gaseous flows. The AMR algorithm uses an upwind finitevolume spatial discretization procedure in conjunction with limited linear s ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
lowerupper (BFILU) type preconditioners based on the Jacobian of the firstorder upwind scheme for each subdomain. The Schwarz preconditioning and blockbased data structure readily allow efficient and scalable parallel implementations of the implicit AMR approach on distributedmemory multiprocessor
A ProcessorTimeMinimal Systolic Array for Cubical Mesh Algorithms
"... Using a directed acyclic graph (dag) model of algorithms, the paper focuses on timeminimal multiprocessor schedules that use as few processors as possible. Such a processortimeminimal scheduling of an algorithm’s dag first is illustrated using a triangular shaped 2D directed mesh (representing, f ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
, for example, an algorithm for solving a triangular system of linear equations). Then, algorithms represented by an n × n × n directed mesh are investigated. This cubical directed mesh is fundamental; it represents the standard algorithm for computing matrix product as well as many other algorithms. Completion
Parallel Pivots LU Algorithm on the Cray T3E
, 1999
"... . Solving large nonsymmetric sparse linear systems on distributed memory multiprocessors is an active research area. We present a looplevel parallelized generic algorithm which comprises analysefactorize and solve stages. To further exploit matrix sparsity and parallelism, the analyse step looks f ..."
Abstract
 Add to MetaCart
. Solving large nonsymmetric sparse linear systems on distributed memory multiprocessors is an active research area. We present a looplevel parallelized generic algorithm which comprises analysefactorize and solve stages. To further exploit matrix sparsity and parallelism, the analyse step looks
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Results 1  10
of
42