DOCSLIB.ORG

Chapter 1 an Improved Algorithm for Parallel Sparse LU Decomposition on a Distributed-Memory Multiprocessor

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 1 an Improved Algorithm for Parallel Sparse LU Decomposition on a Distributed-Memory Multiprocessor Chapter An Improved Algorithm for Parallel Sparse LU Decomp osition on a DistributedMemory Multipro cessor y Jacko Koster Rob H Bisseling Abstract In this pap er we present a new parallel algorithm for the LU decomp osition of a general sparse matrix Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the numb er of pivots pro duced Exp erimental results obtained on a network of transputers show that these features considerably improve the p erformance Intro duction This pap er presents an improved version of the parallel algorithm for the LU decomp osition of a general sparse matrix develop ed by van der Stapp en Bisseling and van de Vorst The LU decomp osition of a matrix A A i j n pro duces a unit lower ij triangular matrix L an upp er triangular matrix U a row p ermutation vector and a column p ermutation vector such that LU for i j n A ij i j We assume that A is sparse and nonsingular and that it has an arbitrary pattern of nonzeros with all elements having the same small probability of b eing nonzero A review of parallel algorithms for sparse LU decomp osition can b e found in We use the following notations A submatr ix of a matrix A is the intersection of several rows and columns of A The submatrix AI J I J f n g has domain I J If I fig we use Ai J as shorthand for Afig J The concurrent assignment op erator c d a b denotes the simultaneous assignment of a to c and b to d For any submatrix A nz A denotes the numb er of nonzeros in A For any set I jI j is the cardinality of I Our algorithm is aimed at a distributedmemory messagepassing MIMD multipro cessor with an M N mesh communication network We identify each pro cessor in the mesh with a pair s t s M t N A Cartesian distribution of A is a pair of mappings that assigns matrix element A to pro cessor with M ij i j i and N For pro cessor s t the set I s denotes the lo cal set of row indices j I s fi i I sg Similarly J t fj j J tg i j CERFACS Ave G Coriolis Toulouse Cedex France JackoKostercerfacsfr Part of this work was done while this author was employed at Eindhoven University of Technology y Department of Mathematics Utrecht University PO Box TA Utrecht the Netherlands bisselingmathruunl Part of this work was done while this author was employed at KoninklijkeSh ell Lab oratorium Amsterdam Koster and Bisseling The PARPACKLU algorithm In this section we briey describ e the previous algorithm which we refer to as PARPACKLU This algorithm assigns the nonzero matrix elements to the pro cessors according to the grid distribution dened by i mo d M i mo d N for i n i i Each step of the algorithm consists of a pivot search row and column p ermutations and a multiplerank up date of the reduced matrix AI I At the b eginning of a step I fk n g where k is the numb er of pivots pro cessed so far The pivot search determines a set S of m pivots from the reduced matrix with the following three prop erties First each element i j from S satises the threshold criterion jA j u max jA j ij lj lI where u is a userdened parameter u Ch This ensures numerical stability Second the elements of S have low Markowitz cost to preserve sparsity The Markowitz cost of a nonzero element A in a submatrix AI J equals nz AI j nz Ai J ij Third the elements of S are mutually compatible ie A for i j i j S i j i j A i j ij The compatibility of the pivots enables the algorithm to pro cess them in one step and to p erform a single rankm up date of the reduced matrix After the pivot search the rows and columns of the matrix are p ermuted such that the m m submatrix AI I I fk k m g turns into a diagonal submatrix with S S S the m pivots p ositioned on the diagonal This is followed by the rankm up date which contains the bulk of the oating p oint op erations In this part the set I is subtracted S from I each multiplier column j in AI I is divided by the corresp onding pivot value A S j j and the matrix pro duct AI I AI I is subtracted from AI I S S The new algorithm An outline of the new algorithm is given b elow a detailed description and a program text can b e found in Algorithm Parallel LU decomp osition I s J t fi i n sg fj j n tg i j L U k while k n do b egin nd pivot set S fi j k r k mg r r I J fi k r k mg fj k r k mg S S r r I s J t I s n I J t n J S S register pivots in and p erform multiplerank up date store multipliers in L and pivots and up date rows in U k k m rowredistributeA L colredistributeA U end rowp ermuteL colp ermuteU Improved Parallel Sparse LU Decomposition In the search for pivot candidates we vary the numb er ncol of matrix columns searched p er pro cessor column on the basis of the estimated density of the reduced matrix In the rst steps of the algorithm the reduced matrix is still sparse and the candidate pivots will most likely b e compatible and hence most of them will b ecome pivots As the computation pro ceeds llin causes the reduced matrix to b ecome gradually denser Consequently the probability of nonzero elements b eing compatible decreases and exp ensive searches for large sets of candidate pivots will yield only relatively few compatible pivots Therefore for higher densities of the reduced matrix we decrease ncol When the reduced matrix b ecomes so dense that the pivot search rep eatedly pro duces only one pivot the algorithm switches to a simple search for only one pivot The PARPACKLU algorithm distributes the work load by maintaining the grid distribution and p erforming explicit row and column p ermutations at every step Therefore it often requires the exchange of rows b etween pro cessor rows and similarly for columns b ecause many of the explicit p ermutations cannot b e p erformed lo cally This induces a certain amount of added communication time When implicit p ermutations are used the rows and columns of the matrix remain in place The matrix elements are addressed indirectly and no communication for row or column movements is required This however may lead to a p o or load balance dep ending on the sequence of pivot choices We distribute the load by redistributing the reduced matrix at regular intervals such that jJ tj dn k N e for all t and jI sj dn k M e for all s It suces to move columns from pro cessor columns t for which jJ tj dn k N e to pro cessor columns for which jJ tj dn k N e and similarly for the rows of the matrix The numb er of columns to b e sent left and right is determined using the criterion a column to b e disp osed of is sent in the direction that has the least average surplus p er pro cessor column The rst pro cessor column that has space available accepts a passing column This heuristic reduces the distance over which the rows and columns are communicated The column redistribution by pro cessor column t is done as follows Algorithm Column redistribution if redistribution needed then b egin ceiling dn k N e surplus jJ tj ceiling if surplus then determine n n such that n n surplus l r l r else n n l r redistribute n right r redistribute n left l end The theoretical analysis of shows that the unordered twodimensional doubly linked list is the b est lo cal data structure for parallel sparse LU decomp osition among several plausible candidates We use this data structure for the implementation of the new algorithm the previous algorithm was implemented using the ordered twodimensional singly linked list The present data structure facilitates insertion and deletion of nonzeros Exp erimental results The parallel computer used for our exp eriments and those of is a Parsytec Sup erCluster FT consisting of a square mesh of INMOS T transputers The new algorithm is implemented in ANSI C with extensions for communication and parallelism This Koster and Bisseling Table Time in s of LU decomposition on p processors using a static pivot search strategy Matrix p p p p p p p p IMPCOL B WEST FS STEAM SHL BP JPWH SHERMAN SHERMAN LNS GEMAT implementation allows us to use the parallel program also for exp eriments on an ordinary sequential computer We did not optimise the parallel program for these sequential runs The sequential exp eriments were p erformed on a SUN SPARC mo del workstation The test set of sparse matrices that we use for our exp eriments is taken from It consists of eleven unsymmetric matrices from the HarwellBo eing sparse matrix collection The user of the program has to sp ecify six input parameters The parameter ncol is the initial numb er of matrix columns that is searched for pivot candidates by each pro cessor column The parameter u is used for threshold criterion Pivot candidates with a Markowitz cost higher than M are discarded Here and are input parameters min and M is the lowest Markowitz cost of a pivot candidate After nl ast successive pivot min searches pro duce only one pivot a switch is made to a singlepivot strategy Each time a multiple of f pivots has b een pro cessed the matrix is redistributed First we rep eated the exp eriments from Table to compare the p erformance of the new algorithm to that of the PARPACKLU algorithm The standard static pivot search pro cedure in is most closely approximated by xing ncol and using u and nlast The matrix is redistributed at every step ie
Load more

