Biography:K. Mani Chandy

From HandWiki
K. Mani Chandy
Born
Kanianthra Mani Chandy

1944 (age 81–82)
Present-day Kerala, India
Alma mater
Known for
Awards
  • A. A. Michelson Award
  • IEEE Koji Kobayashi Computers and Communications Award
  • ACM SIGOPS Hall of Fame Award
  • Edsger W. Dijkstra Prize in Distributed Computing
  • Harry H. Goode Memorial Award
Scientific career
Fields
Institutions

Kanianthra Mani Chandy (born 1944), usually cited as K. Mani Chandy, is an Indian-born computer scientist and professor emeritus at the California Institute of Technology. He is the Simon Ramo Professor of Computer Science, Emeritus, in Caltech's Computing and Mathematical Sciences department.[1] His research has contributed to distributed computing, queueing networks, performance modeling, concurrent-program verification, parallel programming and event-driven systems.[1][2]

Chandy is known for work on BCMP networks, the Chandy–Lamport algorithm for distributed snapshots, the Chandy–Misra–Haas algorithm for distributed deadlock detection, the Chandy–Misra solution to the dining philosophers problem, and the UNITY approach to reasoning about parallel programs.[3][4][5][6]

Chandy was elected to the National Academy of Engineering in 1995 for contributions to computer performance modeling, parallel discrete-event simulation and the systematic development of concurrent programs.[7] He was named an ACM Fellow in 2019 for contributions to queueing networks, performance analysis, distributed and parallel programming, and distributed simulation.[8]

Early life and education

Chandy was born in Kerala, India to a Syrian Christian family.[9] In a Caltech Heritage Project interview, he said that "Mani" was his baptismal name and that it is a diminutive Malayalam form of the Hebrew name Immanuel.[9]

He received a Bachelor of Technology degree from IIT Madras in 1965, a master's degree from the Polytechnic Institute of Brooklyn in 1966, and a PhD from the Massachusetts Institute of Technology in 1969.[1][2] IIT Madras states that his bachelor's degree was in "Light Current" electrical engineering, or electronics, and that his MIT doctorate was in electrical engineering at the Operations Research Center.[2]

Career

After completing his doctorate, Chandy worked at Honeywell and IBM.[2] He then joined the Department of Computer Sciences at the University of Texas at Austin, where he served from 1970 to 1987 and chaired the department in 1978–1979 and 1983–1985.[2] His work at Texas included performance modeling, queueing networks, distributed algorithms and formal approaches to concurrent programming.

Chandy moved to Caltech in the late 1980s. Caltech's faculty profile lists him as a Sherman Fairchild Distinguished Scholar in 1988, a visiting professor in 1988–1989, professor from 1989 to 1997, Simon Ramo Professor from 1997 to 2014, and Simon Ramo Professor Emeritus from 2014 onward.[1] He served as executive officer for computer science from 1997 to 2000 and as deputy chair of Caltech's Division of Engineering and Applied Science from 2009 to 2012.[1]

Chandy's later work at Caltech has included "sense and respond" systems that use sensor networks, cloud computing and event-driven architectures to detect and respond to changes such as seismic events, threats involving radioactive material, fetal distress, and changes in the electrical power grid.[1] The IIT Madras Heritage Centre describes this later research as concerned with distributed command-and-control systems and applications to crisis management and homeland security.[2]

Research

Queueing networks and performance modeling

Chandy's early research contributed to queueing theory and computer-system performance modeling. With Forest Baskett, Richard Muntz and Fernando Palacios, he co-authored the 1975 Journal of the ACM paper "Open, closed, and mixed networks of queues with different classes of customers".[3] The class of product-form queueing networks described in that paper became known as BCMP networks.

Chandy also worked on decomposition and aggregation methods for analyzing queueing networks. With Ulrich Herzog and Lin Woo, he developed work later associated with the Chandy–Herzog–Woo method, also known as a flow-equivalent server or Norton's theorem approach in queueing networks.[10]

His book with Charles H. Sauer, Computer Systems Performance Modeling, presented performance-modeling methods for computer systems and queueing networks.[11] The National Academy of Engineering later cited his work in computer performance modeling as one of the reasons for his election.[7]

Distributed algorithms

Diagram of the Chandy–Lamport algorithm with three processes exchanging messages and marker tokens
Three-process illustration of the Chandy–Lamport snapshot algorithm

Chandy is widely cited for the Chandy–Lamport distributed snapshot algorithm, developed with Leslie Lamport. Their 1985 paper introduced an algorithm for recording a consistent global state of an asynchronous distributed computation.[4] Caltech's announcement of the paper's 2014 Edsger W. Dijkstra Prize states that the algorithm is fundamental for tasks such as termination detection, deadlock detection and determining whether a stable global property holds.[12]

