DOCSLIB.ORG

Communication Lower Bounds for Nested Bilinear Algorithms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Communication Lower Bounds for Nested Bilinear Algorithms Communication Lower Bounds for Nested Bilinear Algorithms Caleb Ju∗†, Yifan Zhang∗‡, Edgar Solomonik§ Abstract We develop lower bounds on communication in the memory hierarchy or between proces- sors for nested bilinear algorithms, such as Strassen's algorithm for matrix multiplication. We build on a previous framework that establishes communication lower bounds by use of the rank expansion, or the minimum rank of any fixed size subset of columns of a matrix, for each of the three matrices encoding the bilinear algorithm. This framework provides lower bounds for any way of computing a bilinear algorithm, which encompasses a larger space of algorithms than by fixing a particular dependency graph. Nested bilinear algorithms include fast recursive algorithms for convolution, matrix multiplication, and contraction of tensors with symmetry. Two bilinear algorithms can be nested by taking Kronecker products between their encoding matrices. Our main result is a lower bound on the rank expansion of a matrix constructed by a Kronecker product derived from lower bounds on the rank expansion of the Kronecker product's operands. To prove this bound, we map a subset of columns from a submatrix to a 2D grid, collapse them into a dense grid, expand the grid, and use the size of the expanded grid to bound the number of linearly independent columns of the submatrix. We apply the rank expansion lower bounds to obtain novel communication lower bounds for nested Toom-Cook convolution, Strassen's algorithm, and fast algorithms for partially symmetric contractions. 1 Introduction With the proliferation of massively parallel machines, the communication cost of an algorithm (i.e., data movement across the memory hierarchy or between processors) is and will continue to be orders of magnitudes larger than its arithmetic cost, both in time and energy. Therefore, it is imperative to design algorithms that minimize communication. Communication lower bounds provide a theoretical limit and guide the design of algorithms that minimize communication [1]. Hung and Kung initiated the study of communication lower bounds by modeling the com- putation as a directed acyclic dependency graph (dependency DAG), and representing the data arXiv:2107.09834v1 [cs.DC] 21 Jul 2021 access patterns via a red-blue pebble game [2]. Since then, new techniques have been developed to derive more lower bounds, such as volumetric inequalities for nested loop programs [3, 4, 5, 6] and analysis of expansion and separability of the dependency DAG [7, 8, 9]. These approaches derive closed form expressions lower bounds by considering a particular dependency DAG con- sisting of binary operations on scalar values. However, most algorithms admit algebraic reor- ganizations (i.e., computation of different partial sums) that change the dependency graph and ∗Equal contribution. Work was partially done while at the University of Illinois at Urbana-Champaign †School of Industrial and Systems Engineering, Georgia Institute of Technology, [email protected] ‡Oden Institute for Computational Engineering and Sciences, University of Texas at Austin, [email protected] §Department of Computer Science, University of Illinois at Urbana-Champaign, [email protected] 1 may be more communication efficient in a particular setting. By working with more abstract algorithm representations, a larger space of admissible dependency graphs can be considered simultaneously. Hypergraphs have been used to capture potential orderings of partial sums [10], while bilinear algorithms [11] provide a more powerful abstraction for problems which can be posed as bilinear maps on two input sets. Many important numerical problems fall under this category, including matrix multiplication, convolution, and symmetric tensor contractions, and all known fast algorithms for these problems can be expressed as bilinear algorithms. m ×R m ×R m ×R A bilinear algorithm (A; B; C) with A 2 C A , B 2 C B , and C 2 C C computes f(x; y) = C[(AT x) (BT y)], where is the Hadamard (element-wise or bilinear) product. The value R is called the rank of the bilinear algorithm. When a subset of columns from A, B, or C is a low-rank matrix, then the communication costs can be reduced for executing this portion of the computation. To see why, let P consist of a subset of k different columns from an identity matrix of size R so that a portion of the bilinear algorithm associated with k of the R bilinear products is CP (AP )T x BP )T y. We see that rank(AP ), rank(BP ), and rank(CP ) bound the minimum number of linear combinations of inputs needed from x, y, and the amount of output information produced, respectively, in computing this portion of the bilinear algorithm. Lower bounds on the growth of this rank with k, i.e., the rank expansion, yield lower bounds for any execution DAG of the bilinear algorithm [12]. We focus on nested bilinear algorithms [11], which are bilinear algorithm constructed via Kronecker products of matrices encoding the two factor bilinear algorithms: (A1 ⊗ A2; B1 ⊗ B2; C1 ⊗ C2). This abstraction captures both recursive and higher-order methods for matrix multiplication, integer multiplication, convolution, tensor contractions, as well as other algo- rithms. We show in general the rank expansion for the matrices defining a nested bilinear algorithm is based on the rank expansion of its factors. We prove that for a certain class of rank expansion lower bounds σA and σB for A and B, respectively, there exists a rank expansion lower bound σC for C = A ⊗ B satisfying σC (k) 6 σA(kA)σB(kB), for some reals kA 2 [1; nA] and kB 2 [1; nB] with kAkB = k and nX = #cols(X). We state these results in Section 2 and provide the proofs in Section 6. In Section 4, we apply our framework towards fast algorithms for matrix multiplication, convolution, and partially symmetric tensor contractions. We obtain lower bounds on both vertical communication (communication in a two-level memory hierarchy) as well horizontal communication (communication between processors in a distributed-memory computer with a fully connected network). The latter bounds can be translated to the LogGP and BSP model [12]. Our lower bounds are all novel in that they consider a larger space of algorithms than previous works. We obtain the first communication lower bounds for nested symmetry preserving tensor contraction algorithms [13], lower bounds for multi-dimensional and recursive Toom-Cook (i.e., convolution) that are either novel or match previously known bounds [7], and lower bounds for Strassen's algorithm which are asymptotically lower than previous results [8]. See Table 1 for a comparison between previously known lower bounds and the lower bounds derived in this paper. 2 Algorithm Previous (V) Previous (H) This Paper (V) This Paper (H) nlog2(7) n2 nlog2(7) nlog3(7) Strassen's [8] [8] (4.3) (4.4) Hlog4(7)−1 plog7(4) Hlog2(3)−1 plog3(2) Recursive nlogk(2k−1) n [7] - Match Prev (4.6) (4.7) convolution Hlogk(2k−1)−1 plog2k−1(k) Table 1: Asymptotic, non-trivial (not reading inputs or writing outputs) communication lower bounds between fast memory of size H and slow memory (i.e., vertical, denoted by V) as well as between p processors (i.e., horizontal, denoted by H). The two algorithms are Strassen's fast matrix multiplication and nested Toom-k for 1D convolution. A dash indicates no previous lower bound is known, to the best of our knowledge. 2 Notation and Definitions We will denote N = f1; 2;:::g to be the natural numbers. For any n 2 N, we write [n] = f1; 2; : : : ; ng. We now introduce the main tool to quantify communication lower bounds. Let (k) Pn be the set of matrices comprised of k different columns from an identity matrix of size n. We write f(x) /+ g(x) if there exists c > 0 such that f(x) = c · g(x). m×n Definition 2.1. The rank expansion of A 2 C ,σ ~ : f0g [ [n] 7! f0g [ N, is defined as σ~(k) = min rank(AP ) . (k) P 2Pn To obtain communication lower bounds for bilinear algorithms, we seek to lower boundσ ~ by a continuous increasing function σ. m×n Definition 2.2. A lower bound on the rank expansionσ ~ for A 2 C is a continuous and increasing function σ : R+ 7! R+ with σ(k) 6 σ~(k) for all k 2 [n] and σ(0) = 0. We denote the y y pseudo-inverse of function σ as σ : [0; +1) 7! [0; +1], σ (x) = sup fk : σ(k) 6 xg. 3 Lower Bounds for Rank Expansion of Kronecker Product Ma- trices In this section, we show how to construct a rank expansion lower bound σC for C = A ⊗ B when given the rank expansion lower bounds σA and σB for A and B, respectively. We can reduce the search for a continuous increasing function σC to solving an optimization problem. If we put further assumptions on σA and σB, we can simplify the optimization problem and derive closed-form expressions for σC . More precisely, we prove the following theorem in Section 6. m ×n Theorem 3.1. Suppose σA and σB are concave rank expansions lower bounds for A 2 C A A mB ×nB y y and B 2 C , respectively. Let dA = σA(1), dB = σB(1). Then σC : [1; nAnB] 7! R, σC (k) = min fσA(k=dB); σB(k=dA)g (1) is a concave rank expansion lower bound for C = A ⊗ B. 3 mi×ni Corollary 3.2. Let σi be a rank expansion lower bound of Ai 2 R , 1 6 i 6 p, and let Np Q A = i=1 Ai. If σi are concave, then σA : [1; i ni] 7! R, ( !) k σA(k) = min σj Q (2) j i6=j di y qi is a concave rank expansion lower bound of A, where di = σi (1).
Load more

Recommended publications
  • Fast Matrix Multiplication
    Fast matrix multiplication Yuval Filmus May 3, 2017 1 Problem statement How fast can we multiply two square matrices? To make this problem precise, we need to fix a computational model. The model that we use is the unit cost arithmetic model. In this model, a program is a sequence of instructions, each of which is of one of the following forms: 1. Load input: tn xi, where xi is one of the inputs. 2. Load constant: tn c, where c 2 R. 3. Arithmetic operation: tn ti ◦ tj, where i; j < n, and ◦ 2 f+; −; ·; =g. In all cases, n is the number of the instruction. We will say that an arithmetic program computes the product of two n × n matrices if: 1. Its inputs are xij; yij for 1 ≤ i; j ≤ n. 2. For each 1 ≤ i; k ≤ n there is a variable tm whose value is always equal to n X xijyjk: j=1 3. The program never divides by zero. The cost of multiplying two n × n matrices is the minimum length of an arithmetic program that computes the product of two n × n matrices. Here is an example. The following program computes the product of two 1 × 1 matrices: t1 x11 t2 y11 t3 t1 · t2 The variable t3 contains x11y11, and so satisfies the second requirement above for (i; k) = (1; 1). This shows that the cost of multiplying two 1 × 1 matrices is at most 3. Usually we will not spell out all steps of an arithmetic program, and use simple shortcuts, such as the ones indicated by the following program for multiplying two 2 × 2 matrices: z11 x11y11 + x12y21 z12 x11y12 + x12y22 z21 x21y11 + x22y21 z22 x21y12 + x22y22 1 When spelled out, this program uses 20 instructions: 8 load instructions, 8 product instructions, and 4 addition instructions.
    [Show full text]
  • Efficient Matrix Multiplication on Simd Computers* P
    SIAM J. MATRIX ANAL. APPL. () 1992 Society for Industrial and Applied Mathematics Vol. 13, No. 1, pp. 386-401, January 1992 025 EFFICIENT MATRIX MULTIPLICATION ON SIMD COMPUTERS* P. BJORSTADt, F. MANNEr, T. SOI:tEVIK, AND M. VAJTERIC?$ Dedicated to Gene H. Golub on the occasion of his 60th birthday Abstract. Efficient algorithms are described for matrix multiplication on SIMD computers. SIMD implementations of Winograd's algorithm are considered in the case where additions are faster than multiplications. Classical kernels and the use of Strassen's algorithm are also considered. Actual performance figures using the MasPar family of SIMD computers are presented and discussed. Key words, matrix multiplication, Winograd's algorithm, Strassen's algorithm, SIMD com- puter, parallel computing AMS(MOS) subject classifications. 15-04, 65-04, 65F05, 65F30, 65F35, 68-04 1. Introduction. One of the basic computational kernels in many linear algebra codes is the multiplication of two matrices. It has been realized that most problems in computational linear algebra can be expressed in block algorithms and that matrix multiplication is the most important kernel in such a framework. This approach is essential in order to achieve good performance on computer systems having a hier- archical memory organization. Currently, computer technology is strongly directed towards this design, due to the imbalance between the rapid advancement in processor speed relative to the much slower progress towards large, inexpensive, fast memories. This algorithmic development is highlighted by Golub and Van Loan [13], where the formulation of block algorithms is an integrated part of the text. The rapid devel- opment within the field of parallel computing and the increased need for cache and multilevel memory systems are indeed well reflected in the changes from the first to the second edition of this excellent text and reference book.
    [Show full text]
  • Matrix Multiplication: a Study Kristi Stefa Introduction
    Matrix Multiplication: A Study Kristi Stefa Introduction Task is to handle matrix multiplication in an efficient way, namely for large sizes Want to measure how parallelism can be used to improve performance while keeping accuracy Also need for improvement on “normal” multiplication algorithm O(n3) for conventional square matrices of n x n size Strassen Algorithm Introduction of a different algorithm, one where work is done on submatrices Requirement of matrix being square and size n = 2k Uses A and B matrices to construct 7 factors to solve C matrix Complexity from 8 multiplications to 7 + additions: O(nlog27) or n2.80 Room for parallelism TBB:parallel_for is the perfect candidate for both the conventional algorithm and the Strassen algorithm Utilization in ranges of 1D and 3D to sweep a vector or a matrix TBB: parallel_reduce would be possible but would increase the complexity of usage Would be used in tandem with a 2D range for the task of multiplication Test Setup and Use Cases The input images were converted to binary by Matlab and the test filter (“B” matrix) was generated in Matlab and on the board Cases were 128x128, 256x256, 512x512, 1024x1024 Matlab filter was designed for element-wise multiplication and board code generated for proper matrix-wise filter Results were verified by Matlab and an import of the .bof file Test setup (contd) Pictured to the right are the results for the small (128x128) case and a printout for the 256x256 case Filter degrades the image horizontally and successful implementation produces
    [Show full text]
  • The Strassen Algorithm and Its Computational Complexity
    Utrecht University BSc Mathematics & Applications The Strassen Algorithm and its Computational Complexity Rein Bressers Supervised by: Dr. T. van Leeuwen June 5, 2020 Abstract Due to the many computational applications of matrix multiplication, research into efficient algorithms for multiplying matrices can lead to widespread improvements of performance. In this thesis, we will first make the reader familiar with a universal measure of the efficiency of an algorithm, its computational complexity. We will then examine the Strassen algorithm, an algorithm that improves on the computational complexity of the conventional method for matrix multiplication. To illustrate the impact of this difference in complexity, we implement and test both algorithms, and compare their runtimes. Our results show that while Strassen’s method improves on the theoretical complexity of matrix multiplication, there are a number of practical considerations that need to be addressed for this to actually result in improvements on runtime. 2 Contents 1 Introduction 4 1.1 Computational complexity .................................................................................. 4 1.2 Structure ........................................................................................................... 4 2 Computational Complexity ................................................................ 5 2.1 Time complexity ................................................................................................ 5 2.2 Determining an algorithm’s complexity ..............................................................
    [Show full text]
  • Using Machine Learning to Improve Dense and Sparse Matrix Multiplication Kernels
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2019 Using machine learning to improve dense and sparse matrix multiplication kernels Brandon Groth Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Applied Mathematics Commons, and the Computer Sciences Commons Recommended Citation Groth, Brandon, "Using machine learning to improve dense and sparse matrix multiplication kernels" (2019). Graduate Theses and Dissertations. 17688. https://lib.dr.iastate.edu/etd/17688 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Using machine learning to improve dense and sparse matrix multiplication kernels by Brandon Micheal Groth A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Applied Mathematics Program of Study Committee: Glenn R. Luecke, Major Professor James Rossmanith Zhijun Wu Jin Tian Kris De Brabanter The student author, whose presentation of the scholarship herein was approved by the program of study committee, is solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2019 Copyright c Brandon Micheal Groth, 2019. All rights reserved. ii DEDICATION I would like to dedicate this thesis to my wife Maria and our puppy Tiger.
    [Show full text]
  • Divide-And-Conquer Algorithms
    Chapter 2 Divide-and-conquer algorithms The divide-and-conquer strategy solves a problem by: 1. Breaking it into subproblems that are themselves smaller instances of the same type of problem 2. Recursively solving these subproblems 3. Appropriately combining their answers The real work is done piecemeal, in three different places: in the partitioning of problems into subproblems; at the very tail end of the recursion, when the subproblems are so small that they are solved outright; and in the gluing together of partial answers. These are held together and coordinated by the algorithm's core recursive structure. As an introductory example, we'll see how this technique yields a new algorithm for multi- plying numbers, one that is much more efficient than the method we all learned in elementary school! 2.1 Multiplication The mathematician Carl Friedrich Gauss (1777–1855) once noticed that although the product of two complex numbers (a + bi)(c + di) = ac bd + (bc + ad)i − seems to involve four real-number multiplications, it can in fact be done with just three: ac, bd, and (a + b)(c + d), since bc + ad = (a + b)(c + d) ac bd: − − In our big-O way of thinking, reducing the number of multiplications from four to three seems wasted ingenuity. But this modest improvement becomes very significant when applied recur- sively. 55 56 Algorithms Let's move away from complex numbers and see how this helps with regular multiplica- tion. Suppose x and y are two n-bit integers, and assume for convenience that n is a power of 2 (the more general case is hardly any different).
    [Show full text]
  • Algebraic Elimination of Epsilon-Transitions Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte
    Algebraic Elimination of epsilon-transitions Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte To cite this version: Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte. Algebraic Elimination of epsilon-transitions. 2004. hal-00001038v1 HAL Id: hal-00001038 https://hal.archives-ouvertes.fr/hal-00001038v1 Preprint submitted on 15 Jan 2004 (v1), last revised 13 Dec 2004 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Algebraic elimination of ε-transitions G´erard Duchamp, Hatem Hadj Kacem, Eric´ Laugerotte∗ LIFAR, Facult´edes Sciences et des Techniques, 76821 Mont-Saint-Aignan Cedex, France. Abstract We present here algebraic formulas associating a k-automaton to a k-ε-automaton. The existence depends on the definition of the star of matrices and of elements in the semiring k. For this reason, we present the theorem which allows the transformation of k-ε-automata into k-automata. The two automata have the same behaviour. Keywords : Automata with multiplicities, ε-transitions, behaviour, star of matri- ces. 1 Introduction Automata with multiplicities (or weighted automata) are a versatile class of transition systems which can modelize as well classical (boolean), stochas- tic, transducer automata and be applied to various purposes such as image compression, speech recognition, formal linguistic (and automatic treatment of natural languages too) and probabilistic modelling.
    [Show full text]
  • Implementing Strassen's Algorithm with BLIS
    Implementing Strassen's Algorithm with BLIS FLAME Working Note # 79 Jianyu Huang∗ Tyler M. Smith∗y Greg M. Henryz Robert A. van de Geijn∗y April 16, 2016 Abstract We dispel with \street wisdom" regarding the practical implementation of Strassen's algorithm for matrix-matrix multiplication (DGEMM). Conventional wisdom: it is only practical for very large ma- trices. Our implementation is practical for small matrices. Conventional wisdom: the matrices being multiplied should be relatively square. Our implementation is practical for rank-k updates, where k is relatively small (a shape of importance for libraries like LAPACK). Conventional wisdom: it inher- ently requires substantial workspace. Our implementation requires no workspace beyond buffers already incorporated into conventional high-performance DGEMM implementations. Conventional wisdom: a Strassen DGEMM interface must pass in workspace. Our implementation requires no such workspace and can be plug-compatible with the standard DGEMM interface. Conventional wisdom: it is hard to demonstrate speedup on multi-core architectures. Our implementation demonstrates speedup over TM 1 conventional DGEMM even on an Intel R Xeon Phi coprocessor utilizing 240 threads. We show how a distributed memory matrix-matrix multiplication also benefits from these advances. 1 Introduction Strassen's algorithm (Strassen) [1] for matrix-matrix multiplication (gemm) has fascinated theoreticians and practitioners alike since it was first published, in 1969. That paper demonstrated that multiplication of n × n matrices can be achieved in less than the O(n3) arithmetic operations required by a conventional formulation. It has led to many variants that improve upon this result [2, 3, 4, 5] as well as practical implementations [6, 7, 8, 9].
    [Show full text]
  • A Fast and Scalable Matrix Inversion Method in Apache Spark ICDCN’18,January4–7,2018,Varanasi,India
    SPIN: A Fast and Scalable Matrix Inversion Method in Apache Spark Chandan Misra Swastik Haldar Indian Institute of Technology Kharagpur Indian Institute of Technology Kharagpur West Bengal, India West Bengal, India [email protected] [email protected] Sourangshu Bhaacharya Soumya K. Ghosh Indian Institute of Technology Kharagpur Indian Institute of Technology Kharagpur West Bengal, India West Bengal, India [email protected] [email protected] ABSTRACT many of the workloads. In the big data era, many of these applica- e growth of big data in domains such as Earth Sciences, Social tions have to work on huge matrices, possibly stored over multiple Networks, Physical Sciences, etc. has lead to an immense need servers, and thus consuming huge amounts of computational re- for efficient and scalable linear algebra operations, e.g. Matrix in- sources for matrix inversion. Hence, designing efficient large scale version. Existing methods for efficient and distributed matrix in- distributed matrix inversion algorithms, is an important challenge. version using big data platforms rely on LU decomposition based Since its release in 2012, Spark [19] has been adopted as a dom- block-recursive algorithms. However, these algorithms are com- inant solution for scalable and fault-tolerant processing of huge plex and require a lot of side calculations, e.g. matrix multiplica- datasets in many applications, e.g., machine learning [11], graph tion, at various levels of recursion. In this paper, we propose a processing [7], climate science [12], social media analytics [2], etc. different scheme based on Strassen’s matrix inversion algorithm Spark has gained its popularity for its in-memory distributed data (mentioned in Strassen’s original paper in 1969), which uses far processing ability, which runs interactive and iterative applications fewer operations at each level of recursion.
    [Show full text]
  • 28 Matrix Operations
    28 Matrix Operations Operations on matrices are at the heart of scientific computing. Efficient algo- rithms for working with matrices are therefore of considerable practical interest. This chapter provides a brief introduction to matrix theory and matrix operations, emphasizing the problems of multiplying matrices and solving sets of simultaneous linear equations. After Section 28.1 introduces basic matrix concepts and notations, Section 28.2 presents Strassen’s surprising algorithm for multiplying two n n matrices in 2(nlg7) O(n2.81) time. Section 28.3 shows how to solve a set of× linear equations using LUP= decompositions. Then, Section 28.4 explores the close relationship be- tween the problem of multiplying matrices and the problem of inverting a matrix. Finally, Section 28.5 discusses the important class of symmetric positive-definite matrices and shows how they can be used to find a least-squares solution to an overdetermined set of linear equations. One important issue that arises in practice is numerical stability. Due to the limited precision of floating-point representations in actual computers, round-off errors in numerical computations may become amplified over the course of a com- putation, leading to incorrect results; such computations are numerically unstable. Although we shall briefly consider numerical stability on occasion, we do not fo- cus on it in this chapter. We refer the reader to the excellent book by Golub and Van Loan [125] for a thorough discussion of stability issues. 28.1 Properties of matrices In this section, we review some basic concepts of matrix theory and some fun- damental properties of matrices, focusing on those that will be needed in later sections.
    [Show full text]
  • Minimizing Communication in All-Pairs Shortest Paths
    2013 IEEE 27th International Symposium on Parallel & Distributed Processing Minimizing communication in all-pairs shortest paths Edgar Solomonik Aydın Buluç James Demmel Univ. of California, Berkeley Lawrence Berkeley Nat. Lab. Univ. of California, Berkeley Department of EECS Computational Research Division Department of EECS [email protected] [email protected] [email protected] Abstract— over the (min,+) semiring. Several theoretical improvements We consider distributed memory algorithms for the all-pairs have been made, resulting in subcubic algorithms for the shortest paths (APSP) problem. Scaling the APSP problem APSD problem. However, in practice, these algorithms are to high concurrencies requires both minimizing inter-processor communication as well as maximizing temporal data locality. typically not competitive with simpler cubic algorithms. The 2.5D APSP algorithm, which is based on the divide-and- Variants of the Floyd-Warshall algorithm are most suitable conquer paradigm, satisfies both of these requirements: it can for dense graphs. Johnson’s algorithm [26], which is based utilize any extra available memory to perform asymptotically less on repeated application of Dijkstra’s single-source shortest communication, and it is rich in semiring matrix multiplications, path algorithm (SSSP), is theoretically faster than the Floyd- which have high temporal locality. We start by introducing a block-cyclic 2D (minimal memory) APSP algorithm. With Warshall variants on sufficiently sparse graphs. However, the a careful choice of block-size, this algorithm achieves known data dependency structure of this algorithm (and Dijkstra’s communication lower-bounds for latency and bandwidth. We algorithm in general) make scalable parallelization difficult. extend this 2D block-cyclic algorithm to a 2.5D algorithm, which SSSP algorithms based on Δ-stepping [32] scale better in can use c extra copies of data to reduce the bandwidth cost by a c1/2 practice but their performance is input dependent and scales factor of , compared to its 2D counterpart.
    [Show full text]
  • High-Performance Matrix Multiplication on Intel and FGPA
    Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment of the order would involve violation of copyright law. Please Note: The author retains the copyright while the New Jersey Institute of Technology reserves the right to distribute this thesis or dissertation Printing note: If you do not wish to print this page, then select “Pages from: first page # to: last page #” on the print dialog screen The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT graduates and faculty. ABSTRACT HIGH-PERFORMANCE MATRIX MULTIPLICATION ON INTEL AND FPGA PLATFORMS by Gang Li Matrix multiplication is at the core of high-performance numerical computation. Software methods of accelerating matrix multiplication fall into two categories. One is based on calculation simplification. The other one is based on increasing the memory access efficiency.
    [Show full text]