J
Julian Shun
Researcher at Massachusetts Institute of Technology
Publications - 115
Citations - 3534
Julian Shun is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Parallel algorithm & Speedup. The author has an hindex of 24, co-authored 104 publications receiving 2639 citations. Previous affiliations of Julian Shun include Carnegie Mellon University & Vassar College.
Papers
More filters
Proceedings ArticleDOI
Ligra: a lightweight graph processing framework for shared memory
Julian Shun,Guy E. Blelloch +1 more
TL;DR: This paper presents a lightweight graph processing framework that is specific for shared-memory parallel/multicore machines, which makes graph traversal algorithms easy to write and significantly more efficient than previously reported results using graph frameworks on machines with many more cores.
Proceedings ArticleDOI
Brief announcement: the problem based benchmark suite
Julian Shun,Guy E. Blelloch,Jeremy T. Fineman,Phillip B. Gibbons,Aapo Kyrola,Harsha Vardhan Simhadri,Kanat Tangwongsan +6 more
TL;DR: This announcement describes the problem based benchmark suite (PBBS), a set of benchmarks designed for comparing parallel algorithmic approaches, parallel programming language styles, and machine architectures across a broad set of problems.
Proceedings ArticleDOI
Multicore triangle computations without tuning
Julian Shun,Kanat Tangwongsan +1 more
TL;DR: This paper describes the design and implementation of simple and fast multicore parallel algorithms for exact, as well as approximate, triangle counting and other triangle computations that scale to billions of nodes and edges, and is much faster than existing parallel approximate triangle counting implementations.
Proceedings ArticleDOI
Internally deterministic parallel algorithms can be fast
TL;DR: The main contribution is to demonstrate that for this wide body of problems, there exist efficient internally deterministic algorithms, and moreover that these algorithms are natural to reason about and not complicated to code.
Journal ArticleDOI
GraphIt: a high-performance graph DSL
TL;DR: GraphIt is introduced, a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with different sizes and structures and which outperforms the next fastest shared-memory frameworks on 24 out of 32 experiments.