The ACM's Turing Award biography of Lamport describes Chandy and Lamport as inventing the first algorithm for taking a snapshot of the state of an arbitrary distributed system, and notes that the idea was later used in networking, self-stabilization, debugging and distributed systems.[13] The paper received the ACM SIGOPS Hall of Fame Award in 2013 and the Edsger W. Dijkstra Prize in Distributed Computing in 2014.[14][15]

Chandy also co-authored work on distributed deadlock detection. The Chandy–Misra–Haas algorithm, developed with Jayadev Misra and Laura Haas, is based on detecting deadlocks in distributed systems through message-passing approaches.[5]

Concurrent and parallel programming

With Jayadev Misra, Chandy developed approaches to reasoning about concurrent and parallel programs. Their 1984 paper "The drinking philosophers problem" generalized the dining philosophers problem to arbitrary resource conflicts in distributed systems and proposed a distributed, starvation-free solution.[6]

Chandy and Misra also developed the UNITY formalism, presented in their 1988 book Parallel Program Design: A Foundation.[16] The IEEE Computer Society awarded Chandy and Misra the 2017 Harry H. Goode Memorial Award for "seminal contributions to distributed and parallel programming, including the development of the UNITY formalism".[17][18]

Event-driven and sensor systems

In later work, Chandy studied event-driven architectures, sensor networks and systems for responding to real-world events. Caltech describes his research as concerned with systems that sense and respond to seismic events, radiological threats, medical events and power-grid events, using sensor networks, cloud computing and event-driven architecture.[1] IIT Madras describes his later research as focused on distributed command-and-control systems and on "sense-and-respond" systems that identify significant changes in the environment and trigger appropriate responses.[2]

Awards and recognition

Chandy received the A. A. Michelson Award from the Computer Measurement Group in 1985.[2] He received the IEEE Koji Kobayashi Computers and Communications Award in 1996; IEEE's Engineering and Technology History Wiki lists him as the 1996 recipient.[19] He received the Charles Babbage Award associated with IPDPS in 1999.[20]

In 1995, Chandy was elected to the National Academy of Engineering for contributions to computer performance modeling, parallel discrete-event simulation, and the systematic development of concurrent programs.[7] The 1985 distributed snapshots paper by Chandy and Lamport received the ACM SIGOPS Hall of Fame Award in 2013 and the Edsger W. Dijkstra Prize in Distributed Computing in 2014.[14][15] In 2017, Chandy and Jayadev Misra received the IEEE Computer Society Harry H. Goode Memorial Award for their work in distributed and parallel programming, including UNITY.[17][18]

Chandy was named an ACM Fellow in 2019 for contributions to queueing networks, performance analysis, distributed and parallel programming, and distributed simulation.[8] IIT Madras conferred its Distinguished Alumnus Award on him in 2018.[21]

Selected publications

Books

  • Sauer, Charles H.; Chandy, K. Mani (1981). Computer Systems Performance Modeling. Prentice-Hall. ISBN 978-0-13-165175-3. 
  • Chandy, K. Mani; Misra, Jayadev (1988). Parallel Program Design: A Foundation. Addison-Wesley. ISBN 9780201058666. 
  • Chandy, K. Mani; Taylor, Stephen (1992). An Introduction to Parallel Programming. Jones and Bartlett. ISBN 9780867202083. 

