Charles Eric Leiserson (born 1953) is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.
Charles E. Leiserson | |
|---|---|
 Charles E. Leiserson | |
| Born | November 10, 1953[1] |
| Nationality | American |
| Alma mater | Carnegie Mellon University Yale University |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Massachusetts Institute of Technology |
| Thesis | Area-Efficient VLSI Computation (1981) |
| Doctoral advisor | H. T. Kung Jon Bentley |
Education
editLeiserson received a Bachelor of Science degree in computer science and mathematics from Yale University in 1975 and a PhD degree in computer science from Carnegie Mellon University in 1981, where his advisors were Jon Bentley and H. T. Kung.[2] Leiserson's dissertation, Area-Efficient VLSI Computation, won the first ACM Doctoral Dissertation Award in 1982.
Work career
editHe joined the faculty of the Massachusetts Institute of Technology in 1981, where he eventually became the Edwin Sibley Webster professor Electrical Engineering and Computer Science Department.[3] Preceding this, he was associate director and Chief Operating Officer of the MIT Computer Science and Artificial Intelligence Laboratory and principal of the Theory of Computation research group. He lists himself as Faculty Director of the MIT-Air Force AI Accelerator, which is designed to make fundamental advances in artificial intelligence to improve Department of the Air Force operations while also addressing broader societal needs.[3]
Thinking Machines
editDuring the 1980s, Leierson was on leave from M.I.T. at Thinking Machines Corporation,[3] where 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.
VLSI and caching methods
editHe 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.
Cilk programming language
editHe developed the Cilk language for multithreaded programming, which uses a provably good work-stealing algorithm for scheduling. His bio lists two internationally recognized chess playing programs based on Cilk, the StarSocrates and the Cilkchess.[3]
- See Cilk for details on the programming language
Following this, he was founder and chief technology officer of the Cilk Arts, Inc. startup, developing Cilk-based technology for multicore computing applications. The company was acquired by Intel in 2009, upon which Leierson initiated the open source OpenCilk movement.[3][4]
Leierson received multiple research awards in 2013 and 2014 for the Cilk work (see below).
Akamai
editHe was formerly director of research and director of system architecture for Akamai Technologies in Boston, a company that developed content distribution networks in the late 1990s. The company grew out of the research made at M.I.T., and where his Ph.D. student Robert Blumofe was Executive Vice President.[5]
Textbooks
editLeiserson coauthored the standard algorithms textbook Introduction to Algorithms together with Thomas H. Cormen, Ronald L. Rivest, and Clifford Stein. Leierson mentions this was elected the "Best 1990 Professional and Scholarly Book in Computer Science and Data Processing" by the Association of American Publishers.[3]
Awards and honors
edit- 1981 Fannie and John Hertz Foundation’s Doctoral Thesis Award.[6]
- 1982 ACM Doctoral Dissertation Award for his Ph.D. thesis, Area-Efficient VLSI Computation
- 1985 National Science Foundation awarded him Presidential Young Investigator Award.
- 2007 elected Margaret MacVicar Faculty Fellow at MIT, the highest recognition at MIT for undergraduate teaching.[7]
- 2013 Paris Kanellakis Award from ACM, with his PhD student Robert D. Blumofe, for "contributions to robust parallel and distributed computing", in particular the work-stealing scheduling and the Cilk research.[8]
- 2014 Taylor L. Booth Education Award from the IEEE Computer Society "for worldwide computer science education impact through writing a best-selling algorithms textbook, and developing courses on algorithms and parallel programming."[9]
- 2014 Ken Kennedy Award from ACM-IEEE Computer Society for his "enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development." He was also cited for "distinguished mentoring of computer science leaders and students."[5]
- Elected as Fellow of the Association for Computing Machinery (ACM), the American Association for the Advancement of Science (AAAS), the Institute of Electrical and Electronics Engineers (IEEE), and the Society for Industrial and Applied Mathematics (SIAM).
Personal life
editHis father was Mark Leiserson, a professor of economics at Yale University.[10]
References
edit- ^ Resume
- ^ Charles Eric Leiserson at the Mathematics Genealogy Project
- ^ a b c d e f Charles Leierson: BIO from mit.edu, last accessed on 9 February 2024.
- ^ Programming in Cilk from cilk.mit.edu, last accessed on 8 February 2024.
- ^ a b ACM, IEEE Computer Society Recognize Charles E. Leiserson for Advances in Parallel Computing Systems, press release from acm.org on 12 September 2014.
- ^ Charles Leiserson, PhD, 1977 Hertz Fellow from hertzfoundation.org, last accessed on 8 February 2024.
- ^ MacVicar Day Celebrates Learning, MIT Professors, press release from The Tech, 6 March 2007
- ^ Charles Leiserson receives ACM Kanellakis Award, press release from csail.mit.edu on 16 April 2014.
- ^ 2014 Booth Award, press release from IEEE Computer Society on 25 February 2014.
- ^ Mark Leiserson: Noted international economist, obituary from Yale University on 30 August 2002.