Aydın Buluç

Publications

[1] 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 | .pdf ]
[2] Ariful Azad and Aydin Buluç. A work-efficient parallel sparse matrix-sparse vector multiplication algorithm. In Proceedings of the IPDPS, 2017. [ bib | .pdf ]
[3] 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 ]
[4] 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 ]
[5] 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 | .pdf ]
[6] Ariful Azad and Aydin Buluç. Towards a GraphBLAS library in Chapel. In Intl. Parallel & Distributed Processing Symposium Workshop (IPDPSW), 2017. [ bib | .pdf ]
[7] Evangelos Georganas, Steven Hofmeyr, Rob Egan, Aydin Buluc, Leonid Oliker, Daniel Rokhsar, and Katherine Yelick. Extreme-scale de novo genome assembly. 2017. To appear as a chapter in Exascale Scientific Applications: Programming Approaches for Scalability, Performance, and Portability (CRC Press). [ bib | arXiv ]
[8] 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 | .pdf ]
[9] Hasan Metin Aktulga, Md. Afibuzzaman, Samuel Williams, Aydin Buluç, Meiyue Shao, Chao Yang, Esmond G. Ng, Pieter Maris, and James P. Vary. A high performance block eigensolver for nuclear configuration interaction calculations. IEEE Transactions on Parallel and Distributed Systems (TPDS)), 28(6):1550-1563, 2017. [ bib | DOI | .pdf]
[10] 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 | arXiv | .pdf ]
[11] Ariful Azad and Aydin Buluç. A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel Computing, 2016. [ bib | DOI ]
[12] Ariful Azad and Aydin Buluç. Distributed-memory algorithms for maximum cardinality matching in bipartite graphs. In Proceedings of the IPDPS. IEEE, 2016. [ bib | .pdf ]
[13] 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 ]
[14] Veronika Strnadova-Neeley, Aydin Buluc, John R Gilbert, Leonid Oliker, and Weimin Ouyang. LiRa: A new likelihood-based similarity score for collaborative filtering. arXiv preprint arXiv:1608.08646, 2016. [ bib | arXiv ]
[15] 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 ]
[16] 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 ]
[17] Ariful Azad and Aydin Buluç. Distributed-memory algorithms for maximal cardinality matching using matrix algebra. In IEEE International Conference on Cluster Computing (CLUSTER), 2015. (full paper). [ bib | .pdf ]
[18] 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 ]
[19] 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 ]
[20] Aydin Buluç, Scott Beamer, Kamesh Madduri, Krste Asanović, and David Patterson. Distributed-memory breadth-first search on massive graphs. In D. Bader, editor, Parallel Graph Algorithms. CRC Press, Taylor-Francis, 2016 (in press). [ bib | .pdf ]
[21] Ariful Azad, Aydin Buluç, and Alex Pothen. A parallel tree grafting algorithm for maximum cardinality matching in bipartite graphs. In Proceedings of the IPDPS, 2015. [ bib | DOI | .pdf ]
[22] 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 ]
[23] 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 ]
[24] 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 ]
[25] 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 ]
[26] 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 ]
[27] 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 ]
[28] 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. Regular paper. [ bib | .pdf ]
[29] Aydin Buluç, John Gilbert, and Sivan Toledo. Computing shortest paths using sparse Gaussian elimination. In SIAM Workshop on Network Science (NS14), 2014. (extended abstract). [ bib | .pdf ]
[30] D. Bader, A. Buluç, J. Gilbert, J. Gonzalez, J. Kepner, and T. Mattson. The Graph BLAS effort and its implications for Exascale. In SIAM Workshop on Exascale Applied Mathematics Challenges and Opportunities (EX14), 2014. (extended abstract). [ bib | .pdf ]
[31] 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 ]
[32] 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 ]
[33] 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 ]
[34] 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 ]
[35] 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 ]
[36] 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 ]
[37] 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 ]
[38] 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 ]
[39] 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 ]
[40] Adam Lugowski, Aydin Buluç, John R. Gilbert, and Steve Reinhardt. Scalable complex graph analysis with the knowledge discovery toolbox. In ICASSP, Special session on “Big Data”, 2012. [ bib | .pdf ]
[41] K Kandalla, A Buluc, H Subramoni, K Tomko, J Vienne, L Oliker, and DK Panda. Can network-offload based non-blocking neighborhood MPI collectives improve communication overheads of irregular graph algorithms? In IEEE International Conference on Cluster Computing Workshops, pages 222-230. IEEE, 2012. [ bib | DOI ]
[42] 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 ]
[43] Aydin Buluç, Samuel Williams, Leonid Oliker, and James Demmel. Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication. In Proc. IPDPS, 2011. [ bib | .pdf ]
[44] 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 ]
[45] Aydin Buluç, John R. Gilbert, and Viral B. Shah. Implementing Sparse Matrices for Graph Algorithms. In Jeremy Kepner and John R. Gilbert, editors, Graph Algorithms in the Language of Linear Algebra. SIAM Press, 2011. [ bib | DOI ]
[46] Aydin Buluç and John R. Gilbert. New Ideas in Sparse Matrix-Matrix Multiplication. In Jeremy Kepner and John R. Gilbert, editors, Graph Algorithms in the Language of Linear Algebra. SIAM Press, 2011. [ bib | DOI ]
[47] Aydin Buluç, John R. Gilbert, and Ceren Budak. Solving path problems on the GPU. Parallel Computing, 36(5-6):241 - 253, 2010. [ bib | DOI | .pdf ]
[48] Aydin Buluç and John R. Gilbert. Highly parallel sparse matrix-matrix multiplication. Technical Report UCSB-CS-2010-10, UCSB CS Department, June 2010. [ bib | arXiv | .pdf ]
[49] Aydin Buluç. Linear Algebraic Primitives for Parallel Computing on Large Graphs. PhD thesis, University of California, Santa Barbara, CA, March 2010. [ bib | .pdf ]
[50] Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, and Charles E. Leiserson. Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. In Proc. SPAA, Calgary, Canada, August 2009. [ bib | .pdf ]
[51] Aydin Buluç and John R. Gilbert. Challenges and advances in parallel sparse matrix-matrix multiplication. In The 37th International Conference on Parallel Processing (ICPP'08), pages 503-510, Portland, Oregon, USA, September 2008. [ bib | DOI | .pdf ]
[52] Aydin Buluç and John R. Gilbert. On the Representation and Multiplication of Hypersparse Matrices. In Proc. IPDPS, April 2008. [ bib | DOI | .pdf ]
[53] Aydin Buluç and Erik G. Boman. Towards scalable parallel hypergraph partitioning. In CSRI Summer Proceedings, Albuquerque, NM and Livermore, CA, 2008. [ bib | .pdf ]