Vector and parallel algorithms for Cholesky factorization on IBM 3090

No abstract is available for this paper.

• Publication year

  1989

• Venue

  Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89)

• Publication date

  1989-08-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/76263.76287
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• LAPACK Working Note #5 : Provisional Contents

  1988cited by this paper

• Architectural investigation of matrix data layout on multicore processors

  2014cites this paper
• High Productivity Programming of Dense Linear Algebra on Heterogeneous NUMA Architectures

  2013cites this paper
• Matrix computations on graphics processors and clusters of gpus

  2011cites this paper
• Application of dependence analysis and runtime data flow graph scheduling to matrix computations

  2010cites this paper
• Transforming linear algebra libraries: From abstraction to parallelism

  2010cites this paper
• Scheduling two-sided transformations using tile algorithms on multicore architectures

  2010cites this paper
• Scheduling dense linear algebra operations on multicore processors

  2010cites this paper
• Author ' s personal copy A class of parallel tiled linear algebra algorithms for multicore architectures

  2009cites this paper
• Programming matrix algorithms-by-blocks for thread-level parallelism

  2009cites this paper
• Scheduling Linear Algebra Operations on Multicore Processors –

  2009cites this paper
• Scheduling Two-sided Transformations using Algorithms-by-Tiles on Multicore Architectures LAPACK Working Note # 214

  2009cites this paper
• Distributed SBP Cholesky factorization algorithms with near-optimal scheduling

  2009cites this paper
• Benchmarking GPUs to tune dense linear algebra

  2008cites this paper
• LU, QR and Cholesky Factorizations using Vector Capabilities of GPUs

  2008cites this paper
• Scheduling of QR Factorization Algorithms on SMP and Multi-Core Architectures

  2008cites this paper
• A dependency-aware task-based programming environment for multi-core architectures

  2008cites this paper
• SuperMatrix: a multithreaded runtime scheduling system for algorithms-by-blocks

  2008cites this paper
• Programming Algorithms-by-Blocks for Matrix Computations on Multithreaded Architectures FLAME Working Note # 29

  2008influential citation
• A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures

  2007influential citation
• Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures

  2007cites this paper
• Design and Scheduling of an Algorithm-by-Blocks for the LU Factorization on Multithreaded Architectures FLAME Working Note # 26

  2007cites this paper
• Satisfying your dependencies with SuperMatrix

  2007cites this paper
• Implementing Linear Algebra Routines on Multi-core Processors with Pipelining and a Look Ahead

  2006cites this paper
• The uniform memory hierarchy model of computation

  2005cites this paper
• A cache‐efficient implementation of the lattice Boltzmann method for the two‐dimensional diffusion equation

  2004cites this paper
• Exploitation of control parallelism in data parallel algorithms

  1995cites this paper
• Ieee Transactions on Parallel and Distributed Systems 1 Solving Systems of Linear Equations on the Cell Processor Using Cholesky Factorization

  year unknowncites this paper