K. Mani Chandy

Kanianthra Mani Chandy
Born (1944-10-25) October 25, 1944[1]
Kottayam, India[2]
Institutions Caltech
Alma mater Indian Institute of Technology (B.Tech., 1965)
Polytechnic Institute of Brooklyn (M.S., 1966)
MIT (Ph.D., 1969)
Thesis Parametric Decomposition Programming (1969)
Doctoral advisor Jeremy Frank Shapiro[3]
Doctoral students Roman Ginis
Laura M. Haas
Peter Hofstee
Joseph Kiniry
Charlie Sauer
Eve Schooler
Don Towsley
Daniel M. Zimmerman
Known for BCMP network
Chandy–Herzog–Woo method

Kanianthra Mani Chandy (born October 25, 1944) is the Simon Ramo Professor of Computer Science at the California 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]

Early life and education

Chandy received his Ph.D. from the Massachusetts Institute of Technology in Electrical Engineering with a thesis in Operations research. He also earned a Master's from the Polytechnic Institute of Brooklyn, and a Bachelor's from the Indian Institute of Technology, Madras.


He has worked for Honeywell and IBM. From 1970 to 1989, he was in the Computer Science Department of the University 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 and Bell Labs. Chandy is a member of the National Academy of Engineering. He received the IEEE Koji Kobayashi Award for Computers and Communication in 1987 and the A.A. Michelson Award from the Computer Measurement Group in 1985.

In 1984, along with J Misra, Chandy proposed a new solution to Dining philosophers problem.[6]

Chandy does research in distributed 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 eponymous BCMP networks.[7] He described the Chandy-Lamport algorithm together with Leslie Lamport.


  1. Who's who in the West. Marquis-Who's Who. 1996. p. 141.
  2. Keralites in America. K.P. Andrews for Literary Market Review. 1983. p. 151.
  3. K. Mani Chandy at the Mathematics Genealogy Project
  4. K. M. Chandy at the Caltech Directory
  5. http://mascots.cs.vt.edu/mascots2012/index.html%3Fpage_id=451.html
  6. Chandy, K.M.; Misra, J. (1984). The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems.
  7. Baskett, Forest; Chandy, K. Mani; Muntz, R.R.; Palacios, F.G. (1975). "Open, closed and mixed networks of queues with different classes of customers". Journal of the ACM. 22 (2): 248–260. doi:10.1145/321879.321887.

External links

This article is issued from Wikipedia - version of the 11/22/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.