[go: nahoru, domu]
Jump to content

Charles E. Leiserson: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Correct affiliation.
RuiQi (talk | contribs)
63 edits
mNo edit summary
 
(107 intermediate revisions by 77 users not shown)
Line 1: Line 1:
{{Short description|American computer scientist}}
'''Charles 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 also helped pioneer the development of VLSI theory.
{{Infobox scientist
| name = Charles E. Leiserson
| image = Charles E Leiserson 2011.jpg
| caption = Charles E. Leiserson
| birth_date = {{birth date and age|1953|11|10}}<ref name="BirthDate">[http://people.csail.mit.edu/cel/resume/index.html Resume]</ref>
| birth_place = [[Oslo]], [[Norway]]
| death_date =
| death_place =
| nationality = [[United States|American]]
| field = [[Computer Science]]
| work_institution = [[Massachusetts Institute of Technology]]
| alma_mater = [[Carnegie Mellon University]]<br>[[Yale University]]
| thesis_title = Area-Efficient VLSI Computation
| thesis_year = 1981
| doctoral_advisor = [[H. T. Kung]]<br />[[Jon Bentley (computer scientist)|Jon Bentley]]
| doctoral_students =
}}


'''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]].
⚫
He 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 advisor was [[H. T. Kung]].


==Education==
He then joined the faculty of the [[Massachusetts Institute of Technology]], where he is now a [[Professor]]. In addition, he is a principal in the Theory of Computation research group in the [[MIT Computer Science and Artificial Intelligence Laboratory]], as well as Director of Research for [[Akamai Technologies]].
⚫
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 (computer scientist)|Jon Bentley]] and [[H. T. Kung]].<ref>{{mathgenealogy|id=50312|name=Charles Eric Leiserson}}</ref> Leiserson's [[dissertation]], ''Area-Efficient VLSI Computation'', won the first [[ACM Doctoral Dissertation Award]] in 1982.


==Work career==
His [[dissertation]], ''Area-Efficient VLSI Computation'', won the first [[Association for Computing Machinery|ACM]] Doctoral Dissertation Award. In [[1985]], the [[National Science Foundation]] awarded him a Presidential Young Investigator Award.
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.<ref name="bio">[https://www.csail.mit.edu/person/charles-e-leiserson Charles Leierson: BIO] from mit.edu, last accessed on 9 February 2024.</ref> 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.<ref name="bio"/>


''See also:'' [[Systolic array]], [[Thinking Machines]]
===Thinking Machines===
During the 1980s, Leierson was on leave from M.I.T. at [[Thinking Machines Corporation]],<ref name="bio"/> 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===
==Further reading==
He helped pioneer the development of VLSI theory, including the [[retiming]] method of digital optimization with [[James B. Saxe]] and [[systolic array]]s with [[H. T. Kung]]. He conceived of the notion of [[cache-oblivious algorithm]]s, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally.
* Thomas H. Cormen, Charles Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 1990

===Cilk programming language===
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.<ref name="bio"/>
: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 [[Multi-core (computing)|multicore computing]] applications. The company was acquired by [[Intel]] in 2009, upon which Leierson initiated the open source OpenCilk movement.<ref name="bio"/><ref>[https://cilk.mit.edu/programming/ Programming in Cilk] from cilk.mit.edu, last accessed on 8 February 2024.</ref>

Leierson received multiple research awards in 2013 and 2014 for the Cilk work (see below).

===Akamai===
He was formerly director of research and director of system architecture for [[Akamai Technologies]] in [[Boston]], a company that developed [[content distribution network]]s 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.<ref name="kenkennedy"/>

===Textbooks===
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]].<ref name="bio"/>

