Publications

Selected Recent Publications

2020

  • Yu-Hang Tang, Oguz Selvitopi, Doru Popovici, and Aydin Buluç. A high-throughput solver for marginalized graph kernels on GPU. In Proceedings of the IPDPS, 2020. [ bib | arXiv | .pdf ]
  • Oguz Selvitopi, Md Taufique Hussain, Ariful Azad, and Aydin Buluç. Optimizing high performance Markov clustering for pre-exascale architectures. In Proceedings of the IPDPS, 2020. [ bib | code | arXiv | .pdf ]
  • Alberto Zeni, Giulia Guidi, Marquita Ellis, Nan Ding, Marco D. Santambrogio, Steven Hofmeyr, Aydin Buluç, Leonid Oliker, and Katherine Yelick. LOGAN: High-performance GPU-based x-drop long-read alignment. In Proceedings of the IPDPS, 2020. [ bib | code | arXiv | .pdf ]
  • Katherine Yelick, Aydin Buluç, Muaaz Awan, Ariful Azad, Benjamin Brock, Rob Egan, Saliya Ekanayake, Marquita Ellis, Evangelos Georganas, Giulia Guidi, et al. The parallelism motifs of genomic data analysis. Philosophical Transactions of the Royal Society A, 378(2166):20190394, 2020. [ bib | DOI | arXiv ]

2019

  • Carl Yang, Aydin Buluç, and John D. Owens. GraphBLAST: A high-performance linear algebra-based graph framework on the GPU. arXiv preprint, 2019. [ bib | arXiv ]
  • Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, and Aydin Buluç. Performance optimization, modeling and analysis of sparse matrix-matrix products on multi-core and many-core processors. Parallel Computing, 2019. [ DOI | code | .pdf ]
  • Ben Brock, Aydin Buluç, and Katherine Yelick. BCL: A cross-platform distributed data structures library. In 48th International Conference on Parallel Processing (ICPP), Kyoto, Japan, 2019. [ bib | code | arXiv |.pdf ]
  • Marquita Ellis, Giulia Guidi, Aydin Buluç, Leonid Oliker, and Katherine Yelick. diBELLA: Distributed long read to long read alignment. In 48th International Conference on Parallel Processing (ICPP), Kyoto, Japan, 2019. [ bib | .pdf ]
  • Ariful Azad and Aydin Buluç. LACC: a linear-algebraic algorithm for finding connected components in distributed memory. In Proceedings of the IPDPS, Rio de Janeiro, Brazil, 2019. [ bib | code | .pdf ]
  • Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydin Buluç. BELLA: Berkeley efficient long-read to long-read aligner and overlapper. bioRxiv preprint, page 464420, 2019 (v4). [ bib | code | bioRxiv | .pdf ]

2018

  • Evangelos Georganas, Rob Egan, Steven Hofmeyr, Eugene Goltsman, Bill Arndt, Andrew Tritt, Aydin Buluç, Leonid Oliker, and Katherine Yelick. Extreme Scale De Novo Metagenome Assembly. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC'18), 2018. Best Paper Nominee. [arXiv]
  • Amir Gholami, Ariful Azad, Peter Jin, Kurt Keutzer, and Aydin Buluç. Integrated model, batch, and domain parallelism in training neural networks. In SPAA'18: 30th ACM Symposium on Parallelism in Algorithms and Architectures, 2018. [ bib | arXiv | .pdf ]
  • Carl Yang, Aydin Buluç, and John D Owens. Implementing push-pull efficiently in GraphBLAS. In 47th International Conference on Parallel Processing (ICPP), 2018. [ bib | code | arXiv | .pdf ]
  • Carl Yang, Aydin Buluç, and John D Owens. Design principles for sparse matrix multiplication on the GPU. In 24th International European Conference on Parallel and Distributed Computing (Euro-Par), 2018. Distinguished Paper. [ bib | code | arXiv | .pdf ]
  • Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, and Aydin Buluc. High-performance sparse matrix-matrix products on intel KNL and multicore architectures. In 47th International Conference on Parallel Processing Workshops (ICPPW), 2018. [ bib | code | arXiv | .pdf ]
  • Ariful Azad, Aydin Buluc, Xiaoye S Li, Xinliang Wang, and Johannes Langguth. A distributed-memory approximation algorithm for maximum weight perfect bipartite matching. arXiv preprint arXiv:1801.09809, 2018. [ bib | arXiv ]
  • Ariful Azad, Georgios A. Pavlopoulos, Christos A. Ouzounis, Nikos C. Kyrpides, and Aydin Buluç. HipMCL: A high-performance parallel implementation of the Markov clustering algorithm for large-scale networks. Nucleic Acids Research (NAR), 2018. [ bib | DOI | code ]
  • Penporn Koanantakool, Alnur Ali, Ariful Azad, Aydin Buluç, Dmitriy Morozov, Sang-Yun Oh, Leonid Oliker, and Katherine Yelick. Communication-avoiding optimization methods for distributed massive-scale sparse inverse covariance estimation. In The 21st International Conference on Artificial Intelligence and Statistics (AISTATS), 2018. [ bib | code | supplementary | .pdf ]

