{"ID":2899745,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.00949","arxiv_id":"2507.00949","title":"How Fast Can Graph Computations Go on Fine-grained Parallel Architectures","abstract":"Large-scale graph problems are of critical and growing importance and historically parallel architectures have provided little support. In the spirit of co-design, we explore the question, How fast can graph computing go on a fine-grained architecture? We explore the possibilities of an architecture optimized for fine-grained parallelism, natural programming, and the irregularity and skew found in real-world graphs. Using two graph benchmarks, PageRank (PR) and Breadth-First Search (BFS), we evaluate a Fine-Grained Graph architecture, UpDown, to explore what performance codesign can achieve. To demonstrate programmability, we wrote five variants of these algorithms. Simulations of up to 256 nodes (524,288 lanes) and projections to 16,384 nodes (33M lanes) show the UpDown system can achieve 637K GTEPS PR and 989K GTEPS BFS on RMAT, exceeding the best prior results by 5x and 100x respectively.","short_abstract":"Large-scale graph problems are of critical and growing importance and historically parallel architectures have provided little support. In the spirit of co-design, we explore the question, How fast can graph computing go on a fine-grained architecture? We explore the possibilities of an architecture optimized for fine-...","url_abs":"https://arxiv.org/abs/2507.00949","url_pdf":"https://arxiv.org/pdf/2507.00949v1","authors":"[\"Yuqing Wang\",\"Charles Colley\",\"Brian Wheatman\",\"Jiya Su\",\"David F. Gleich\",\"Andrew A. Chien\"]","published":"2025-07-01T16:51:54Z","proceeding":"cs.DC","tasks":"[\"cs.DC\",\"cs.AR\"]","methods":"[]","has_code":false}