invited workshop on compiler techniques for sparse tensor
play

Invited Workshop on Compiler Techniques for Sparse Tensor Algebra - PowerPoint PPT Presentation

Jan 22, 2024 •125 likes •427 views

Invited Workshop on Compiler Techniques for Sparse Tensor Algebra Cambridge MA, January 26th Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks Product Reviews QCD

  1. Invited Workshop on Compiler Techniques for Sparse Tensor Algebra Cambridge MA, January 26th

  2. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks Product Reviews QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci 2

  3. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks Product Reviews QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci 2

  4. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks Product Reviews QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci 2

  5. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks Product Reviews QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci Scalars have 0 dimensions Vectors have 1 dimension Matrices have 2 dimensions An n-tensor has n dimensions 2

  6. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci s d r … o W Poor Performance Amazing Peter Lilly Paul Users Billy Hilde Product Reviews Bob Sam Mary Monitor Sweater Laptop Candide Jacket The Iliad Kindle Dubliners … … Products 2

  7. Sparse Tensors are Everywhere Data Analytics Machine Learning Science and Engineering Movie ratings Convolutional Networks QCD Sparse Networks [GRK 2017] Social interactions Finite Element Method Graph Convolutional Network [KW 2017] Quantitative Trait Loci s d r … o W Poor Performance Amazing Peter Lilly Extremely sparse Paul Users Billy Dense storage: 107 Exabytes Hilde Sparse storage: 13 Gigabytes Product Reviews Bob Sam Mary Monitor Sweater Laptop Candide Jacket The Iliad Kindle Dubliners … … Products 2

  8. Too many tensor kernels for a fixed-function library 3

Recommend

Scalable Tensor Computations with Cyclops and Faster Algorithms for Alternating Least Squares

Scalable Tensor Computations with Cyclops and Faster Algorithms for Alternating Least Squares

Scalable Tensor Computations with Cyclops and Faster Algorithms for Alternating Least Squares Edgar Solomonik Department of Computer Science University of Illinois at Urbana-Champaign Invited Workshop on Compiler Techniques for Sparse Tensor

222 views • 9 slides
Some Design Considerations (and a Few Matrix Implementation Details) in PETSc, the Portable,

Some Design Considerations (and a Few Matrix Implementation Details) in PETSc, the Portable,

Some Design Considerations (and a Few Matrix Implementation Details) in PETSc, the Portable, Extensible Toolkit for Scientific Computation Richard Tran Mills Argonne National Laboratory Workshop on Compiler Techniques for Sparse Tensor Algebra

359 views • 19 slides
Tensor-Matrix Products with a Compressed Sparse Tensor Shaden Smith George Karypis University

Tensor-Matrix Products with a Compressed Sparse Tensor Shaden Smith George Karypis University

Tensor-Matrix Products with a Compressed Sparse Tensor Shaden Smith George Karypis University of Minnesota Department of Computer Science & Engineering shaden@cs.umn.edu Tensor-Matrix Products with a Compressed Sparse Tensor 1 / 47

1.09k views • 47 slides
A Sparse Tensor Format and a Benchmark Suite Jiajia Li Pacific Northwest National Laboratory

A Sparse Tensor Format and a Benchmark Suite Jiajia Li Pacific Northwest National Laboratory

A Sparse Tensor Format and a Benchmark Suite Jiajia Li Pacific Northwest National Laboratory January 25, 2019 @ MIT Figure sources: A brief survey of tensors by Berton Earnshaw and NVIDIA Tensor Cores HiCOO: Hierarchical Storage of Sparse

272 views • 23 slides
Sparse Tensor Factorization: Algorithms, Data Structures, and Challenges Shaden Smith &

Sparse Tensor Factorization: Algorithms, Data Structures, and Challenges Shaden Smith &

Sparse Tensor Factorization: Algorithms, Data Structures, and Challenges Shaden Smith & George Karypis University of Minnesota Department of Computer Science & Engineering shaden@cs.umn.edu Sparse Tensor Factorization: Algorithms,

844 views • 80 slides
A Medium-Grained Algorithm for Distributed Sparse Tensor Factorization Shaden Smith George

A Medium-Grained Algorithm for Distributed Sparse Tensor Factorization Shaden Smith George

A Medium-Grained Algorithm for Distributed Sparse Tensor Factorization Shaden Smith George Karypis University of Minnesota Department of Computer Science & Engineering shaden@cs.umn.edu Medium-Grained Sparse Tensor Factorization 1 / 24

