Aspire Lab – UC Berkeley

Main menu

Skip to content
  • About
  • People
  • Publications
  • Projects
  • Sponsors
  • Agile HW Design Center
  • Open Source
  • Contact
  • Login




Tag Archives:

Communication Lower Bounds for Tensor Contraction Algorithms

Edgar Solomonik, James Demmel, Torsten Hoefler
ETH Zurich Technical report, Jan. 2015.
Tags: Algorithms, Lower Bounds, Technical Report

Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays | Part 1

Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, Katherine Yelick
Technical Report, May. 2013.
Tags: Algorithms, Arrays, Communication, Lower Bounds, Technical Report

Communication Optimal Parallel Multiplication of Sparse Random Matrices

Grey Ballard, Aydin Buluc, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo
Jul. 2013.
Tags: Algorithms, Communication, Lower Bounds, Matrix Multiplication

Tags

2D Accelerators Algorithms Architectures Arrays Big Data Bootstrapping C++ Cache Partitioning Cancer Careers Chisel Communication Computer Architecture CTF DIABLO Efficiency Energy FPGA GAP Gaussian Elimination Genomics GPU Hardware HLS Lower Bounds LU Matrix Multiplication Memory Multicore Oblivious Open Space OS Parallelism Parallel Reduction Performance PHANTOM Processors Python Research Centers RISC-V SEJITS Tall-Skinny QR Technical Report Test generation

  • Directions
  • Contact




  • Home
  • About
  • People
  • Publications
  • Projects
  • Sponsors
  • Open Source Software
  • Agile HW Design Center
  • Blog
  • Wiki
  • Internal
Copyright © 2025 Aspire