C
Charles E. Leiserson
Researcher at Massachusetts Institute of Technology
Publications - 190
Citations - 50798
Charles E. Leiserson is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Cilk & Scheduling (computing). The author has an hindex of 65, co-authored 185 publications receiving 49312 citations. Previous affiliations of Charles E. Leiserson include Vassar College & Carnegie Mellon University.
Papers
More filters
Proceedings ArticleDOI
DAG-consistent distributed shared memory
TL;DR: This work introduces DAG (directed acyclic graph) consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming and provides empirical evidence of the flexibility and efficiency of DAG consistency for applications that include blocked matrix multiplication, Strassen's matrix multiplication algorithm and a Barnes-Hut code.
Proceedings ArticleDOI
Adaptive work stealing with parallelism feedback
TL;DR: The performance of A-Steal is analyzed using "trim analysis," which allows us to prove that the thread scheduler performs poorly on at most a small number of time steps, while exhibiting near-optimal behavior on the vast majority.
Proceedings ArticleDOI
Wafer-scale integration of systolic arrays
TL;DR: In this paper, the authors describe and analyze several algorithms for constructing systolic array networks from cells on a silicon wafer, adopting a probabilistic model of cell failure, and attempt to construct networks whose maximum wire length is minimal.
Proceedings ArticleDOI
Standards for graph algorithm primitives
Timothy G. Mattson,David A. Bader,Jon Berry,Aydin Buluc,Jack Dongarra,Christos Faloutsos,John Feo,John R. Gilbert,Joseph E. Gonzalez,Bruce Hendrickson,Jeremy Kepner,Charles E. Leiserson,Andrew Lumsdaine,David Padua,Stephen W. Poole,Steve Reinhardt,Michael Stonebraker,Steve Wallach,Andrew Yoo +18 more
TL;DR: In this article, the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks.