Charles Leiserson
| Charles E. Leiserson | |
|---|---|
Charles E. Leiserson
|
|
| Born |
November 10, 1953 Oslo, Norway |
| Residence | United States |
| Nationality | American |
| Fields | Computer Science |
| Institutions | Massachusetts Institute of Technology |
| Alma mater |
Carnegie Mellon University Yale University |
| Thesis | Area-Efficient VLSI Computation (1981) |
| Doctoral advisor |
H. T. Kung Jon Bentley |
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.
Leiserson received a B.S. degree in computer science and mathematics from Yale University in 1975 and a Ph.D. degree in computer science from Carnegie Mellon University in 1981, where his advisors were Jon Bentley and H. T. Kung.
...
Wikipedia