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
Journal ArticleDOI
There’s plenty of room at the Top: What will drive computer performance after Moore’s law?
Charles E. Leiserson,Neil C. Thompson,Joel Emer,Joel Emer,Bradley C. Kuszmaul,Butler W. Lampson,Butler W. Lampson,Daniel Sanchez,Tao B. Schardl +8 more
TL;DR: It is argued that the most promising place to look is at the top of the computing stack, where improvements in software, algorithms, and hardware architecture can bring the much-needed boost in computer performance.
Proceedings ArticleDOI
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
TL;DR: A general method for analyzing nondeterministic programs that use reducers and it is shown that for a graph G=(V,E) with diameter D and bounded out-degree, this data-race-free version of PBFS algorithm attains near-perfect linear speedup if P << (V+E)/Dlg3(V/D).
Proceedings ArticleDOI
Algorithms for routing and testing routability of planar VLSI layouts
Charles E. Leiserson,F M Maley +1 more
TL;DR: These algorithms subsume most of the polynomial-time algorithms in the literature for planar routing and routability testing in the rectilinear grid model and provide an explicit construction of a database to support computation involving the layout topology.
Proceedings ArticleDOI
The Cilk++ concurrency platform
TL;DR: This paper overviews the Cilk++ programming environment, which incorporates a compiler, a runtime system, and a race-detection tool, and provides a "hyperobject" library which allows races on nonlocal variables to be mitigated without lock contention or substantial code restructuring.
Proceedings ArticleDOI
Reducers and other Cilk++ hyperobjects
TL;DR: This paper introduces hyperobjects, a linguistic mechanism that allows different branches of a multithreaded program to maintain coordinated local views of the same nonlocal variable, and examines a randomized locking methodology for reducers.