2017

  • Yang You, Aydin Buluç, and James Demmel. Scaling deep learning on GPU and Knights Landing clusters. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC'17), 2017. [ bib | DOI | code | .pdf ]
  • Ariful Azad and Aydin Buluç. A work-efficient parallel sparse matrix-sparse vector multiplication algorithm. In Proceedings of the IPDPS, 2017. [ bib | code | .pdf ]
  • Aydin Buluç, Timothy Mattson, Scott McMillan, Jose Moreira, and Carl Yang. Design of the GraphBLAS API for C. In IEEE Workshop on Graph Algorithm Building Blocks, IPDPSW, 2017. [ bib | .pdf ]
  • Ariful Azad, Mathias Jacquelin, Aydin Buluç, and Esmond G. Ng. The reverse Cuthill-McKee algorithm in distributed-memory. In Proceedings of the IPDPS, 2017. [ bib | code | .pdf ]
  • Marquita Ellis, Evangelos Georganas, Rob Egan, Steven Hofmeyr, Aydin Buluç, Brandon Cook, Leonid Oliker, and Katherine Yelick. Performance characterization of de novo genome assembly on leading parallel systems. In Europar - International European Conference on Parallel and Distributed Computing, 2017. [ bib | .pdf ]
  • Ariful Azad, Aydin Buluç, and Alex Pothen. Computing maximum cardinality matchings in parallel on bipartite graphs via tree-grafting. IEEE Transactions on Parallel and Distributed Systems (TPDS)), 28(1):44-59, 2017. [ bib | DOI | code | .pdf ]

2016

  • Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, and Samuel Williams. Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication. SIAM Journal on Scientific Computing (SISC), 38(6):C624-C651, 2016. [ bib | DOI | code | arXiv | .pdf ]
  • Ariful Azad and Aydin Buluç. A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel Computing, 2016. [ bib | DOI | code ]
  • Ariful Azad and Aydin Buluç. Distributed-memory algorithms for maximum cardinality matching in bipartite graphs. In Proceedings of the IPDPS. IEEE, 2016. [ bib | code | .pdf ]
  • Penporn Koanantakool, Ariful Azad, Aydin Buluç, Dmitriy Morozov, Sang-Yun Oh, Leonid Oliker, and Katherine Yelick. Communication-avoiding parallel sparse-dense matrix-matrix multiplication. In Proceedings of the IPDPS, 2016. [ bib | .pdf ]
  • Jeremy Kepner, Peter Aaltonen, David Bader, Aydin Buluç, Franz Franchetti, John Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José Moreira, John Owens, Carl Yang, Marcin Zalewski, and Timothy Mattson. Mathematical foundations of the GraphBLAS. In IEEE High Performance Extreme Computing (HPEC), 2016. [ bib | .pdf ]
  • Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. Recent advances in graph partitioning. In Algorithm Engineering - Selected Results and Surveys, volume 9220. Lecture Notes in Computer Science, 2016. [ bib | DOI | arXiv ]

2015

  • Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Steven Hofmeyr, Chaitanya Aluru, Rob Egan, Leonid Oliker, Daniel Rokhsar, and Katherine Yelick. HipMer: An extreme-scale de novo genome assembler. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC'15), 2015. [ bib | .pdf ]
  • Veronika Strnadova-Neeley, Aydin Buluç, Joseph Gonzalez, Jarrod Chapman, John Gilbert, and Leonid Oliker. Efficient data reduction for large-scale genetic mapping. In ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM BCB), 2015. [ bib | .pdf ]
  • Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Leonid Oliker, Daniel Rokhsar, and Katherine Yelick. meraligner: A fully parallel sequence aligner. In Proceedings of the IPDPS, 2015. [ bib | .pdf ]
  • Ariful Azad, Aydin Buluç, and John R Gilbert. Parallel triangle counting and enumeration using matrix algebra. In Proceedings of the IPDPSW, Workshop on Graph Algorithm Building Blocks (GABB), pages 804 - 811, 2015. [ bib | DOI | .pdf ]
  • Jarrod Chapman, Martin Mascher, Aydin Buluç, Kerrie Barry, Evangelos Georganas, Adam Session, Veronika Strnadova, Jerry Jenkins, Sunish Sehgal, Leonid Oliker, Jeremy Schmutz, Katherine Yelick, Uwe Scholz, Robbie Waugh, Jesse Poland, Gary Muehlbauer, Nils Stein, and Daniel Rokhsar. A whole-genome shotgun approach for assembling and anchoring the hexaploid bread wheat genome. Genome Biology, 16(26), 2015. [ bib | DOI | .pdf ]
  • Adam Lugowski, Shoaib Kamil, Aydin Buluç, Samuel Williams, Erika Duriakova, Leonid Oliker, Armando Fox, and John Gilbert. Parallel processing of filtered queries in attributed semantic graphs. Journal of Parallel and Distributed Computing (JPDC)), 79-80:115-131, 2015. [ bib | DOI | .pdf ]
  • J. Kepner, D. Bader, A. Buluç, J. Gilbert, J. Kepner, T. Mattson, and H. Meyerhenke. Graphs, matrices, and the GraphBLAS: Seven good reasons. In The International Conference on Computational Science (ICCS), 2015. [ bib | DOI | arXiv ]

