Charles Colley
Research Subjects
Charles Colley has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Andrew A. Chien
University of Chicago
2 shared publications - David F. Gleich
Purdue University, West Lafayette, USA
2 shared publications - Yuqing Wang
University of Chicago
2 shared publications - Ahsan Pervaiz
University of Chicago
1 shared publication - Andronicus Rajasukumar
University of Chicago
1 shared publication - Brian Wheatman
Department of Computer Science University of Chicago 60637 Chicago IL
1 shared publication
Latest Publications
- 1 November 2025
- Published by Springer Nature
- p. 78-95
Efficiently Exploiting Irregular Parallelism Using Keys at Scale
- 1 November 2025
- Published by Springer Nature
- p. 78-95
Efficiently Exploiting Irregular Parallelism Using Keys at Scale
- Open Access
How Fast Can Graph Computations Go on Fine-grained Parallel Architectures
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.
Open AccessHow Fast Can Graph Computations Go on Fine-grained Parallel Architectures
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.