K. Mani Chandy

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Kanianthra Mani Chandy
Born (1944-10-25) 25 October 1944 (age 74)[1]
Alma materIndian Institute of Technology (B.Tech., 1965)
New York University Tandon School of Engineering (M.S., 1966)
MIT (Ph.D., 1969)
Known forBCMP network
Chandy–Herzog–Woo method
Scientific career
InstitutionsCaltech
ThesisParametric Decomposition Programming (1969)
Doctoral advisorJeremy Frank Shapiro[3]
Doctoral studentsLaura M. Haas
Peter Hofstee
Don Towsley

Kanianthra Mani Chandy (born 25 October 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[edit]

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 New York University, and a Bachelor's from the Indian Institute of Technology, Madras.

Career[edit]

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, the A.A. Michelson Award from the Computer Measurement Group in 1985, and the IEEE Computer Society Charles Babbage Award in 1993.

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.

References[edit]

  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. ^ "Keynote 2: Prof. Chandy - Prof. K. Mani Chandy, Caltech - 'Modeling Complex Socio-Technical Systems on Massively Parallel Computers'". IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. Retrieved 19 May 2018.
  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[edit]