Krishna M. Kavi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Pranathi Vasireddy

> Home > Persons > Krishna M. Kavi

Publications

2023
[c76]
- view
  authority control:
- export record
  dblp key:
  - conf/memsys/VasireddyKWM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memsys/VasireddyKWM23
Pranathi Vasireddy, Krishna Kavi, Alex Weaver, Gayatri Mehta:
Streaming Sparse Data on Architectures with Vector Extensions using Near Data Processing. MEMSYS 2023: 16:1-16:12
2022
[c74]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/VasireddyKM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/VasireddyKM22
Pranathi Vasireddy, Krishna Kavi, Gayatri Mehta:
Sparse-T: Hardware Accelerator Thread for Unstructured Sparse Data Processing. ICCAD 2022: 78:1-78:8
[c73]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/AdavallyWVKMG22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/AdavallyWVKMG22
Shashank Adavally, Alex Weaver, Pranathi Vasireddy, Krishna Kavi, Gayatri Mehta, Nagendra Gulur:
HETEROGENEOUS ARCHITECTURE FOR SPARSE DATA PROCESSING. IPDPS Workshops 2022: 6-15
[c72]
- view
  authority control:
- export record
  dblp key:
  - conf/sbac-pad/WeaverKVM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sbac-pad/WeaverKVM22
Alex Weaver, Krishna Kavi, Pranathi Vasireddy, Gayatri Mehta:
Memory-Side Acceleration and Sparse Compression for Quantized Packed Convolutions. SBAC-PAD 2022: 81-90

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.