High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

26 August 2020

Maciej Besta

Armon Carigiet

Zur Vonarburg-Shmaria

Papers citing "High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality"

34 / 34 papers shown

Title
Demystifying Chains, Trees, and Graphs of Thoughts Maciej Besta Florim Memedi Zhenyu Zhang Robert Gerstenberger Guangyuan Piao ... Aleš Kubíček H. Niewiadomski Aidan O'Mahony Onur Mutlu Torsten Hoefler AI4CE LRM 160 26 0 25 Jan 2024
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations Maciej Besta Michal Podstawski Linus Groner Edgar Solomonik Torsten Hoefler 37 137 0 30 Oct 2020
Log(Graph): A Near-Optimal High-Performance Graph Representation Maciej Besta Dimitri Stanojevic Tijana Zivic Jagpreet Singh Maurice Hoerold Torsten Hoefler 45 40 0 29 Oct 2020
Substream-Centric Maximum Matchings on FPGA Maciej Besta Marc Fischer Tal Ben-Nun Dimitri Stanojevic Johannes de Fine Licht Torsten Hoefler 60 28 0 28 Oct 2020
Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability Maciej Besta S. M. Hassan S. Yalamanchili Rachata Ausavarungnirun O. Mutlu Torsten Hoefler GNN 97 50 0 21 Oct 2020
High-Performance Distributed RMA Locks P. Schmid Maciej Besta Torsten Hoefler 52 31 0 19 Oct 2020
Evaluating the Cost of Atomic Operations on Modern Architectures Hermann Schweizer Maciej Besta Torsten Hoefler 48 91 0 19 Oct 2020
Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler GNN 49 45 0 18 Oct 2020
Fault Tolerance for Remote Memory Access Programming Models Maciej Besta Torsten Hoefler 42 39 0 18 Oct 2020
High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks Maciej Besta Jens Domke Marcel Schneider Marek Konieczny Salvatore Di Girolamo Timo Schneider Ankit Singla Torsten Hoefler 57 5 0 07 Jul 2020
Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided Robert Gerstenberger Maciej Besta Torsten Hoefler 84 139 0 21 Jan 2020
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics Maciej Besta Simon Weber Lukas Gianinazzi Robert Gerstenberger Andrey Ivanov Yishai Oltchik Torsten Hoefler 48 38 0 18 Dec 2019
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons Maciej Besta Raghavendra Kanakagiri Harun Mustafa Mikhail Karasikov Gunnar Rätsch Torsten Hoefler Edgar Solomonik 35 66 0 11 Nov 2019
Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations Maciej Besta Torsten Hoefler 34 34 0 28 Oct 2019
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication Grzegorz Kwa'sniewski Marko Kabić Maciej Besta J. VandeVondele R. Solcà Torsten Hoefler LRM 32 92 0 26 Aug 2019
Network-Accelerated Non-Contiguous Memory Transfers Salvatore Di Girolamo Konstantin Taranov Andreas Kurth Michael Schaffner Timo Schneider Jakub Beránek Maciej Besta Luca Benini Duncan Roweth Torsten Hoefler 21 24 0 22 Aug 2019
Graph Colouring Meets Deep Learning: Effective Graph Neural Network Models for Combinatorial Problems Henrique Lemos Marcelo O. R. Prates Pedro H. C. Avelar Luís C. Lamb GNN 43 84 0 11 Mar 2019
Coloring Big Graphs with AlphaGoZero Jiayi Huang Md. Mostofa Ali Patwary G. Diamos AI4CE GNN 37 49 0 26 Feb 2019
Graph Processing on FPGAs: Taxonomy, Survey, Challenges Maciej Besta Dimitri Stanojevic Johannes de Fine Licht Tal Ben-Nun Torsten Hoefler GNN AI4CE 62 52 0 25 Feb 2019
A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning Tal Ben-Nun Maciej Besta Simon Huber A. Ziogas D. Peter Torsten Hoefler ELM ALM 41 77 0 29 Jan 2019
Transformations of High-Level Synthesis Codes for High-Performance Computing Johannes de Fine Licht Maciej Besta Simon Meierhans Torsten Hoefler 54 90 0 21 May 2018
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable Laxman Dhulipala G. Blelloch Julian Shun GNN 49 146 0 14 May 2018
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models Leonid Barenboim Michael Elkin Uri Goldenberg 39 70 0 01 Dec 2017
An Optimal Distributed $(Δ+1)$ -Coloring Algorithm? Yi-Jun Chang Wenzheng Li Seth Pettie OOD 34 79 0 03 Nov 2017
Scaling betweenness centrality using communication-efficient sparse matrix multiplication Edgar Solomonik Maciej Besta Flavio Vella Torsten Hoefler 82 77 0 22 Sep 2016
Efficient and High-quality Sparse Graph Coloring on the GPU Xuhao Chen Pingfan Li Jianbin Fang T. Tang Zhiying Wang Canqun Yang 51 14 0 20 Jun 2016
Reinforcement learning based local search for grouping problems: A case study on graph coloring Yangming Zhou Jin-Kao Hao B. Duval 29 69 0 01 Apr 2016
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model Yi-Jun Chang T. Kopelowitz Seth Pettie 84 159 0 26 Feb 2016
The GAP Benchmark Suite S. Beamer Krste Asanović D. Patterson 32 480 0 14 Aug 2015
A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures G. Rokos Gerard Gorman Paul H. J. Kelly 50 28 0 15 May 2015
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures Ümit V. Çatalyürek J. Feo A. Gebremedhin M. Halappanavar A. Pothen 77 85 0 16 May 2012
The Locality of Distributed Symmetry Breaking Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider 73 292 0 09 Feb 2012
Deterministic Distributed Vertex Coloring in Polylogarithmic Time Leonid Barenboim Michael Elkin 83 114 0 08 Mar 2010
Kronecker Graphs: An Approach to Modeling Networks J. Leskovec Deepayan Chakrabarti Jon M. Kleinberg Christos Faloutsos Zoubin Ghahramani 73 1,073 0 29 Dec 2008