Recommended publications
  • Recursive Approach in Sparse Matrix LU Factorization
    51 Recursive approach in sparse matrix LU factorization Jack Dongarra, Victor Eijkhout and the resulting matrix is often guaranteed to be positive Piotr Łuszczek∗ definite or close to it. However, when the linear sys- University of Tennessee, Department of Computer tem matrix is strongly unsymmetric or indefinite, as Science, Knoxville, TN 37996-3450, USA is the case with matrices originating from systems of Tel.: +865 974 8295; Fax: +865 974 8296 ordinary differential equations or the indefinite matri- ces arising from shift-invert techniques in eigenvalue methods, one has to revert to direct methods which are This paper describes a recursive method for the LU factoriza- the focus of this paper. tion of sparse matrices. The recursive formulation of com- In direct methods, Gaussian elimination with partial mon linear algebra codes has been proven very successful in pivoting is performed to find a solution of Eq. (1). Most dense matrix computations. An extension of the recursive commonly, the factored form of A is given by means technique for sparse matrices is presented. Performance re- L U P Q sults given here show that the recursive approach may per- of matrices , , and such that: form comparable to leading software packages for sparse ma- LU = PAQ, (2) trix factorization in terms of execution time, memory usage, and error estimates of the solution. where: – L is a lower triangular matrix with unitary diago- nal, 1. Introduction – U is an upper triangular matrix with arbitrary di- agonal, Typically, a system of linear equations has the form: – P and Q are row and column permutation matri- Ax = b, (1) ces, respectively (each row and column of these matrices contains single a non-zero entry which is A n n A ∈ n×n x where is by real matrix ( R ), and 1, and the following holds: PPT = QQT = I, b n b, x ∈ n and are -dimensional real vectors ( R ).
    [Show full text]
  • Lecture 5 - Triangular Factorizations & Operation Counts
    Lecture 5 - Triangular Factorizations & Operation Counts LU Factorization We have seen that the process of GE essentially factors a matrix A into LU. Now we want to see how this factorization allows us to solve linear systems and why in many cases it is the preferred algorithm compared with GE. Remember on paper, these methods are the same but computationally they can be different. First, suppose we want to solve A~x = ~b and we are given the factorization A = LU. It turns out that the system LU~x = ~b is \easy" to solve because we do a forward solve L~y = ~b and then back solve U~x = ~y. We have seen that we can easily implement the equations for the back solve and for homework you will write out the equations for the forward solve. Example If 0 2 −1 2 1 0 1 0 0 1 0 2 −1 2 1 A = @ 4 1 9 A = LU = @ 2 1 0 A @ 0 3 5 A 8 5 24 4 3 1 0 0 1 solve the linear system A~x = ~b where ~b = (0; −5; −16)T . ~ We first solve L~y = b to get y1 = 0, 2y1 +y2 = −5 implies y2 = −5 and 4y1 +3y2 +y3 = −16 T implies y3 = −1. Now we solve U~x = ~y = (0; −5; −1) . Back solving yields x3 = −1, 3x2 + 5x3 = −5 implies x2 = 0 and finally 2x1 − x2 + 2x3 = 0 implies x1 = 1 giving the solution (1; 0; −1)T . If GE and LU factorization are equivalent on paper, why would one be computationally advantageous in some settings? Recall that when we solve A~x = ~b by GE we must also multiply the right hand side by the Gauss transformation matrices.
    [Show full text]
  • LU Factorization LU Decomposition LU Decomposition: Motivation LU Decomposition
    LU Factorization LU Decomposition To further improve the efficiency of solving linear systems Factorizations of matrix A : LU and QR A matrix A can be decomposed into a lower triangular matrix L and upper triangular matrix U so that LU Factorization Methods: Using basic Gaussian Elimination (GE) A = LU ◦ Factorization of Tridiagonal Matrix ◦ LU decomposition is performed once; can be used to solve multiple Using Gaussian Elimination with pivoting ◦ right hand sides. Direct LU Factorization ◦ Similar to Gaussian elimination, care must be taken to avoid roundoff Factorizing Symmetrix Matrices (Cholesky Decomposition) ◦ errors (partial or full pivoting) Applications Special Cases: Banded matrices, Symmetric matrices. Analysis ITCS 4133/5133: Intro. to Numerical Methods 1 LU/QR Factorization ITCS 4133/5133: Intro. to Numerical Methods 2 LU/QR Factorization LU Decomposition: Motivation LU Decomposition Forward pass of Gaussian elimination results in the upper triangular ma- trix 1 u12 u13 u1n 0 1 u ··· u 23 ··· 2n U = 0 0 1 u3n . ···. 0 0 0 1 ··· We can determine a matrix L such that LU = A , and l11 0 0 0 l l 0 ··· 0 21 22 ··· L = l31 l32 l33 0 . ···. . l l l 1 n1 n2 n3 ··· ITCS 4133/5133: Intro. to Numerical Methods 3 LU/QR Factorization ITCS 4133/5133: Intro. to Numerical Methods 4 LU/QR Factorization LU Decomposition via Basic Gaussian Elimination LU Decomposition via Basic Gaussian Elimination: Algorithm ITCS 4133/5133: Intro. to Numerical Methods 5 LU/QR Factorization ITCS 4133/5133: Intro. to Numerical Methods 6 LU/QR Factorization LU Decomposition of Tridiagonal Matrix Banded Matrices Matrices that have non-zero elements close to the main diagonal Example: matrix with a bandwidth of 3 (or half band of 1) a11 a12 0 0 0 a21 a22 a23 0 0 0 a32 a33 a34 0 0 0 a43 a44 a45 0 0 0 a a 54 55 Efficiency: Reduced pivoting needed, as elements below bands are zero.
    [Show full text]
  • LU-Factorization 1 Introduction 2 Upper and Lower Triangular Matrices
    MAT067 University of California, Davis Winter 2007 LU-Factorization Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 12, 2007) 1 Introduction Given a system of linear equations, a complete reduction of the coefficient matrix to Reduced Row Echelon (RRE) form is far from the most efficient algorithm if one is only interested in finding a solution to the system. However, the Elementary Row Operations (EROs) that constitute such a reduction are themselves at the heart of many frequently used numerical (i.e., computer-calculated) applications of Linear Algebra. In the Sections that follow, we will see how EROs can be used to produce a so-called LU-factorization of a matrix into a product of two significantly simpler matrices. Unlike Diagonalization and the Polar Decomposition for Matrices that we’ve already encountered in this course, these LU Decompositions can be computed reasonably quickly for many matrices. LU-factorizations are also an important tool for solving linear systems of equations. You should note that the factorization of complicated objects into simpler components is an extremely common problem solving technique in mathematics. E.g., we will often factor a polynomial into several polynomials of lower degree, and one can similarly use the prime factorization for an integer in order to simply certain numerical computations. 2 Upper and Lower Triangular Matrices We begin by recalling the terminology for several special forms of matrices. n×n A square matrix A =(aij) ∈ F is called upper triangular if aij = 0 for each pair of integers i, j ∈{1,...,n} such that i>j. In other words, A has the form a11 a12 a13 ··· a1n 0 a22 a23 ··· a2n A = 00a33 ··· a3n .
    [Show full text]
  • LU, QR and Cholesky Factorizations Using Vector Capabilities of Gpus LAPACK Working Note 202 Vasily Volkov James W
    LU, QR and Cholesky Factorizations using Vector Capabilities of GPUs LAPACK Working Note 202 Vasily Volkov James W. Demmel Computer Science Division Computer Science Division and Department of Mathematics University of California at Berkeley University of California at Berkeley Abstract GeForce Quadro GeForce GeForce GPU name We present performance results for dense linear algebra using 8800GTX FX5600 8800GTS 8600GTS the 8-series NVIDIA GPUs. Our matrix-matrix multiply routine # of SIMD cores 16 16 12 4 (GEMM) runs 60% faster than the vendor implementation in CUBLAS 1.1 and approaches the peak of hardware capabilities. core clock, GHz 1.35 1.35 1.188 1.458 Our LU, QR and Cholesky factorizations achieve up to 80–90% peak Gflop/s 346 346 228 93.3 of the peak GEMM rate. Our parallel LU running on two GPUs peak Gflop/s/core 21.6 21.6 19.0 23.3 achieves up to ~300 Gflop/s. These results are accomplished by memory bus, MHz 900 800 800 1000 challenging the accepted view of the GPU architecture and memory bus, pins 384 384 320 128 programming guidelines. We argue that modern GPUs should be viewed as multithreaded multicore vector units. We exploit bandwidth, GB/s 86 77 64 32 blocking similarly to vector computers and heterogeneity of the memory size, MB 768 1535 640 256 system by computing both on GPU and CPU. This study flops:word 16 18 14 12 includes detailed benchmarking of the GPU memory system that Table 1: The list of the GPUs used in this study. Flops:word is the reveals sizes and latencies of caches and TLB.
    [Show full text]
  • LU and Cholesky Decompositions. J. Demmel, Chapter 2.7
    LU and Cholesky decompositions. J. Demmel, Chapter 2.7 1/14 Gaussian Elimination The Algorithm — Overview Solving Ax = b using Gaussian elimination. 1 Factorize A into A = PLU Permutation Unit lower triangular Non-singular upper triangular 2/14 Gaussian Elimination The Algorithm — Overview Solving Ax = b using Gaussian elimination. 1 Factorize A into A = PLU Permutation Unit lower triangular Non-singular upper triangular 2 Solve PLUx = b (for LUx) : − LUx = P 1b 3/14 Gaussian Elimination The Algorithm — Overview Solving Ax = b using Gaussian elimination. 1 Factorize A into A = PLU Permutation Unit lower triangular Non-singular upper triangular 2 Solve PLUx = b (for LUx) : − LUx = P 1b − 3 Solve LUx = P 1b (for Ux) by forward substitution: − − Ux = L 1(P 1b). 4/14 Gaussian Elimination The Algorithm — Overview Solving Ax = b using Gaussian elimination. 1 Factorize A into A = PLU Permutation Unit lower triangular Non-singular upper triangular 2 Solve PLUx = b (for LUx) : − LUx = P 1b − 3 Solve LUx = P 1b (for Ux) by forward substitution: − − Ux = L 1(P 1b). − − 4 Solve Ux = L 1(P 1b) by backward substitution: − − − x = U 1(L 1P 1b). 5/14 Example of LU factorization We factorize the following 2-by-2 matrix: 4 3 l 0 u u = 11 11 12 . (1) 6 3 l21 l22 0 u22 One way to find the LU decomposition of this simple matrix would be to simply solve the linear equations by inspection. Expanding the matrix multiplication gives l11 · u11 + 0 · 0 = 4, l11 · u12 + 0 · u22 = 3, (2) l21 · u11 + l22 · 0 = 6, l21 · u12 + l22 · u22 = 3.
    [Show full text]
  • Math 2270 - Lecture 27 : Calculating Determinants
    Math 2270 - Lecture 27 : Calculating Determinants Dylan Zwick Fall 2012 This lecture covers section 5.2 from the textbook. In the last lecture we stated and discovered a number of properties about determinants. However, we didn’t talk much about how to calculate them. In fact, the only general formula was the nasty formula mentioned at the beginning, namely n det(A)= sgn(σ) a . X Y iσ(i) σ∈Sn i=1 We also learned a formula for calculating the determinant in a very special case. Namely, if we have a triangular matrix, the determinant is just the product of the diagonals. Today, we’re going to discuss how that special triangular case can be used to calculate determinants in a very efficient manner, and we’ll derive the nasty formula. We’ll also go over one other way of calculating a deter- minnat, the “cofactor expansion”, that, to be honest, is not all that useful computationally, but can be very useful when you need to prove things. The assigned problems for this section are: Section 5.2 - 1, 3, 11, 15, 16 1 1 Calculating the Determinant from the Pivots In practice, the easiest way to calculate the determinant of a general matrix is to use elimination to get an upper-triangular matrix with the same de- terminant, and then just calculate the determinant of the upper-triangular matrix by taking the product of the diagonal terms, a.k.a. the pivots. If there are no row exchanges required for the LU decomposition of A, then A = LU, and det(A)= det(L)det(U).
    [Show full text]
  • LU Decomposition S = LU, Then We Can  1 0 0   2 4 −2   2 4 −2  Use It to Solve Sx = F
    LU-Decomposition Example 1 Compare with Example 1 in gaussian elimination.pdf. Consider I The Gaussian elimination for the solution of the linear system Sx = f transforms the augmented matrix (Sjf) into (Ujc), where U 0 2 4 −21 is upper triangular. The transformations are determined by the S = 4 9 −3 : (1) matrix S only. @ A If we have to solve a system Sx = f~ with a different right hand side −2 −3 7 f~, then we start over. Most of the computations that lead us from We express Gaussian Elimination using Matrix-Matrix-multiplications (Sjf~) into (Ujc~), depend only on S and are identical to the steps that we executed when we applied Gaussian elimination to Sx = f. 0 1 0 0 1 0 2 4 −2 1 0 2 4 −2 1 We now express Gaussian elimination as a sequence of matrix-matrix I @ −2 1 0 A @ 4 9 −3 A = @ 0 1 1 A multiplications. This representation leads to the decomposition of S 1 0 1 −2 −3 7 0 1 5 into a product of a lower triangular matrix L and an upper triangular | {z } | {z } | {z } matrix U, S = LU. This is known as the LU-Decomposition of S. =E1 =S =E1S I If we have computed the LU decomposition S = LU, then we can 0 1 0 0 1 0 2 4 −2 1 0 2 4 −2 1 use it to solve Sx = f. @ 0 1 0 A @ 0 1 1 A = @ 0 1 1 A I We replace S by LU, 0 −1 1 0 1 5 0 0 4 LUx = f; | {z } | {z } | {z } and introduce y = Ux.
    [Show full text]
  • Scalable Sparse Symbolic LU Factorization on Gpus
    JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 GSOFA: Scalable Sparse Symbolic LU Factorization on GPUs Anil Gaihre, Xiaoye Sherry Li and Hang Liu Abstract—Decomposing a matrix A into a lower matrix L and an upper matrix U, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the L and U factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of L and U matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This paper introduces GSOFA, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, GSOFA achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×.
    [Show full text]
  • LU, QR and Cholesky Factorizations Using Vector Capabilities of Gpus LAPACK Working Note 202 Vasily Volkov James W
    LU, QR and Cholesky Factorizations using Vector Capabilities of GPUs LAPACK Working Note 202 Vasily Volkov James W. Demmel Computer Science Division Computer Science Division and Department of Mathematics University of California at Berkeley University of California at Berkeley Abstract GeForce Quadro GeForce GeForce GPU name We present performance results for dense linear algebra using 8800GTX FX5600 8800GTS 8600GTS the 8-series NVIDIA GPUs. Our matrix-matrix multiply routine # of SIMD cores 16 16 12 4 (GEMM) runs 60% faster than the vendor implementation in CUBLAS 1.1 and approaches the peak of hardware capabilities. core clock, GHz 1.35 1.35 1.188 1.458 Our LU, QR and Cholesky factorizations achieve up to 80–90% peak Gflop/s 346 346 228 93.3 of the peak GEMM rate. Our parallel LU running on two GPUs peak Gflop/s/core 21.6 21.6 19.0 23.3 achieves up to ~300 Gflop/s. These results are accomplished by memory bus, MHz 900 800 800 1000 challenging the accepted view of the GPU architecture and memory bus, pins 384 384 320 128 programming guidelines. We argue that modern GPUs should be viewed as multithreaded multicore vector units. We exploit bandwidth, GB/s 86 77 64 32 blocking similarly to vector computers and heterogeneity of the memory size, MB 768 1535 640 256 system by computing both on GPU and CPU. This study flops:word 16 18 14 12 includes detailed benchmarking of the GPU memory system that Table 1: The list of the GPUs used in this study. Flops:word is the reveals sizes and latencies of caches and TLB.
    [Show full text]
  • Gaussian Elimination and Lu Decomposition (Supplement for Ma511)
    GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1. Matrix multiplication The rule for multiplying matrices is, at first glance, a little complicated. If A is m × n and B is n × p then C = AB is defined and of size m × p with entries n X cij = aikbkj k=1 The main reason for defining it this way will be explained when we talk about linear transformations later on. THEOREM 1.1. (1) Matrix multiplication is associative, i.e. A(BC) = (AB)C. (Henceforth, we will drop parentheses.) (2) If A is m × n and Im×m and In×n denote the identity matrices of the indicated sizes, AIn×n = Im×mA = A. (We usually just write I and the size is understood from context.) On the other hand, matrix multiplication is almost never commutative; in other words generally AB 6= BA when both are defined. So we have to be careful not to inadvertently use it in a calculation. Given an n × n matrix A, the inverse, if it exists, is another n × n matrix A−1 such that AA−I = I;A−1A = I A matrix is called invertible or nonsingular if A−1 exists. In practice, it is only necessary to check one of these. THEOREM 1.2. If B is n × n and AB = I or BA = I, then A invertible and B = A−1. Proof. The proof of invertibility of A will need to wait until we talk about deter- minants.
    [Show full text]
  • Effective GPU Strategies for LU Decomposition H
    Effective GPU Strategies for LU Decomposition H. M. D. M. Bandara* & D. N. Ranasinghe University of Colombo School of Computing, Sri Lanka [email protected], [email protected] Abstract— GPUs are becoming an attractive computing approaches, Section 5 shows the results and platform not only for traditional graphics computation performance studies obtained on our test environment but also for general-purpose computation because of the and then finally Section 6 concludes the paper. computational power, programmability and comparatively low cost of modern GPUs. This has lead to II. RELATED WORK a variety of complex GPGPU applications with significant performance improvements. The LU A few research works on LU decomposition with decomposition represents a fundamental step in many the support of highly parallel GPU environments have computationally intensive scientific applications and it is been carried out and had not been able to accelerate it often the costly step in the solution process because of the much. In [4] Ino et al. they have developed and impact of size of the matrix. In this paper we implement evaluated some implementation methods for LU three different variants of the LU decomposition algorithm on a Tesla C1060 and the most significant LU Decomposition in terms of (a) loop processing (b) decomposition that fits the highly parallel architecture of branch processing and (c) vector processing. In [5] modern GPUs is found to be Update through Column Gappalo et al. have reduced matrix decomposition and with shared memory access implementation. row operations to a series of rasterization problems on GPU. They have mapped the problem to GPU Keywords—LU decomposition, CUDA, GPGPU architecture based on the fact that fundamental I.
    [Show full text]