Jayadev Misra
| |
|---|---|
 | |
| Born | (1947-10-17)October 17, 1947
India
|
| Citizenship | US |
| Alma mater |
|
| Known for | Contributions in formal aspects of distributed and concurrent computing, in particular, projects Unity and Orc. |
| Scientific career | |
| Fields | Computer science |
| Institutions | |
| Thesis | A Study of Strategies for Multistage Testing (1972) |
| Doctoral advisor | Harlan Mills |
| Website | "Jayadev Misra". |
| Notes | |
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).
Misra received a B.Tech.inelectrical 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.
Misra and K. Mani Chandy have made a number of important contributions in the area of concurrent computing. They developed a programming 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.
| International |
|
|---|---|
| National |
|
| Academics |
|
| Other |
|
