The Society for Industrial and Applied Mathematics has named CSAIL principal investigator Charles E. Leiserson as one of its 2015 Fellows for his “enduring influence on parallel computing systems and their adoption into mainstream use through scholarly research and development.”
Leiserson introduced the concept of cache-oblivious algorithms, which are able to exploit the memory hierarchy at a near optimal level, despite not having any tuning parameters for cache size or cache-line length. He also created the Cilk multithreaded programming technology, and spurred the development of multiple Cilk-based chess-playing programs, winning numerous prizes in international competition.
A professor in MIT's Department of Electrical Engineering and Computer Science (EECS), Leiserson heads CSAIL’s Supertech Research Group, which investigates scalable computing technologies. He coauthored the influential textbook “Introduction to Algorithms”, and has developed multiple courses on algorithms and parallel programming.
This past year Leiserson was also the recipient of ACM’s Ken Kennedy Award, as well as the Paris Kanellakis Theory and Practice Award, alongside his former PhD student Robert D. Blumofe.
The Fellows program is intended to recognize excellence in research, industrial work, educational activities that reach a broad audience, or other forms of excellence directly related to the goals of SIAM.
Leiserson will be formally recognized at a special luncheon at ICIAM 2015, which will take place August 10-14 in Beijing, China.
Read more at the SIAM website: http://fellows.siam.org/index.php?sort=year&value=2015
Research Themes:
News Image:
