 | Thisbiography of a living personneeds additionalcitations forverification. Please help by addingreliable sources.Contentious material about living persons that is unsourced orpoorly sourcedmust be removed immediately from the article and its talk page, especially if potentiallylibelous. Find sources: "K. Mani Chandy" – news ·newspapers ·books ·scholar ·JSTOR(January 2008) (Learn how and when to remove this message) |
Kanianthra Mani Chandy | |
|---|---|
| Born | (1944-10-25)25 October 1944 (age 81)[2] |
| Alma mater | Indian Institute of Technology, Madras (B.Tech., 1965) New York University Tandon School of Engineering (M.S., 1966) MIT (Ph.D., 1969) |
| Known for | BCMP network Chandy–Herzog–Woo method |
| Scientific career | |
| Institutions | Caltech |
| Thesis | Parametric Decomposition Programming (1969) |
| Doctoral advisor | Jeremy Frank Shapiro[1] |
| Doctoral students | |
Kanianthra Mani Chandy (born 25 October 1944) is the Simon Ramo Professor of Computer Science at theCalifornia Institute of Technology (Caltech).[4] He has been the Executive Officer of the Computer Science Department twice, and he has been a professor at Caltech since 1989. He also served as Chair of the Division of Engineering and Applied Science at the California Institute of Technology.[5]
Chandy received his Ph.D. from theMassachusetts Institute of Technology in Electrical Engineering with a thesis inoperations research. He also earned a Master's from the New York University, and a Bachelor's from theIndian Institute of Technology,Madras.
He has worked forHoneywell andIBM. From 1970 to 1989, he was in the Computer Science Department of theUniversity of Texas at Austin, serving as chair in 1978–79 and 1983–85. He has served as a consultant to a number of companies including IBM andBell Labs. He also served on the Engineering and Computer Science jury for theInfosys Prize in 2019.[6]
In 1984, along with J Misra, Chandy proposed a new solution to thedining-philosophers problem.[7]
Chandy does research indistributed computing. He has published three books and over a hundred papers on distributed computing, verification of concurrent programs,parallel programming languages and performance models of computing and communication systems, including the eponymousBCMP networks.[8] He described theChandy–Lamport algorithm together withLeslie Lamport.
He received theIEEE Koji Kobayashi Award for Computers and Communication in 1987, the A.A. Michelson Award from the Computer Measurement Group in 1985, and theIEEE Computer Society Charles Babbage Award in 1993.
Chandy was elected a member of theNational Academy of Engineering in 1995 for contributions to computer performance modeling, parallel discrete-event simulation, and systematic development of concurrent programs.
He was elected as anACM Fellow in 2019 "for contributions to queueing networks, performance analysis, distributed and parallel programming, and distributed simulation".[9]
