All educational Awards,national educational awards,international educational awards in ...


Charles E. Leiserson Paris Kanellakis Award Awarded In 2013

Charles E. Leiserson

Charles E. Leiserson

Award Name : Paris Kanellakis Award

Year of Award : 2013

Award for : Science and Engineering

Location : Cambridge, Massachusetts, United States


Charles Eric Leiserson is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof; as part of this effort, he developed the Cilk multithreaded language. He invented the fat-tree interconnection network, a hardware-universal interconnection network used in many supercomputers, including the Connection Machine CM5, for which he was network architect. He helped pioneer the development of VLSI theory, including the retiming method of digital optimization with James B. Saxe and systolic arrays with H. T. Kung. 

He conceived of the notion of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally. He developed the Cilk language for multithreaded programming, which uses a provably good work-stealing algorithm for scheduling. Leiserson coauthored the standard algorithms textbook Introduction to Algorithms together with Thomas H. Cormen, Ronald L. Rivest, and Clifford Stein.He received Paris Kanellakis Award in 2013 for contributions to robust parallel and distributed computing. They developed provably efficient randomized “work-stealing” scheduling algorithms, and Cilk, a small set of linguistic primitives for programming multithreaded computations.


Paris Kanellakis Award Awardeds