==Awards and honors==
*1981 [[Hertz Foundation|Fannie and John Hertz Foundation]]’s Doctoral Thesis Award.<ref>[https://www.hertzfoundation.org/person/charles-leiserson/ Charles Leiserson, PhD, 1977 Hertz Fellow] from hertzfoundation.org, last accessed on 8 February 2024.</ref>
*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.<ref>[https://thetech.com/2007/03/06/macvicar-v127-n9 MacVicar Day Celebrates Learning, MIT Professors], press release from The Tech, 6 March 2007</ref>
*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.<ref>[https://www.csail.mit.edu/news/charles-leiserson-receives-acm-kanellakis-award Charles Leiserson receives ACM Kanellakis Award], press release from csail.mit.edu on 16 April 2014.</ref>
*2014 [[Taylor Booth (mathematician)|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."<ref>[https://www.computer.org/press-room/news-archive/2014-booth-award 2014 Booth Award], press release from IEEE Computer Society on 25 February 2014.</ref>
*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."<ref name="kenkennedy">[https://www.acm.org/media-center/2014/september/acm-ieee-computer-society-recognize-charles-e.-leiserson-for-advances-in-parallel-computing-systems ACM, IEEE Computer Society Recognize Charles E. Leiserson for Advances in Parallel Computing Systems], press release from acm.org on 12 September 2014.</ref>
*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==
His father was Mark Leiserson, a professor of economics at [[Yale University]].<ref>[http://archives.news.yale.edu/v31.n1/story20.html Mark Leiserson: Noted international economist], obituary from Yale University on 30 August 2002.</ref>

==References==
{{Reflist}}


==External links==
==External links==
* [http://theory.lcs.mit.edu/~cel/ Home page]
* [http://supertech.csail.mit.edu/~cel/ Home page]

** [http://theory.lcs.mit.edu/~cel/bio.html Brief Biography]
{{Kanellakis Award laureates}}

{{Authority control}}


{{DEFAULTSORT:Leiserson, Charles}}
{{bio-stub}}
[[Category:American computer scientists]]
[[Category:American theoretical computer scientists]]
[[Category:Massachusetts Institute of Technology faculty]]
[[Category:2006 Fellows of the Association for Computing Machinery]]
[[Category:Living people]]
[[Category:Researchers in distributed computing]]
[[Category:Yale University alumni]]
[[Category:Carnegie Mellon University alumni]]
[[Category:1953 births]]
[[Category:American chief technology officers]]

Latest revision as of 04:24, 25 June 2024

Charles E. Leiserson
Charles E. Leiserson
Born (1953-11-10) November 10, 1953 (age 70)[1]
Oslo, Norway
NationalityAmerican
Alma materCarnegie Mellon University
Yale University
Scientific career
FieldsComputer Science
InstitutionsMassachusetts Institute of Technology
Thesis Area-Efficient VLSI Computation  (1981)
Doctoral advisorH. 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.

Education

[edit]

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.[2] Leiserson's dissertation, Area-Efficient VLSI Computation, won the first ACM Doctoral Dissertation Award in 1982.

Work career

[edit]

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.[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

[edit]

During 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

[edit]

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.

Cilk programming language

[edit]

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.[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

[edit]

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.[5]

Textbooks

[edit]

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.[3]

Awards and honors

[edit]

Personal life

[edit]

His father was Mark Leiserson, a professor of economics at Yale University.[10]

References

[edit]
  1. ^ Resume
  2. ^ Charles Eric Leiserson at the Mathematics Genealogy Project
  3. ^ a b c d e f Charles Leierson: BIO from mit.edu, last accessed on 9 February 2024.
  4. ^ Programming in Cilk from cilk.mit.edu, last accessed on 8 February 2024.
  5. ^ 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.
  6. ^ Charles Leiserson, PhD, 1977 Hertz Fellow from hertzfoundation.org, last accessed on 8 February 2024.
  7. ^ MacVicar Day Celebrates Learning, MIT Professors, press release from The Tech, 6 March 2007
  8. ^ Charles Leiserson receives ACM Kanellakis Award, press release from csail.mit.edu on 16 April 2014.
  9. ^ 2014 Booth Award, press release from IEEE Computer Society on 25 February 2014.
  10. ^ Mark Leiserson: Noted international economist, obituary from Yale University on 30 August 2002.
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Charles_E._Leiserson&oldid=1230867143"