424 views • 25 slides
Tensor learning approach to sparse QMC sampling of two-particle Greens function in DMFT

Tensor learning approach to sparse QMC sampling of two-particle Greens function in DMFT

Tensor learning approach to sparse QMC sampling of two-particle Greens function in DMFT Hiroshi SHINAOKA Collaborators N. Chikano, J. Otsuki, M. Ohzeki, K. Yoshimi, K. Haule, M. Wallerberger, J. Li, E. Gull, D. Geffroy, J. Kune Matsubara

337 views • 17 slides
Tensor Field Techniques Lecture 11 March 5, 2020 Outline Basics of tensor algebra Tensor

Tensor Field Techniques Lecture 11 March 5, 2020 Outline Basics of tensor algebra Tensor

CS53000 - Spring 2020 Introduction to Scientific Visualization Tensor Field Techniques Lecture 11 March 5, 2020 Outline Basics of tensor algebra Tensor glyphs Hyperstreamlines DTI visualization CS53000 / Spring 2020 : Introduction to

1.07k views • 84 slides
Tensor MUSIC in Multidimensional Sparse Arrays Chun-Lin Liu 1 and P . Vaidyanathan 2 . P Dept. of

Tensor MUSIC in Multidimensional Sparse Arrays Chun-Lin Liu 1 and P . Vaidyanathan 2 . P Dept. of

Tensor MUSIC in Multidimensional Sparse Arrays Chun-Lin Liu 1 and P . Vaidyanathan 2 . P Dept. of Electrical Engineering, MC 136-93 California Institute of Technology, Pasadena, CA 91125, USA cl.liu@caltech.edu 1 , ppvnath@systems.caltech.edu 2

523 views • 24 slides
Advanced Compiler Techniques 2004-03-19 08:51 Foundations of Dataflow Analysis This lecture is

Advanced Compiler Techniques 2004-03-19 08:51 Foundations of Dataflow Analysis This lecture is

