Jayadev Misra Explained

Jayadev Misra
Birth Date:17 October 1947
Birth Place:India
Citizenship:US
Alma Mater:
Thesis Title:A Study of Strategies for Multistage Testing
Thesis Url:https://www.proquest.com/docview/302666628
Thesis Year:1972
Doctoral Advisor:Harlan Mills
Fields:Computer science
Known For:Contributions in formal aspects of distributed and concurrent computing, in particular, projects Unity and Orc.
Website:Web site: Jayadev Misra.

Jayadev Misra is an Indian-born computer scientist who has spent most of his professional career in the United States. He is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at the University of Texas at Austin. Professionally he is known for his contributions to the formal aspects of concurrent programming and for jointly spearheading, with Sir Tony Hoare, the project on Verified Software Initiative (VSI).

Education and early career

Misra received a B.Tech. in electrical engineering from IIT Kanpur, India in 1969 and a Ph.D. in electrical engineering and computer science from the Johns Hopkins University, Baltimore, Maryland in 1972. After a brief period working for IBM, he joined the University of Texas at Austin in 1974 where he has remained throughout his career, except for a sabbatical year spent at Stanford University during 1983–1984. He retired from active teaching in 2015.

Major professional contributions

Misra and K. Mani Chandy have made a number of important contributions in the area of concurrent computing. They developed aprogramming notation and a logic, called UNITY, to describe concurrent computations. Leslie Lamport says: "The first major step in getting beyond traditional programming languages to describe concurrent algorithms was Misra and Chandy's Unity"[1] and"Misra and Chandy developed proof rules to formalize the style of reasoning that had been developed for proving invariance and leads-to properties. Unity provided the most elegant formulation yet for these proofs."[2]

Misra and Chandy (and, independently, Randy Bryant) have developed a conservative algorithm for distributed discrete-event simulation, which is now commonly used in a variety of areas. They also developed a number of fundamental algorithms for resource allocation (the drinking philosophers problem), deadlock detection, graph algorithms, and a theory of knowledge transmission in distributed systems. In collaboration with David Gries, Misra proposed the first algorithm for the heavy-hitters problem. Misra proposed a set of axioms for concurrent memory access that underlie the theory of linearizability.

Misra's most recent research project, called Orc,[3] attempts to develop an algebra of concurrent computing that will help integrate different pieces of software for concurrent execution.

Awards and honors

Selected publications

Notes and References

  1. Leslie. Lamport. The Temporal Logic of Actions. 79 . May 1994. Microsoft. ACM Transactions on Programming Languages and Systems 16.
  2. Verification and specification of concurrent programs. Leslie. Lamport. Leslie Lamport. Basic concepts. 1994. A Decade of Concurrency Reflections and Perspectives. Lecture Notes in Computer Science (LNCS). 803. Distributed Systems, Methods and Tools for Specification. An Advanced Course. Springer, Berlin, Heidelberg. 352 . 10.1007/3-540-58043-3_23.
  3. Web site: Orc Language . Composed 2009.
  4. Web site: IFIP Announces 2023 Awards. 26 October 2023. IFIP. 2023-11-03. https://web.archive.org/web/20231103090624/https://www.ifipnews.org/ifip-announces-2023-awards/. 2023-11-03.
  5. Web site: NAE Website - Dr. Jayadev Misra. NAE. 2023-11-03. Composed 2018.
  6. Web site: Docteur Honoris Causa ENS-PARIS-SACLAY.
  7. Web site: Two UTCS Faculty Among the Most Highly Cited Researchers | Department of Computer Science. Computer Science Department, UT Austin. https://web.archive.org/web/20151225084507/https://www.cs.utexas.edu/news/2004/two-utcs-faculty-among-most-highly-cited-researchers. 2015-12-25. 2023-11-03. Composed 2004 .
  8. Web site: ACM Fellows. ACM. 2023-11-03. Composed 1995.
  9. Web site: IEEE Fellows Directory - Chronological Listing . IEEE. 2023-11-03.
  10. Web site: Past Distinguished Alumnus Awardees (DAA). IIT Kanpur. 2023-11-03.
  11. Web site: Members - TAMEST (The Academy of Medicine, Engineering and Science of Texas). TAMEST. https://web.archive.org/web/20231018033435/https://tamest.org/members/. 2023-10-18. 2023-11-03.
  12. Book: Misra. Jayadev. Jayadev Misra. Chandy. K. Mani. K. Mani Chandy. 1988. Parallel Program Design - a Foundation. Addison-Wesley. 978-0-201-05866-6.
  13. Misra. Jayadev. Jayadev Misra. March 1986. Distributed discrete-event simulation. ACM Computing Surveys. 18. 1. 39–65. 10.1145/6462.6485. 18130323.
  14. Misra. Jayadev. Jayadev Misra. Chandy. K. Mani. K. Mani Chandy. July 1981. Proofs of networks of processes. IEEE Transactions on Software Engineering. SE-7. 4. 417–426. 10.1109/TSE.1981.230844. 15624919.
  15. Misra. Jayadev. Jayadev Misra. Chandy. K. Mani. K. Mani Chandy. Haas. LAURA M.. May 1983. Distributed deadlock detection. ACM Transactions on Computer Systems. 1. 2. 144–156. 10.1145/357360.357365. 9147318. free.
  16. Misra. Jayadev. Jayadev Misra. Chandy. K. Mani. K. Mani Chandy. October 1984. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems. 6. 4. 632–646. 10.1145/1780.1804. 5922362. free.
  17. Misra. Jayadev. Jayadev Misra. Gries. David. David Gries. November 1982. Finding repeated elements. Science of Computer Programming. 2. 2. 143–152. 10.1016/0167-6423(82)90012-0. free. 1813/6345. free.
  18. Misra. Jayadev. Jayadev Misra. Chandy. K. Mani. K. Mani Chandy. August 1985. How processes learn. PODC 85: Proceedings of the fourth annual ACM Symposium on Principles of Distributed Computing. 204–214. Association for Computing Machinery. Minaki, Ontario, Canada. 10.1145/323596.323615.
  19. Kitchin. David. Quark. Adrian. Cook. William. Misra. Jayadev. The Orc Programming Language. Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 . 2009. 204–214. Lecture Notes in Computer Science . David Lee . Antónia Lopes . Arnd Poetzsch-Heffter. 5522. Springer Verlag. 10.1007/978-3-642-02138-1_1. free.
  20. Misra. Jayadev. Jayadev Misra. January 1986. Axioms for memory access in asynchronous hardware systems. ACM Transactions on Programming Languages and Systems. 8. 1. 142–153. 10.1145/5001.5007. 1326311. free.
  21. Misra. Jayadev. Jayadev Misra. November 1994. Powerlist: A structure for parallel recursion. ACM Transactions on Programming Languages and Systems. 16. 6. 1737–1767. 10.1145/197320.197356. 2913474. free.
  22. Hoare. Tony. Tony Hoare. Misra. Jayadev. Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project. 2008. Verified Software: Theories, Tools, Experiments. VSTTE 2005. Lecture Notes in Computer Science. B. Meyer, J. Woodcock. 4171. Springer Verlag. 10.1007/978-3-540-69149-5_1. free.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Jayadev Misra".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.