Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Jayadev Misra
open-in-new
<h2 id="education-and-early-career">Education and early career</h2> <p>Misra received a <a href="/facts/Bachelor_of_Technology/uBDxBbm0">B.Tech.</a> in <a href="/facts/Electrical_engineering/YYXW1KLW">electrical engineering</a> from <a href="/facts/IIT_Kanpur/Xr7t3nfR">IIT Kanpur</a>, India in 1969 and a <a href="/facts/Ph.D./paJumdN8">Ph.D.</a> in electrical engineering and computer science from the <a href="/facts/Johns_Hopkins_University/56US0mHw">Johns Hopkins University</a>, Baltimore, Maryland in 1972. After a brief period working for IBM, he joined the <a href="/facts/University_of_Texas_at_Austin/6NApstxT">University of Texas at Austin</a> in 1974 where he has remained throughout his career, except for a sabbatical year spent at <a href="/facts/Stanford_University/JEQeF9z2">Stanford University</a> during 1983–1984. He retired from active teaching in 2015. </p> <h2 id="major-professional-contributions">Major professional contributions</h2> <p>Misra and <a href="/facts/K._Mani_Chandy/RRdCypvB">K. Mani Chandy</a> have made a number of important contributions in the area of concurrent computing. They developed a programming notation and a logic, called <a href="/facts/UNITY_(programming_language)/HedwxILy">UNITY</a>, to describe concurrent computations. <a href="/facts/Leslie_Lamport/jGCarz9C">Leslie Lamport</a> says: "The first major step in getting beyond traditional programming languages to describe concurrent algorithms was Misra and Chandy's Unity"<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> 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."<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p><p>Misra and Chandy (and, independently, <a href="/facts/Randy_Bryant/RbH7KB3n">Randy Bryant</a>) 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), <a href="/facts/Chandy%25E2%2580%2593Misra%25E2%2580%2593Haas_algorithm_resource_model/V60S7wwJ">deadlock detection</a>, graph algorithms, and a theory of knowledge transmission in distributed systems. In collaboration with <a href="/facts/David_Gries/36zCYJT8">David Gries</a>, Misra proposed the first algorithm for the <a href="/facts/Misra%25E2%2580%2593Gries_heavy_hitters_algorithm/KK1IU9bb">heavy-hitters problem</a>. Misra proposed a set of axioms for concurrent memory access that underlie the theory of linearizability. </p><p>Misra's most recent research project, called <a href="/facts/Orc_(programming_language)/7wBC5Wza">Orc</a>,<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> attempts to develop an algebra of concurrent computing that will help integrate different pieces of software for concurrent execution. </p> <h2 id="awards-and-honors">Awards and honors</h2> <ul><li><a href="/facts/IFIP/RgTMBVN9">IFIP</a> Fellow, 2023. <a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a></li> <li>Member, <a href="/facts/National_Academy_of_Engineering/6RCqfvXM">National Academy of Engineering</a>, 2018. <a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a></li> <li><a href="/facts/Harry_H._Goode_Memorial_Award/sJG6e77D">Harry H. Goode Memorial Award</a>, IEEE, 2017.</li> <li>Doctor Honoris Causa, <a href="/facts/%25C3%2589cole_normale_sup%25C3%25A9rieure_Paris-Saclay/QXh5AP61">École normale supérieure Paris-Saclay</a>, Cachan, France, 2010.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></li> <li><a href="/facts/Guggenheim_Fellowship/SuatTbVK">Guggenheim Fellowship</a>, 1988.</li> <li>Identified as a "highly cited researcher" by Thomson Reuters ISI, 2004.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li> <li><a href="/facts/Association_for_Computing_Machinery/abI2atlP">ACM</a> Fellow, 1995.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></li> <li><a href="/facts/Institute_of_Electrical_and_Electronics_Engineers/UddC4pUW">IEEE</a> Fellow, 1992.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></li> <li>Distinguished alumnus, <a href="/facts/IIT_Kanpur/Xr7t3nfR">IIT Kanpur</a>, <a href="/facts/India/1kKHcnxM">India</a>, <a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></li> <li>Member, <a href="/facts/Academy_of_Medicine%2c_Engineering_and_Science_of_Texas/E6MtatX3">TAMEST</a> (The Academy of Medicine, Engineering and Science of Texas), 2018.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a></li></ul> <h2 id="selected-publications">Selected publications</h2> <ul><li><i>Effective Theories in Programming Practice</i>, ACM Books, 2023</li> <li><i>Parallel Program Design - a Foundation</i> (with K.M. Chandy), 1988<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a></li> <li>Distributed discrete-event simulation, 1986<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a></li> <li>Proofs of networks of processes (with <a href="/facts/K._Mani_Chandy/RRdCypvB">Mani Chandy</a>), 1981<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a></li> <li>Distributed deadlock detection (with <a href="/facts/K._Mani_Chandy/RRdCypvB">Mani Chandy</a> and Laura M. Haas), 1983<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a></li> <li>The drinking philosophers problem (with <a href="/facts/K._Mani_Chandy/RRdCypvB">Mani Chandy</a>), 1984<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a></li> <li>Finding repeated elements (with <a href="/facts/David_Gries/36zCYJT8">David Gries</a>), 1982<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li> <li>How processes learn (with <a href="/facts/K._Mani_Chandy/RRdCypvB">Mani Chandy</a>), 1985<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></li> <li>The Orc Programming Language (with D. Kitchin, A. Quark, and W. Cook), 2009<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a></li> <li>Axioms for memory access in asynchronous hardware systems, 1986<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></li> <li>Powerlist: A structure for parallel recursion, 1994<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></li> <li>Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project (with <a href="/facts/Tony_Hoare/vBeb3cmn">Tony Hoare</a>), 2008<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Lamport, Leslie (May 1994). The Temporal Logic of Actions (Technical report) (ACM Transactions on Programming Languages and Systems 16 ed.). Microsoft. 79. <a href="https://www.microsoft.com/en-us/research/publication/the-temporal-logic-of-actions/" target="_blank">https://www.microsoft.com/en-us/research/publication/the-temporal-logic-of-actions/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Lamport, Leslie (1994). "Verification and specification of concurrent programs". Distributed Systems, Methods and Tools for Specification. An Advanced Course. A Decade of Concurrency Reflections and Perspectives. Lecture Notes in Computer Science (LNCS). Vol. 803. Springer, Berlin, Heidelberg. p. 352. doi:10.1007/3-540-58043-3_23. <a href="/wiki/Leslie_Lamport" target="_blank">/wiki/Leslie_Lamport</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>"Orc Language". <a href="https://orc.csres.utexas.edu/" target="_blank">https://orc.csres.utexas.edu/</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"IFIP Announces 2023 Awards". IFIP. 26 October 2023. Archived from the original on 2023-11-03. Retrieved 2023-11-03. <a href="https://web.archive.org/web/20231103090624/https://www.ifipnews.org/ifip-announces-2023-awards/" target="_blank">https://web.archive.org/web/20231103090624/https://www.ifipnews.org/ifip-announces-2023-awards/</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"NAE Website - Dr. Jayadev Misra". NAE. Retrieved 2023-11-03. <a href="https://www.nae.edu/178213/Dr-Jayadev-Misra" target="_blank">https://www.nae.edu/178213/Dr-Jayadev-Misra</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"Docteur Honoris Causa ENS-PARIS-SACLAY". <a href="https://ens-paris-saclay.fr/en/portraits/docteur-honoris-causa" target="_blank">https://ens-paris-saclay.fr/en/portraits/docteur-honoris-causa</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>"Two UTCS Faculty Among the Most Highly Cited Researchers | Department of Computer Science". Computer Science Department, UT Austin. Archived from the original on 2015-12-25. Retrieved 2023-11-03. <a href="https://web.archive.org/web/20151225084507/https://www.cs.utexas.edu/news/2004/two-utcs-faculty-among-most-highly-cited-researchers" target="_blank">https://web.archive.org/web/20151225084507/https://www.cs.utexas.edu/news/2004/two-utcs-faculty-among-most-highly-cited-researchers</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>"ACM Fellows". ACM. Retrieved 2023-11-03. <a href="https://awards.acm.org/fellows/award-winners?year=1995&award=158®ion=&submit=Submit&isSpecialCategory=" target="_blank">https://awards.acm.org/fellows/award-winners?year=1995&award=158®ion=&submit=Submit&isSpecialCategory=</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"IEEE Fellows Directory - Chronological Listing". IEEE. Retrieved 2023-11-03. <a href="https://services27.ieee.org/fellowsdirectory/menuCHRONOLOGICAL.html?beginYr=1992&endYr=1992#results_table" target="_blank">https://services27.ieee.org/fellowsdirectory/menuCHRONOLOGICAL.html?beginYr=1992&endYr=1992#results_table</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"Past Distinguished Alumnus Awardees (DAA)". IIT Kanpur. Retrieved 2023-11-03. <a href="https://iitkalumni.org/daa-awardees" target="_blank">https://iitkalumni.org/daa-awardees</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"Members - TAMEST (The Academy of Medicine, Engineering and Science of Texas)". TAMEST. Archived from the original on 2023-10-18. Retrieved 2023-11-03. <a href="https://web.archive.org/web/20231018033435/https://tamest.org/members/" target="_blank">https://web.archive.org/web/20231018033435/https://tamest.org/members/</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Chandy, K. Mani; Misra, Jayadev (1988). Parallel Program Design - a Foundation. Addison-Wesley. ISBN 978-0-201-05866-6. <a href="978-0-201-05866-6" target="_blank">978-0-201-05866-6</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Misra, Jayadev (March 1986). "Distributed discrete-event simulation". ACM Computing Surveys. 18 (1): 39–65. doi:10.1145/6462.6485. S2CID 18130323. <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Misra, Jayadev; Chandy, K. Mani (July 1981). "Proofs of networks of processes". IEEE Transactions on Software Engineering. SE-7 (4): 417–426. doi:10.1109/TSE.1981.230844. S2CID 15624919. <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>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. S2CID 9147318. <a href="/wiki/K._Mani_Chandy" target="_blank">/wiki/K._Mani_Chandy</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>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. S2CID 5922362. <a href="/wiki/K._Mani_Chandy" target="_blank">/wiki/K._Mani_Chandy</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Gries, David; Misra, Jayadev (November 1982). "Finding repeated elements". Science of Computer Programming. 2 (2): 143–152. doi:10.1016/0167-6423(82)90012-0. hdl:1813/6345. <a href="/wiki/David_Gries" target="_blank">/wiki/David_Gries</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Chandy, K. Mani; Misra, Jayadev (August 1985). How processes learn. PODC 85: Proceedings of the fourth annual ACM Symposium on Principles of Distributed Computing. Minaki, Ontario, Canada: Association for Computing Machinery. pp. 204–214. doi:10.1145/323596.323615. <a href="/wiki/K._Mani_Chandy" target="_blank">/wiki/K._Mani_Chandy</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Kitchin, David; Quark, Adrian; Cook, William; Misra, Jayadev (2009). "The Orc Programming Language". In David Lee; Antónia Lopes; Arnd Poetzsch-Heffter (eds.). Lecture Notes in Computer Science. Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1. Vol. 5522. Springer Verlag. pp. 204–214. doi:10.1007/978-3-642-02138-1_1. <a href="/wiki/Springer_Verlag" target="_blank">/wiki/Springer_Verlag</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Misra, Jayadev (January 1986). "Axioms for memory access in asynchronous hardware systems". ACM Transactions on Programming Languages and Systems. 8 (1): 142–153. doi:10.1145/5001.5007. S2CID 1326311. <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Misra, Jayadev (November 1994). "Powerlist: A structure for parallel recursion". ACM Transactions on Programming Languages and Systems. 16 (6): 1737–1767. doi:10.1145/197320.197356. S2CID 2913474. <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Hoare, Tony; Misra, Jayadev (2008). "Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project". In B. Meyer, J. Woodcock (ed.). Verified Software: Theories, Tools, Experiments. VSTTE 2005. Lecture Notes in Computer Science. Vol. 4171. Springer Verlag. doi:10.1007/978-3-540-69149-5_1. <a href="/wiki/Tony_Hoare" target="_blank">/wiki/Tony_Hoare</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> </ol>