ACM_Citations
  • USA-2014

    For enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development and for distinguished mentoring of computer science leaders and students.

  • USA-2013

    For contributions to efficient and robust parallel computation through both provably efficient randomized scheduling protocols and a set of parallel-language primitives constituting the Cilk framework. Implementations of these protocols and conceptual framework have been deployed on scores of millions of machines and therefore enjoy daily impact. Before the two papers by Robert D. Blumofe and Charles E. Leiserson, distributed scheduling involved various promising but ultimately fragile heuristic techniques built on the ideas of work queues and dataflow computation. The fragility meant that some programs might run efficiently, but slight changes in code or the environment could make execution far less efficient. The theoretical framework offered by the two papers showed that under certain eminently achievable circumstances, a simple randomized "work-stealing" algorithm, in which idle processors takes work from busy processors, can achieve essentially perfect parallel speedup. The impact of this work has been both rapid and widespread. Work-stealing schedulers can be found in Java, Microsoft Visual Studio, and state-of-the-art garbage collectors. The Cilk parallel programming framework, developed by the authors, is now directly incorporated within the Intel C/C++ compiler, GCC, and other compilers, thus increasing the range of application of these ideas to nearly ubiquitous platforms. Robert D. Blumofe is Executive Vice President of the Akamai Platform Division and is responsible for the deployment of Akamai networks, as well as for the distributed algorithms that run on them. Charles E. Leiserson is Professor of Computer Science and Engineering in MIT's Department of Electrical Engineering and Computer Science and Computer Science and Artificial Intelligence Laboratory, where he works on performance engineering and the theory and practice of multicore computing.

  • USA-2006

    For contributions to parallel and distributed computing.

  • USA-1982

    For his dissertation "Area-Efficient VLSI Computation."

Experience
Education
Bio
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology in Cambridge, Massachusetts, USA. He joined the faculty of MIT in 1981, where he is now the Edwin Sibley Webster Professor in MIT’s Electrical Engineering and Computer Science Department. He is Associate Director and Chief Operating Officer of the MIT Computer Science and Artificial Intelligence Laboratory, the largest on-campus laboratory at MIT, where he also leads the Supertech research group and is a member of the Theory of Computation group.

Professor Leiserson's research centers on the theory of parallel computing, especially as it relates to engineering reality. He coauthored the first paper on systolic architectures. He invented the retiming method of digital-circuit optimization and developed the algorithmic theory behind it. On leave from MIT at Thinking Machines Corporation, he designed and led the implementation of the network architecture for the Connection Machine Model CM-5 Supercomputer. This machine was the world's most powerful supercomputer in the early 1990's, and it incorporated the "universal" fat-tree interconnection network he developed at MIT. Fat-trees are now the preferred interconnect strategy for Infiniband technology.