2014

  • Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Leonid Oliker, Daniel Rokhsar, and Katherine Yelick. Parallel de bruijn graph construction and traversal for de novo genome assembly. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC'14), 2014. [ bib | .pdf ]
  • V. Strnadova, A. Buluç, J. Gonzalez, S. Jegelka, J. Chapman, J. Gilbert, D. Rokhsar, and L. Oliker. Efficient and accurate clustering for large-scale genetic mapping. In The IEEE International Conference on Bioinformatics and Biomedicine (BIBM'14), 2014. [ bib | .pdf ]
  • H. Metin Aktulga, Aydin Buluç, Samuel Williams, and Chao Yang. Optimizing sparse matrix-multiple vectors multiplication for nuclear configuration interaction calculations. In Proceedings of the IPDPS. IEEE Computer Society, 2014. [ bib | .pdf ]

2013

  • T. Mattson, D. Bader, J. Berry, A. Buluç, J. Dongarra, C. Faloutsos, J. Feo, J. Gilbert, J. Gonzalez, B. Hendrickson, J. Kepner, C. Leiserson, A. Lumsdaine, D. Padua, S. Poole, S. Reinhardt, M. Stonebraker, S. Wallach, and A. Yoo. Standards for graph algorithm primitives. In High Performance Extreme Computing Conference (HPEC '13). IEEE, 2013. (position paper). [ bib | .pdf ]
  • Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, and Sivan Toledo. Communication optimal parallel multiplication of sparse random matrices. In SPAA 2013: The 25th ACM Symposium on Parallelism in Algorithms and Architectures, Montreal, Canada, 2013. [ bib | DOI |.pdf ]
  • Aydin Buluç, Erika Duriakova, Armando Fox, John Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, and Samuel Williams. High-productivity and high-performance analysis of filtered semantic graphs. In Proceedings of the IPDPS. IEEE Computer Society, 2013. [ bib | DOI | .pdf ]
  • Edgar Solomonik, Aydin Buluç, and James Demmel. Minimizing communication in all-pairs shortest paths. In Proceedings of the IPDPS. IEEE Computer Society, 2013. [ bib | DOI | .pdf ]
  • Scott Beamer, Aydin Buluç, Krste Asanović, and David Patterson. Distributed memory breadth-first search revisited: Enabling bottom-up search. In Workshop on Multithreaded Architectures and Applications (MTAAP), in conjunction with IPDPS. IEEE Computer Society, 2013. [ bib | DOI | .pdf ]
  • Aydin Buluç and Kamesh Madduri. Graph partitioning for scalable distributed graph computations. In Graph Partitioning and Graph Clustering (Proc. 10th DIMACS Implementation Challenge), volume 588 of Contemporary Mathematics, pages 83-101. AMS, 2013. [ bib | .pdf ]

2012

  • Adam Lugowski, David Alber, Aydin Buluç, John Gilbert, Steve Reinhardt, Yun Teng, and Andrew Waranis. A flexible open-source toolbox for scalable complex graph analysis. In SIAM Conference on Data Mining (SDM), 2012. [ bib | .pdf ]
  • Aydin Buluç and John R. Gilbert. Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. SIAM Journal of Scientific Computing (SISC), 34(4):170 - 191, 2012. [ bib | DOI |arXiv | .pdf ]

2011

  • Aydin Buluç and Kamesh Madduri. Parallel breadth-first search on distributed memory systems. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC'11), 2011. [ bib | DOI | arXiv | .pdf ]
  • Aydin Buluç, Samuel Williams, Leonid Oliker, and James Demmel. Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication. In Proceedings of the IPDPS, 2011. [ bib | .pdf ]
  • Aydin Buluç and John R. Gilbert. The Combinatorial BLAS: Design, implementation, and applications. The International Journal of High Performance Computing Applications, 25(4):496 - 509, 2011. [ bib | DOI |.pdf ]