World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
9942
World Ranking
7477
National Ranking
3253

Research.com Recognitions

  • 2010 - ACM Gordon Bell Prize For "Petascale Direct Numerical Simulation of Blood Flow on 200K Cores and Heterogeneous Architectures"

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Programming language
  • Algorithm

His main research concerns Parallel computing, Sparse matrix, Sparse matrix-vector multiplication, Cache and Theoretical computer science. Specifically, his work in Parallel computing is concerned with the study of CUDA. His Sparse matrix study combines topics from a wide range of disciplines, such as Performance tuning, Statistical model, Artificial intelligence, Kernel and Code generation.

His research combines Multi-core processor and Sparse matrix-vector multiplication. His Cache research is multidisciplinary, relying on both Sparse approximation, Kernel and Solver. His studies deal with areas such as Perspective, Algorithm design, Word and Mathematical optimization as well as Theoretical computer science.

His most cited work include:

  • OSKI: A Library of Automatically Tuned Sparse Matrix Kernels (431 citations)
  • Optimization of sparse matrix-vector multiplication on emerging multicore platforms (350 citations)
  • Model-driven autotuning of sparse matrix-vector multiply on GPUs (345 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Parallel computing, Sparse matrix, Algorithm, Scalability and Theoretical computer science. His works in CUDA, Multi-core processor, Distributed memory, Cache and Speedup are all subjects of inquiry into Parallel computing. His study of Sparse matrix-vector multiplication is a part of Sparse matrix.

His Algorithm study incorporates themes from Block and Matrix multiplication. His research in Scalability intersects with topics in Structure, Supercomputer and Set. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Graph and Compiler.

He most often published in these fields:

  • Parallel computing (44.90%)
  • Sparse matrix (17.01%)
  • Algorithm (16.33%)

What were the highlights of his more recent work (between 2016-2021)?

  • Parallel computing (44.90%)
  • Scalability (16.33%)
  • Speedup (8.16%)

In recent papers he was focusing on the following fields of study:

Richard Vuduc spends much of his time researching Parallel computing, Scalability, Speedup, Computation and Algorithm. His research investigates the link between Parallel computing and topics such as Kernel that cross with problems in Symmetric matrix and Kernel. Richard Vuduc interconnects Sparse matrix, Theoretical computer science, Set and Artificial intelligence in the investigation of issues within Scalability.

His Sparse matrix research includes elements of Structure, Machine learning and Spartan. His Computation study also includes

  • Implementation together with Computer architecture, Petascale computing and Software portability,
  • Computer engineering which connect with Memory hierarchy. His Algorithm research integrates issues from Object, Data structure, LU decomposition and Planar graph.

Between 2016 and 2021, his most popular works were:

  • HiCOO: hierarchical storage of sparse tensors (41 citations)
  • Model-Driven Sparse CP Decomposition for Higher-Order Tensors (38 citations)
  • Autotuning in High-Performance Computing Applications (37 citations)

In his most recent research, the most cited papers focused on:

  • Operating system
  • Programming language
  • Algorithm

Richard Vuduc mostly deals with Speedup, Parallel computing, Sparse matrix, Scalability and Matrix decomposition. His Speedup research incorporates elements of Kernel ridge regression, Algorithm, Training time and Shared memory. His work in Algorithm addresses subjects such as Locality of reference, which are connected to disciplines such as Computation.

His study in the fields of Degree of parallelism under the domain of Parallel computing overlaps with other disciplines such as Tensor representation. His study in the field of Scalable algorithms is also linked to topics like Scaling. He has researched Matrix decomposition in several fields, including Representation, Theoretical computer science and Computational science.

Best Publications

  • Optimization of sparse matrix-vector multiplication on emerging multicore platforms

    Samuel Williams;Leonid Oliker;Richard Vuduc;John Shalf

  • Optimization of sparse matrix-vector multiplication on emerging multicore platforms

    Samuel Williams;Leonid Oliker;Richard Vuduc;John Shalf

  • OSKI: A Library of Automatically Tuned Sparse Matrix Kernels

    Richard Vuduc;James W Demmel;Katherine A Yelick

  • Model-driven autotuning of sparse matrix-vector multiply on GPUs

    Jee W. Choi;Amik Singh;Richard W. Vuduc

  • Sparsity: Optimization Framework for Sparse Matrix Kernels

    Eun-Jin Im;Katherine Yelick;Richard Vuduc

  • A massively parallel adaptive fast multipole method on heterogeneous architectures

    Ilya Lashuk;Aparna Chandramowlishwaran;Harper Langston;Tuan-Anh Nguyen

  • Automatic performance tuning of sparse matrix kernels

    Richard Wilson Vuduc;James W. Demmel

  • Self-Adapting Linear Algebra Algorithms and Software

    J. Demmel;J. Dongarra;V. Eijkhout;E. Fuentes

  • A performance analysis framework for identifying potential benefits in GPGPU applications

    Jaewoong Sim;Aniruddha Dasgupta;Hyesoon Kim;Richard Vuduc

  • Petascale Direct Numerical Simulation of Blood Flow on 200K Cores and Heterogeneous Architectures

    Abtin Rahimian;Ilya Lashuk;Shravan Veerapaneni;Aparna Chandramowlishwaran

  • Fast sparse matrix-vector multiplication by exploiting variable block structure

    Richard W. Vuduc;Hyun-Jin Moon

  • When Prefetching Works, When It Doesn’t, and Why

    Jaekyu Lee;Hyesoon Kim;Richard Vuduc

  • Falcon: fault localization in concurrent programs

    Sangmin Park;Richard W. Vuduc;Mary Jean Harrold

  • A Roofline Model of Energy

    Jee Whan Choi;Daniel Bedard;Robert Fowler;Richard Vuduc

  • Many-Thread Aware Prefetching Mechanisms for GPGPU Applications

    Jae-Kyu Lee;Nagesh B. Lakshminarayana;Hyesoon Kim;Richard W. Vuduc

  • On the limits of GPU acceleration

    Richard Vuduc;Aparna Chandramowlishwaran;Jee Choi;Murat Guney

  • Performance Optimizations and Bounds for Sparse Matrix-Vector Multiply

    Richard Vuduc;James W. Demmel;Katherine A. Yelick;Shoaib Kamil

  • POET: Parameterized Optimizations for Empirical Tuning

    Q. Yi;K. Seymour;H. You;R. Vuduc

  • Statistical Models for Empirical Search-Based Performance Tuning

    Richard Vuduc;James W. Demmel;Jeff A. Bilmes

  • When cache blocking of sparse matrix vector multiply works and why

    Rajesh Nishtala;Richard W. Vuduc;James W. Demmel;Katherine A. Yelick

  • SUSTain: Scalable Unsupervised Scoring for Tensors and its Application to Phenotyping

    Ioakeim Perros;Evangelos E. Papalexakis;Haesun Park;Richard Vuduc

  • Optimization of Sparse Matrix-Vector Multiplication on EmergingMulticore Platforms

    Samuel W. Williams;Leonid Oliker;Richard Vuduc;John Shalf

Frequent Co-Authors

James Demmel
James Demmel University of California, Berkeley
Jimeng Sun
Jimeng Sun University of Illinois at Urbana-Champaign
Katherine Yelick
Katherine Yelick University of California, Berkeley
Thomas R. Kurfess
Thomas R. Kurfess Oak Ridge National Laboratory
Alexander G. Gray
Alexander G. Gray Georgia Institute of Technology
Hyesoon Kim
Hyesoon Kim Georgia Institute of Technology
George Biros
George Biros The University of Texas at Austin
Leonid Oliker
Leonid Oliker Lawrence Berkeley National Laboratory
Evangelos E. Papalexakis
Evangelos E. Papalexakis University of California, Riverside
Mary Jean Harrold
Mary Jean Harrold Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens up a variety of academic and career options beyond traditional pathways. For those looking for a faster entry into the tech job market, consider easy associate degrees that pay well. These programs offer fundamental skills and are a cost-effective way to start a tech career.

If you are interested in educational technology or leadership roles, pursuing an ed d in education can provide advanced knowledge relevant to online learning and digital curriculum development. For those with a creative spark, aspiring to work in entertainment tech, an online school for game design offers practical skills needed for the gaming industry.

It's crucial to verify program quality. Always choose online degrees accredited by reputable agencies. Accreditation ensures your education is recognized by employers and other institutions, maximizing the return on your investment.

Best Scientists Citing Richard Vuduc

Trending Scientists