Articles

  • Baskett, Forest; Chandy, K. Mani; Muntz, Richard R.; Palacios, Fernando G. (April 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. 
  • Chandy, K. Mani; Herzog, Ulrich; Woo, Lin S. (January 1975). "Parametric analysis of queueing networks". IBM Journal of Research and Development 19 (1): 36–42. doi:10.1147/rd.191.0036. 
  • Chandy, K. Mani; Misra, Jayadev; Haas, Laura M. (May 1983). "Distributed deadlock detection". ACM Transactions on Computer Systems 1 (2): 144–156. doi:10.1145/357360.357365. 
  • Chandy, K. Mani; Misra, Jayadev (October 1984). "The drinking philosophers problem". ACM Transactions on Programming Languages and Systems 6 (4): 632–646. doi:10.1145/1780.1804. 
  • Chandy, K. Mani; Lamport, Leslie (February 1985). "Distributed snapshots: determining global states of distributed systems". ACM Transactions on Computer Systems 3 (1): 63–75. doi:10.1145/214451.214456. 

See also

References

  1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 1.6 "Kanianthra M. (Mani) Chandy". California Institute of Technology, Computing and Mathematical Sciences. https://www.cms.caltech.edu/people/mani. 
  2. ↑ 2.0 2.1 2.2 2.3 2.4 2.5 2.6 2.7 "Dr. Kanianthra Mani Chandy". IIT Madras Heritage Centre. https://heritage.iitm.ac.in/node/6056. 
  3. ↑ 3.0 3.1 Baskett, Forest; Chandy, K. Mani; Muntz, Richard R.; Palacios, Fernando G. (April 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. 
  4. ↑ 4.0 4.1 Chandy, K. Mani; Lamport, Leslie (February 1985). "Distributed snapshots: determining global states of distributed systems". ACM Transactions on Computer Systems 3 (1): 63–75. doi:10.1145/214451.214456. 
  5. ↑ 5.0 5.1 Chandy, K. Mani; Misra, Jayadev; Haas, Laura M. (May 1983). "Distributed deadlock detection". ACM Transactions on Computer Systems 1 (2): 144–156. doi:10.1145/357360.357365. 
  6. ↑ 6.0 6.1 Chandy, K. Mani; Misra, Jayadev (October 1984). "The drinking philosophers problem". ACM Transactions on Programming Languages and Systems 6 (4): 632–646. doi:10.1145/1780.1804. 
  7. ↑ 7.0 7.1 7.2 "Dr. K. Mani Chandy". National Academy of Engineering. https://www.nae.edu/28292/Dr-K-Mani-Chandy. 
  8. ↑ 8.0 8.1 "Kanianthra Mani Chandy 1944". Association for Computing Machinery. https://awards.acm.org/award_winners/chandy_4104642. 
  9. ↑ 9.0 9.1 Zierler, David (5 July 2022). "Kanianthra M. (Mani) Chandy, Computer Scientist". Caltech Heritage Project. https://heritageproject.caltech.edu/interviews-updates/mani-chandy. 
  10. ↑ Chandy, K. Mani; Herzog, Ulrich; Woo, Lin S. (January 1975). "Parametric analysis of queueing networks". IBM Journal of Research and Development 19 (1): 36–42. doi:10.1147/rd.191.0036. 
  11. ↑ Sauer, Charles H.; Chandy, K. Mani (1981). Computer Systems Performance Modeling. Prentice-Hall. ISBN 978-0-13-165175-3. 
  12. ↑ "Professor Chandy's Paper Wins Edsger W. Dijkstra Prize in Distributed Computing". California Institute of Technology, Division of Engineering and Applied Science. 2 June 2014. https://www.eas.caltech.edu/news/professor-chandys-paper-wins-edsger-w-dijkstra-prize-in-distributed-computing. 
  13. ↑ "Leslie Barry Lamport: A.M. Turing Award Laureate". Association for Computing Machinery. https://amturing.acm.org/award_winners/lamport_1205376.cfm. 
  14. ↑ 14.0 14.1 "Professor Chandy's Paper Wins Hall of Fame Award". California Institute of Technology, Information Science and Technology. 23 September 2013. https://ist.caltech.edu/news/professor-chandys-paper-wins-hall-of-fame-award. 
  15. ↑ 15.0 15.1 "The 2014 Edsger W. Dijkstra Prize in Distributed Computing". DISC 2014. https://www.disc-conference.org/wp/mirrors/disc2014/dijkstra-prize/index.html. 
  16. ↑ Chandy, K. Mani; Misra, Jayadev (1988). Parallel Program Design: A Foundation. Addison-Wesley. ISBN 9780201058666. 
  17. ↑ 17.0 17.1 "Professor Chandy Receives Harry H. Goode Memorial Award". California Institute of Technology, Division of Engineering and Applied Science. 9 May 2017. https://www.eas.caltech.edu/news/professor-chandy-receives-harry-h-goode-memorial-award. 
  18. ↑ 18.0 18.1 Norman, Staci R. (27 June 2017). "Jayadev Misra and Mani Chandy Win Harry H. Goode Memorial Award". University of Texas at Austin Department of Computer Science. https://www.cs.utexas.edu/news/2017/jayadev-misra-and-mani-chandy-win-harry-h-goode-memorial-award. 
  19. ↑ "IEEE Koji Kobayashi Computers and Communications Award". Engineering and Technology History Wiki. https://ethw.org/IEEE_Koji_Kobayashi_Computers_and_Communications_Award. 
  20. ↑ "IEEE-Computer Society Charles Babbage Award". IEEE International Parallel and Distributed Processing Symposium. https://www.ipdps.org/babbage_award.htm. 
  21. ↑ "Distinguished Alumnus Awards: Dr. Kanianthra Mani Chandy". IIT Madras Heritage Centre. https://heritage.iitm.ac.in/distinguished-alumnus-awards?field_daa_department_target_id=All&field_daa_year_awarded_value=&field_daa_year_graduated_value=&page=5&title=. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:K._Mani_Chandy&oldid=4408042"