Advanced Compiler Techniques 2004-03-19 08:51 Foundations of Dataflow Analysis This lecture is primarily based on Konstantinos Sagonas set of slides (Advanced ed Co Compiler er T Techniques es , (2AD518) at Uppsala University,

932 views • 25 slides
Sparse Tensor Factorization on Many-Core Processors with High-Bandwidth Memory Shaden Smith 1

Sparse Tensor Factorization on Many-Core Processors with High-Bandwidth Memory Shaden Smith 1

Sparse Tensor Factorization on Many-Core Processors with High-Bandwidth Memory Shaden Smith 1 , Jongsoo Park 2 , and George Karypis 1 1 Department of Computer Science & Engineering, University of Minnesota 2 Parallel Computing Lab, Intel

802 views • 37 slides
Algorithmic techniques for sparse graphs Z. Dvo rk Charles University, Prague Beroun 2011

Algorithmic techniques for sparse graphs Z. Dvo rk Charles University, Prague Beroun 2011

Algorithmic techniques for sparse graphs Z. Dvo rk Charles University, Prague Beroun 2011 Z. Dvo rk Algorithmic techniques for sparse graphs Goal Design efficient algorithms polynomial-time approximation FPT . . . for hard

463 views • 32 slides
(Some) Challenges in (Some) Challenges in Tensor Mining Tensor Mining Evrim Acar Sandia

(Some) Challenges in (Some) Challenges in Tensor Mining Tensor Mining Evrim Acar Sandia

(Some) Challenges in (Some) Challenges in Tensor Mining Tensor Mining Evrim Acar Sandia National Labs., Livermore, CA Tensor Mining Tensor Mining Parafac Parafac unsupervised unsupervised = + + X X E X X = + dense or sparse

340 views • 17 slides
Parallel Sparse Tensor Decomposition in Chapel Thomas B. Rolinger , Tyler A. Simon, Christopher

Parallel Sparse Tensor Decomposition in Chapel Thomas B. Rolinger , Tyler A. Simon, Christopher

Parallel Sparse Tensor Decomposition in Chapel Thomas B. Rolinger , Tyler A. Simon, Christopher D. Krieger IPDPSW 2018 CHIUW Outline 1. Motivation and Background 2. Porting SPLATT to Chapel 3. Performance Evaluation: Experiments,

855 views • 52 slides
Format Abstraction for Sparse Tensor Algebra Compilers Stephen Chou , Fredrik Kjolstad, and Saman

Format Abstraction for Sparse Tensor Algebra Compilers Stephen Chou , Fredrik Kjolstad, and Saman

Format Abstraction for Sparse Tensor Algebra Compilers Stephen Chou , Fredrik Kjolstad, and Saman Amarasinghe Sparse tensors are a natural way of representing real-world data 2 Sparse tensors are a natural way of representing real-world data 2

1.56k views • 134 slides
Low-Rank Tensor Techniques for High-Dimensional Problems Daniel Kressner CADMOS Chair for

Low-Rank Tensor Techniques for High-Dimensional Problems Daniel Kressner CADMOS Chair for

Low-Rank Tensor Techniques for High-Dimensional Problems Daniel Kressner CADMOS Chair for Numerical Algorithms and HPC MATHICSE, EPFL 1 Contents What is a tensor? Applications Matrices and low rank CP and Tucker

1.51k views • 121 slides
Future Directions In Tensor-Based Computation and Modeling February 20-21, 2009 Workshop Goal

Future Directions In Tensor-Based Computation and Modeling February 20-21, 2009 Workshop Goal

NSF Workshop Future Directions In Tensor-Based Computation and Modeling February 20-21, 2009 Workshop Goal Advise the NSF on how it can best support tensor-based computational thinking across the sciences and engineering. Tensor Methods

293 views • 13 slides
Subject Matter Compiler-based code improvement techniques > Sometimes called

Subject Matter Compiler-based code improvement techniques > Sometimes called

C OMP 512 This is C OMP 512 Advanced Compiler Construction Subject Matter Compiler-based code improvement techniques > Sometimes called optimization Analysis required to support them > No vector or multiprocessor

438 views • 20 slides
Virtual Machines & Interpretation Techniques Advanced Compiler Techniques 2004 Erik Stenman

Virtual Machines & Interpretation Techniques Advanced Compiler Techniques 2004 Erik Stenman

Virtual Machines & Interpretation Techniques Advanced Compiler Techniques 2004 Erik Stenman Partially based on slides from Kostis Sagonas (http://user.it.uu.se/~kostis/Teaching/KT2-04/) and Antero Taivalsaari

737 views • 57 slides
On the direct solution of very large sparse linear systems using out-of-core techniques Jennifer

On the direct solution of very large sparse linear systems using out-of-core techniques Jennifer

On the direct solution of very large sparse linear systems using out-of-core techniques Jennifer A. Scott (j.a.scott@rl.ac.uk) Joint work with John Reid Harrachov August 2007 p. 1/20 Sparse systems We are interested in solving Ax = b where

407 views • 30 slides
Diffusion Tensor Imaging Visualization Techniques and Applications Tim Peeters (t.peeters@tue,nl)

Diffusion Tensor Imaging Visualization Techniques and Applications Tim Peeters (t.peeters@tue,nl)

Diffusion Tensor Imaging Visualization Techniques and Applications Tim Peeters (t.peeters@tue,nl) - Anna Vilanova ( a.vilanova@tue.nl ) BioMedical Image Analysis ( bmia.bmt.tue.nl ) Eindhoven University of Technology,The Netherlands Overview

581 views • 27 slides
Generic Programming Techniques by the example of tensor contraction Patrick Seewald

Generic Programming Techniques by the example of tensor contraction Patrick Seewald

Generic Programming Techniques by the example of tensor contraction Patrick Seewald International Fortran Conference, University of Zurich, July 3, 2020 Department of Chemistry, University of Zurich 1 / 16 Background

488 views • 16 slides
Tensor For F , F Sh( X ) we have F F Sh( X ). Since tensor commutes with

Tensor For F , F Sh( X ) we have F F Sh( X ). Since tensor commutes with

Tensor For F , F Sh( X ) we have F F Sh( X ). Since tensor commutes with taking stalk, the non-exactness comes from that F x might not torsion-free, and this can be taken care by a simple resolution 0 P P F

1.85k views • 7 slides
SPLATT Efficient and Parallel Sparse Tensor-Matrix Multiplication Shaden Smith 1 Niranjay

SPLATT Efficient and Parallel Sparse Tensor-Matrix Multiplication Shaden Smith 1 Niranjay

SPLATT Efficient and Parallel Sparse Tensor-Matrix Multiplication Shaden Smith 1 Niranjay Ravindran Nicholas D. Sidiropoulos George Karypis University of Minnesota 1 shaden@cs.umn.edu Shaden Smith, shaden@cs.umn.edu (U. Minnesota) SPLATT 1

3.48k views • 24 slides

More recommend