Concepedia

Cache-oblivious Parallel Algorithms

Cache-Oblivious Parallel Algorithms is a computational algorithm design paradigm that belongs to the class of parallel algorithms and is distinguished by its optimization of data locality and parallelism without explicit knowledge of cache parameters, thereby achieving asymptotically optimal performance across all cache levels in a memory hierarchy.

37

Publications

2.7K

Citations

82

Authors

33

Institutions

Publications per year

2017–2026

3

Parents

Publications

37

Cache-oblivious algorithms

Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · 2003 · 807 citations

, , +17

The pochoir stencil compiler

Yuan Tang, Rezaul Chowdhury, Bradley C. Kuszmaul et al. · 2011 · 338 citations · Full text

, , +17

Cache-Oblivious Algorithms

Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · ACM Transactions on Algorithms · 2012 · 190 citations

, , +17

Low depth cache-oblivious algorithms

Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri · 2010 · 126 citations · Full text

, , +17

Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication

James Demmel, David Eliahu, Armando Fox et al. · 2013 · 117 citations

, , +17

1–5 of 37

Authors

82

  1. RC
    Rezaul Chowdhury

    The University of Texas at Austin, United States

    7 publications · 527 citations

    7

    h-index

  2. MF
    Matteo Frigo

    Massachusetts Institute of Technology, United States

    5 publications · 1.2K citations

    5

    h-index

  3. CE
    Charles E. Leiserson

    Massachusetts Institute of Technology, United States

    5 publications · 1.4K citations

    5

    h-index

  4. YT
    Yuan Tang

    Huazhong University of Science and Technology, China

    5 publications · 418 citations

    5

    h-index

  5. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    4 publications · 138 citations

    4

    h-index

1–5 of 82

Institutions

33

  1. Intel (United States)

    Santa Clara, United States

    5 h-index

    5 publications

    635 citations

  2. Stony Brook University

    Stony Brook, United States

    4 h-index

    10 publications

    232 citations

  3. IBM (United States)

    Armonk, United States

    4 h-index

    9 publications

    340 citations

  4. Fudan University

    Shanghai, China

    4 h-index

    6 publications

    134 citations

  5. IBM Research - Austin

    Austin, United States

    3 h-index

    6 publications

    310 citations

  6. Carnegie Mellon University

    Pittsburgh, United States

    3 h-index

    9 publications

    791 citations

  7. The University of Texas at Austin

    Austin, United States

    3 h-index

    5 publications

    208 citations

  8. University of California, Berkeley

    Berkeley, United States

    2 h-index

    7 publications

    720 citations

1–8 of 33

Venues

  1. Theory of Computing Systems

    2 publications · 107 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 27 citations

    1

    h-index

  3. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 10 citations

    1

    h-index

  4. International Colloquium on Automata, Languages and Programming

    Conference · 1 publications · 10 citations

    1

    h-index

  5. BMC Bioinformatics

    1 publications · 12 citations

    1

    h-index

1–5