Sparse and Dense Matrix Classes and Methods

Total Page:16

File Type:pdf, Size:1020Kb

Sparse and Dense Matrix Classes and Methods Package ‘Matrix’ June 1, 2021 Version 1.3-4 Date 2021-05-24 Priority recommended Title Sparse and Dense Matrix Classes and Methods Contact Doug and Martin <[email protected]> Maintainer Martin Maechler <[email protected]> Description A rich hierarchy of matrix classes, including triangular, symmetric, and diagonal matrices, both dense and sparse and with pattern, logical and numeric entries. Numerous methods for and operations on these matrices, using 'LAPACK' and 'SuiteSparse' libraries. Depends R (>= 3.5.0) Imports methods, graphics, grid, stats, utils, lattice Suggests expm, MASS Enhances MatrixModels, graph, SparseM, sfsmisc, igraph, maptools, sp, spdep EnhancesNote line 2: for ``Rd xrefs'' Encoding UTF-8 LazyData no LazyDataNote not possible, since we use data/*.R *and* our classes BuildResaveData no License GPL (>= 2) | file LICENCE URL http://Matrix.R-forge.R-project.org/ BugReports https://r-forge.r-project.org/tracker/?group_id=61 NeedsCompilation yes Author Douglas Bates [aut], Martin Maechler [aut, cre] (<https://orcid.org/0000-0002-8685-9910>), Timothy A. Davis [ctb] (SuiteSparse and 'cs' C libraries, notably CHOLMOD, AMD; collaborators listed in dir(pattern = '^[A-Z]+[.]txt$', full.names=TRUE, system.file('doc', 1 2 R topics documented: 'SuiteSparse', package='Matrix'))), Jens Oehlschlägel [ctb] (initial nearPD()), Jason Riedy [ctb] (condest() and onenormest() for octave, Copyright: Regents of the University of California), R Core Team [ctb] (base R matrix implementation) Repository CRAN Date/Publication 2021-06-01 06:10:06 UTC R topics documented: abIndex-class . .4 abIseq . .6 all-methods . .7 all.equal-methods . .7 atomicVector-class . .8 band.............................................9 bandSparse . 10 bdiag . 12 BunchKaufman-methods . 14 CAex ............................................ 15 cBind . 16 CHMfactor-class . 17 chol ............................................. 20 chol2inv-methods . 22 Cholesky . 23 Cholesky-class . 26 colSums . 27 compMatrix-class . 29 condest . 30 CsparseMatrix-class . 32 ddenseMatrix-class . 33 ddiMatrix-class . 34 denseMatrix-class . 35 dgCMatrix-class . 36 dgeMatrix-class . 37 dgRMatrix-class . 38 dgTMatrix-class . 39 Diagonal . 41 diagonalMatrix-class . 42 diagU2N . 44 dMatrix-class . 45 dpoMatrix-class . 46 drop0 . 48 dsCMatrix-class . 49 dsparseMatrix-class . 51 dsRMatrix-class . 52 dsyMatrix-class . 53 R topics documented: 3 dtCMatrix-class . 54 dtpMatrix-class . 56 dtRMatrix-class . 58 dtrMatrix-class . 59 expand . 60 expm ............................................ 61 externalFormats . 62 facmul . 64 forceSymmetric . 65 formatSparseM . 66 generalMatrix-class . 67 graph-sparseMatrix . 68 Hilbert . 69 image-methods . 70 index-class . 72 indMatrix-class . 73 invPerm . 75 is.na-methods . 76 is.null.DN . 78 isSymmetric-methods . 79 isTriangular . 79 KhatriRao . 80 KNex ............................................ 82 kronecker-methods . 83 ldenseMatrix-class . 84 ldiMatrix-class . 85 lgeMatrix-class . 85 lsparseMatrix-classes . 86 lsyMatrix-class . 88 ltrMatrix-class . 89 lu .............................................. 90 LU-class . 93 mat2triplet . 94 Matrix . 95 Matrix-class . 97 matrix-products . 99 MatrixClass . 101 MatrixFactorization-class . 102 ndenseMatrix-class . 103 nearPD . 104 ngeMatrix-class . 107 nMatrix-class . 108 nnzero . 109 norm............................................. 111 nsparseMatrix-classes . 112 nsyMatrix-class . 114 ntrMatrix-class . 115 number-class . 116 4 abIndex-class pMatrix-class . 116 printSpMatrix . 119 qr-methods . 121 rankMatrix.
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]
  • Linpack Evaluation on a Supercomputer with Heterogeneous Accelerators
    Linpack Evaluation on a Supercomputer with Heterogeneous Accelerators Toshio Endo Akira Nukada Graduate School of Information Science and Engineering Global Scientific Information and Computing Center Tokyo Institute of Technology Tokyo Institute of Technology Tokyo, Japan Tokyo, Japan [email protected] [email protected] Satoshi Matsuoka Naoya Maruyama Global Scientific Information and Computing Center Global Scientific Information and Computing Center Tokyo Institute of Technology/National Institute of Informatics Tokyo Institute of Technology Tokyo, Japan Tokyo, Japan [email protected] [email protected] Abstract—We report Linpack benchmark results on the Roadrunner or other systems described above, it includes TSUBAME supercomputer, a large scale heterogeneous system two types of accelerators. This is due to incremental upgrade equipped with NVIDIA Tesla GPUs and ClearSpeed SIMD of the system, which has been the case in commodity CPU accelerators. With all of 10,480 Opteron cores, 640 Xeon cores, 648 ClearSpeed accelerators and 624 NVIDIA Tesla GPUs, clusters; they may have processors with different speeds as we have achieved 87.01TFlops, which is the third record as a result of incremental upgrade. In this paper, we present a heterogeneous system in the world. This paper describes a Linpack implementation and evaluation results on TSUB- careful tuning and load balancing method required to achieve AME with 10,480 Opteron cores, 624 Tesla GPUs and 648 this performance. On the other hand, since the peak speed is ClearSpeed accelerators. In the evaluation, we also used a 163 TFlops, the efficiency is 53%, which is lower than other systems.
    [Show full text]
  • Abstract 1 Introduction
    Implementation in ScaLAPACK of Divide-and-Conquer Algorithms for Banded and Tridiagonal Linear Systems A. Cleary Department of Computer Science University of Tennessee J. Dongarra Department of Computer Science University of Tennessee Mathematical Sciences Section Oak Ridge National Laboratory Abstract Described hereare the design and implementation of a family of algorithms for a variety of classes of narrow ly banded linear systems. The classes of matrices include symmetric and positive de - nite, nonsymmetric but diagonal ly dominant, and general nonsymmetric; and, al l these types are addressed for both general band and tridiagonal matrices. The family of algorithms captures the general avor of existing divide-and-conquer algorithms for banded matrices in that they have three distinct phases, the rst and last of which arecompletely paral lel, and the second of which is the par- al lel bottleneck. The algorithms have been modi ed so that they have the desirable property that they are the same mathematical ly as existing factorizations Cholesky, Gaussian elimination of suitably reordered matrices. This approach represents a departure in the nonsymmetric case from existing methods, but has the practical bene ts of a smal ler and more easily hand led reduced system. All codes implement a block odd-even reduction for the reduced system that al lows the algorithm to scale far better than existing codes that use variants of sequential solution methods for the reduced system. A cross section of results is displayed that supports the predicted performance results for the algo- rithms. Comparison with existing dense-type methods shows that for areas of the problem parameter space with low bandwidth and/or high number of processors, the family of algorithms described here is superior.
    [Show full text]
  • On Multigrid Methods for Solving Electromagnetic Scattering Problems
    On Multigrid Methods for Solving Electromagnetic Scattering Problems Dissertation zur Erlangung des akademischen Grades eines Doktor der Ingenieurwissenschaften (Dr.-Ing.) der Technischen Fakultat¨ der Christian-Albrechts-Universitat¨ zu Kiel vorgelegt von Simona Gheorghe 2005 1. Gutachter: Prof. Dr.-Ing. L. Klinkenbusch 2. Gutachter: Prof. Dr. U. van Rienen Datum der mundliche¨ Prufung:¨ 20. Jan. 2006 Contents 1 Introductory remarks 3 1.1 General introduction . 3 1.2 Maxwell’s equations . 6 1.3 Boundary conditions . 7 1.3.1 Sommerfeld’s radiation condition . 9 1.4 Scattering problem (Model Problem I) . 10 1.5 Discontinuity in a parallel-plate waveguide (Model Problem II) . 11 1.6 Absorbing-boundary conditions . 12 1.6.1 Global radiation conditions . 13 1.6.2 Local radiation conditions . 18 1.7 Summary . 19 2 Coupling of FEM-BEM 21 2.1 Introduction . 21 2.2 Finite element formulation . 21 2.2.1 Discretization . 26 2.3 Boundary-element formulation . 28 3 4 CONTENTS 2.4 Coupling . 32 3 Iterative solvers for sparse matrices 35 3.1 Introduction . 35 3.2 Classical iterative methods . 36 3.3 Krylov subspace methods . 37 3.3.1 General projection methods . 37 3.3.2 Krylov subspace methods . 39 3.4 Preconditioning . 40 3.4.1 Matrix-based preconditioners . 41 3.4.2 Operator-based preconditioners . 42 3.5 Multigrid . 43 3.5.1 Full Multigrid . 47 4 Numerical results 49 4.1 Coupling between FEM and local/global boundary conditions . 49 4.1.1 Model problem I . 50 4.1.2 Model problem II . 63 4.2 Multigrid . 64 4.2.1 Theoretical considerations regarding the classical multi- grid behavior in the case of an indefinite problem .
    [Show full text]
  • Periodic Staircase Matrices and Generalized Cluster Structures
    PERIODIC STAIRCASE MATRICES AND GENERALIZED CLUSTER STRUCTURES MISHA GEKHTMAN, MICHAEL SHAPIRO, AND ALEK VAINSHTEIN Abstract. As is well-known, cluster transformations in cluster structures of geometric type are often modeled on determinant identities, such as short Pl¨ucker relations, Desnanot–Jacobi identities and their generalizations. We present a construction that plays a similar role in a description of general- ized cluster transformations and discuss its applications to generalized clus- ter structures in GLn compatible with a certain subclass of Belavin–Drinfeld Poisson–Lie brackets, in the Drinfeld double of GLn, and in spaces of periodic difference operators. 1. Introduction Since the discovery of cluster algebras in [4], many important algebraic varieties were shown to support a cluster structure in a sense that the coordinate rings of such variety is isomorphic to a cluster algebra or an upper cluster algebra. Lie theory and representation theory turned out to be a particularly rich source of varieties of this sort including but in no way limited to such examples as Grassmannians [5, 18], double Bruhat cells [1] and strata in flag varieties [15]. In all these examples, cluster transformations that connect distinguished coordinate charts within a ring of regular functions are modeled on three-term relations such as short Pl¨ucker relations, Desnanot–Jacobi identities and their Lie-theoretic generalizations of the kind considered in [3]. This remains true even in the case of exotic cluster structures on GLn considered in [8, 10] where cluster transformations can be obtained by applying Desnanot–Jacobi type identities to certain structured matrices of a size far exceeding n.
    [Show full text]
  • Package 'Popbio'
    Package ‘popbio’ February 1, 2020 Version 2.7 Author Chris Stubben, Brook Milligan, Patrick Nantel Maintainer Chris Stubben <[email protected]> Title Construction and Analysis of Matrix Population Models License GPL-3 Encoding UTF-8 LazyData true Suggests quadprog Description Construct and analyze projection matrix models from a demography study of marked individu- als classified by age or stage. The package covers methods described in Matrix Population Mod- els by Caswell (2001) and Quantitative Conservation Biology by Morris and Doak (2002). RoxygenNote 6.1.1 NeedsCompilation no Repository CRAN Date/Publication 2020-02-01 20:10:02 UTC R topics documented: 01.Introduction . .3 02.Caswell . .3 03.Morris . .5 aq.census . .6 aq.matrix . .7 aq.trans . .8 betaval............................................9 boot.transitions . 11 calathea . 13 countCDFxt . 14 damping.ratio . 15 eigen.analysis . 16 elasticity . 18 1 2 R topics documented: extCDF . 19 fundamental.matrix . 20 generation.time . 21 grizzly . 22 head2 . 24 hudcorrs . 25 hudmxdef . 25 hudsonia . 26 hudvrs . 27 image2 . 28 Kendall . 29 lambda . 31 lnorms . 32 logi.hist.plot . 33 LTRE ............................................ 34 matplot2 . 37 matrix2 . 38 mean.list . 39 monkeyflower . 40 multiresultm . 42 nematode . 43 net.reproductive.rate . 44 pfister.plot . 45 pop.projection . 46 projection.matrix . 48 QPmat . 50 reproductive.value . 51 resample . 52 secder . 53 sensitivity . 55 splitA . 56 stable.stage . 57 stage.vector.plot . 58 stoch.growth.rate . 59 stoch.projection . 60 stoch.quasi.ext . 62 stoch.sens . 63 stretchbetaval . 64 teasel . 65 test.census . 66 tortoise . 67 var2 ............................................. 68 varEst . 69 vitalsens . 70 vitalsim . 71 whale . 74 woodpecker . 74 Index 76 01.Introduction 3 01.Introduction Introduction to the popbio Package Description Popbio is a package for the construction and analysis of matrix population models.
    [Show full text]
  • Arxiv:Math/0010243V1
    FOUR SHORT STORIES ABOUT TOEPLITZ MATRIX CALCULATIONS THOMAS STROHMER∗ Abstract. The stories told in this paper are dealing with the solution of finite, infinite, and biinfinite Toeplitz-type systems. A crucial role plays the off-diagonal decay behavior of Toeplitz matrices and their inverses. Classical results of Gelfand et al. on commutative Banach algebras yield a general characterization of this decay behavior. We then derive estimates for the approximate solution of (bi)infinite Toeplitz systems by the finite section method, showing that the approximation rate depends only on the decay of the entries of the Toeplitz matrix and its condition number. Furthermore, we give error estimates for the solution of doubly infinite convolution systems by finite circulant systems. Finally, some quantitative results on the construction of preconditioners via circulant embedding are derived, which allow to provide a theoretical explanation for numerical observations made by some researchers in connection with deconvolution problems. Key words. Toeplitz matrix, Laurent operator, decay of inverse matrix, preconditioner, circu- lant matrix, finite section method. AMS subject classifications. 65T10, 42A10, 65D10, 65F10 0. Introduction. Toeplitz-type equations arise in many applications in mathe- matics, signal processing, communications engineering, and statistics. The excellent surveys [4, 17] describe a number of applications and contain a vast list of references. The stories told in this paper are dealing with the (approximate) solution of biinfinite, infinite, and finite hermitian positive definite Toeplitz-type systems. We pay special attention to Toeplitz-type systems with certain decay properties in the sense that the entries of the matrix enjoy a certain decay rate off the diagonal.
    [Show full text]
  • CONSTRUCTING INTEGER MATRICES with INTEGER EIGENVALUES CHRISTOPHER TOWSE,∗ Scripps College
    Applied Probability Trust (25 March 2016) CONSTRUCTING INTEGER MATRICES WITH INTEGER EIGENVALUES CHRISTOPHER TOWSE,∗ Scripps College ERIC CAMPBELL,∗∗ Pomona College Abstract In spite of the proveable rarity of integer matrices with integer eigenvalues, they are commonly used as examples in introductory courses. We present a quick method for constructing such matrices starting with a given set of eigenvectors. The main feature of the method is an added level of flexibility in the choice of allowable eigenvalues. The method is also applicable to non-diagonalizable matrices, when given a basis of generalized eigenvectors. We have produced an online web tool that implements these constructions. Keywords: Integer matrices, Integer eigenvalues 2010 Mathematics Subject Classification: Primary 15A36; 15A18 Secondary 11C20 In this paper we will look at the problem of constructing a good problem. Most linear algebra and introductory ordinary differential equations classes include the topic of diagonalizing matrices: given a square matrix, finding its eigenvalues and constructing a basis of eigenvectors. In the instructional setting of such classes, concrete “toy" examples are helpful and perhaps even necessary (at least for most students). The examples that are typically given to students are, of course, integer-entry matrices with integer eigenvalues. Sometimes the eigenvalues are repeated with multipicity, sometimes they are all distinct. Oftentimes, the number 0 is avoided as an eigenvalue due to the degenerate cases it produces, particularly when the matrix in question comes from a linear system of differential equations. Yet in [10], Martin and Wong show that “Almost all integer matrices have no integer eigenvalues," let alone all integer eigenvalues.
    [Show full text]
  • Extremely Accurate Solutions Using Block Decomposition and Extended Precision for Solving Very Ill-Conditioned Equations
    Extremely accurate solutions using block decomposition and extended precision for solving very ill-conditioned equations †Kansa, E.J.1, Skala V.2, and Holoborodko, P.3 1Convergent Solutions, Livermore, CA 94550 USA 2Computer Science & Engineering Dept., Faculty of Applied Sciences, University of West Bohemia, University 8, CZ 301 00 Plzen, Czech Republic 3Advanpix LLC, Maison Takashima Bldg. 2F, Daimachi 10-15-201, Yokohama, Japan 221-0834 †Corresponding author: [email protected] Abstract Many authors have complained about the ill-conditioning associated the numerical solution of partial differential equations (PDEs) and integral equations (IEs) using as the continuously differentiable Gaussian and multiquadric continuously differentiable (C ) radial basis functions (RBFs). Unlike finite elements, finite difference, or finite volume methods that lave compact local support that give rise to sparse equations, the C -RBFs with simple collocation methods give rise to full, asymmetric systems of equations. Since C RBFs have adjustable constent or variable shape parameters, the resulting systems of equations that are solve on single or double precision computers can suffer from “ill-conditioning”. Condition numbers can be either the absolute or relative condition number, but in the context of linear equations, the absolute condition number will be understood. Results will be presented that demonstrates the combination of Block Gaussian elimination, arbitrary arithmetic precision, and iterative refinement can give remarkably accurate numerical salutations to large Hilbert and van der Monde equation systems. 1. Introduction An accurate definition of the condition number, , of the matrix, A, is the ratio of the largest to smallest absolute value of the singular values, { i}, obtained from the singular value decomposition (SVD) method, see [1]: (A) = maxjjminjj (1) This definition of condition number will be used in this study.
    [Show full text]
  • Workshop on Modern Applied Mathematics PK 2012 Kraków 23 — 24 November 2012
    Workshop on Modern Applied Mathematics PK 2012 Kraków 23 — 24 November 2012 Warsztaty z Nowoczesnej Matematyki i jej Zastosowań Kraków 23 — 24 listopada 2012 Kraków 23 — 24 November 2012 3 Contents 1 Introduction 5 1.1 Organizing Committee . 6 1.2 Scientific Committee . 6 2 List of Participants 7 3 Abstracts 11 3.1 On residually finite groups Orest D. Artemovych . 11 3.2 Some properties of Bernstein-Durrmeyer operators Magdalena Baczyńska . 12 3.3 Some Applications of Gröbner Bases Katarzyna Bolek . 14 3.4 Criteria for normality via C0-semigroups and moment sequences Dariusz Cichoń . 15 3.5 Picard–Fuchs operator for certain one parameter families of Calabi–Yau threefolds Sławomir Cynk . 16 3.6 Inference with Missing data Christiana Drake . 17 3.7 An outer measure on a commutative ring Dariusz Dudzik . 18 3.8 Resampling methods for weakly dependent sequences Elżbieta Gajecka-Mirek . 18 3.9 Graphs with path systems of length k in a hamiltonian cycle Grzegorz Gancarzewicz . 19 3.10 Hausdorff gaps and automorphisms of P(N)=fin Magdalena Grzech . 20 3.11 Functional Regression Models with Structured Penalties Jarosław Harezlak, Madan Kundu . 21 3.12 Approximation of function of two variables from exponential weight spaces Monika Herzog . 22 3.13 The existence of a weak solution of the semilinear first-order differential equation in a Banach space Mariusz Jużyniec . 25 3.14 Bayesian inference for cyclostationary time series Oskar Knapik . 26 4 Workshop on Modern Applied Mathematics PK 2012 3.15 Hausdorff limit in o-minimal structures Beata Kocel–Cynk . 27 3.16 Resampling methods for nonstationary time series Jacek Leśkow .
    [Show full text]
  • Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition Jean-Guillaume Dumas, Clement Pernet, Ziad Sultan
    Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition Jean-Guillaume Dumas, Clement Pernet, Ziad Sultan To cite this version: Jean-Guillaume Dumas, Clement Pernet, Ziad Sultan. Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition. Journal of Symbolic Computation, Elsevier, 2017, Special issue on ISSAC’15, 83, pp.187-210. 10.1016/j.jsc.2016.11.011. hal-01251223v1 HAL Id: hal-01251223 https://hal.archives-ouvertes.fr/hal-01251223v1 Submitted on 5 Jan 2016 (v1), last revised 14 May 2018 (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. Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition Jean-Guillaume Dumas Universit´eGrenoble Alpes, Laboratoire LJK, umr CNRS, BP53X, 51, av. des Math´ematiques, F38041 Grenoble, France Cl´ement Pernet Universit´eGrenoble Alpes, Laboratoire de l’Informatique du Parall´elisme, Universit´ede Lyon, France. Ziad Sultan Universit´eGrenoble Alpes, Laboratoire LJK and LIG, Inria, CNRS, Inovall´ee, 655, av. de l’Europe, F38334 St Ismier Cedex, France Abstract The row (resp. column) rank profile of a matrix describes the stair-case shape of its row (resp.
    [Show full text]
  • ARM HPC Ecosystem
    ARM HPC Ecosystem Darren Cepulis HPC Segment Manager ARM Business Segment Group HPC Forum, Santa Fe, NM 19th April 2017 © ARM 2017 ARM Collaboration for Exascale Programs United States Japan ARM is currently a participant in Fujitsu and RIKEN announced that the two Department of Energy funded Post-K system targeted at Exascale will pre-Exascale projects: Data be based on ARMv8 with new Scalable Movement Dominates and Fast Vector Extensions. Forward 2. European Union China Through FP7 and Horizon 2020, James Lin, vice director for the Center ARM has been involved in several of HPC at Shanghai Jiao Tong University funded pre-Exascale projects claims China will build three pre- including the Mont Blanc program Exascale prototypes to select the which deployed one of the first architecture for their Exascale system. ARM prototype HPC systems. The three prototypes are based on AMD, SunWei TaihuLight, and ARMv8. 2 © ARM 2017 ARM HPC deployments starting in 2H2017 Tw o recent announcements about ARM in HPC in Europe: 3 © ARM 2017 Japan Exascale slides from Fujitsu at ISC’16 4 © ARM 2017 Foundational SW Ecosystem for HPC . Linux OS’s – RedHat, SUSE, CENTOS, UBUNTU,… Commercial . Compilers – ARM, GNU, LLVM,… . Libraries – ARM, OpenBLAS, BLIS, ATLAS, FFTW… . Parallelism – OpenMP, OpenMPI, MVAPICH2,… . Debugging – Allinea, RW Totalview, GDB,… Open-source . Analysis – ARM, Allinea, HPCToolkit, TAU,… . Job schedulers – LSF, PBS Pro, SLURM,… . Cluster mgmt – Bright, CMU, warewulf,… Predictable Baseline 5 © ARM 2017 – now on ARM Functional Supported packages / components Areas OpenHPC defines a baseline. It is a community effort to Base OS RHEL/CentOS 7.1, SLES 12 provide a common, verified set of open source packages for Administrative Conman, Ganglia, Lmod, LosF, ORCM, Nagios, pdsh, HPC deployments Tools prun ARM’s participation: Provisioning Warewulf Resource Mgmt.
    [Show full text]