In this article we are going to delve into the exciting world of Charles E. Leiserson, a topic that has sparked the interest of many people throughout history. Charles E. Leiserson is a topic that has been widely studied and numerous books and articles have been written about over the years. In this article we aim to explore the different aspects of Charles E. Leiserson, from its origin to its practical applications in everyday life. Along these lines, we will discover what Charles E. Leiserson is, what its main characteristics are and why it is important to dedicate time and attention to it. In addition, we will analyze some of the theories and debates that have arisen around Charles E. Leiserson, as well as its impact on current society. Ultimately, this article aims to provide a comprehensive and enriching vision of Charles E. Leiserson, so that the reader can expand their knowledge and understand the importance of this topic in today's world.
Charles E. Leiserson | |
---|---|
Born | |
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 |
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.
Leiserson 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. Leiserson's dissertation, Area-Efficient VLSI Computation, won the first ACM Doctoral Dissertation Award in 1982.
He 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. 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.
During the 1980s, Leierson was on leave from M.I.T. at Thinking Machines Corporation, 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.
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. His bio lists two internationally recognized chess playing programs based on Cilk, the StarSocrates and the Cilkchess.
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.
Leierson received multiple research awards in 2013 and 2014 for the Cilk work (see below).
He 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.
Leiserson 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.
His father was Mark Leiserson, a professor of economics at Yale University.