1 1. Introduction The problem of stability detection is one of the most widely studied problems i... more 1 1. Introduction The problem of stability detection is one of the most widely studied problems in distributed computing [ 1-28 ]. A stable properly is one that persists: if the property holds at any point, then it holds thereafter. Examples of stable properties are termination, deadlock ...
1. INTRODUCTION In a system of processes which communicate only with a single central agent, dead... more 1. INTRODUCTION In a system of processes which communicate only with a single central agent, deadlock can be detected easily because the central agent has complete infor- mation about every process. Deadlock detection is more difficult in systems where there is no ...
ABSTRACT this report was supported by Hitachi Corporations 1o Networks of Processes This paper su... more ABSTRACT this report was supported by Hitachi Corporations 1o Networks of Processes This paper suggests methods for proving the correctness of networks of processes which communicate exclusively through messages
ACM Transactions on Programming Languages and Systems, 1982
A v e r t e x vi i n a d i r e c t e d g r a p h is i n a k n o t i f f o r e v e r y v e r t e x... more A v e r t e x vi i n a d i r e c t e d g r a p h is i n a k n o t i f f o r e v e r y v e r t e x vj r e a c h a b l e f r
Word processing software, email, and spreadsheet have revolutionized oce ac- tivities. There are ... more Word processing software, email, and spreadsheet have revolutionized oce ac- tivities. There are many other oce tasks that are amenable to automation, such as: scheduling a visit by an external visitor, arranging a meeting, and handling student application and admission to a university. Many business applications —protocol for Þlling an order from a customer, for instance— have similar struc- ture.
Page 1. Computing with Distributed Resources Young-ri Choi, Siddhartha Rai, Vinay SampathKumar, J... more Page 1. Computing with Distributed Resources Young-ri Choi, Siddhartha Rai, Vinay SampathKumar, Jayadev Misra, and Harrick Vin Department of Computer Science The University of Texas at Austin Austin, Texas 78712 {yrchoi,sid,vinay,misra,vin}@cs.utexas.edu ...
The changing levels of lead (Pb) in the soil and vegetationalong two National Highways near Luckn... more The changing levels of lead (Pb) in the soil and vegetationalong two National Highways near Lucknow, India, wereinvestigated. The pattern of Pb deposition, as reflected bysoil Pb burdens, showed decrease in concentration withincreasing distances from the road margins. At both the sitesPb concentration was above background concentration even atthe soil core depth of 15 cm. Oryza sativa, Colocasiaesculentum, Luffa cylindrica
Programming Techniques and Data Structures M. Douglas Mcllroy* Editor ... KM Chandy and J. Misra ... more Programming Techniques and Data Structures M. Douglas Mcllroy* Editor ... KM Chandy and J. Misra University of Texas at Austin ... We use the paradigm of diffusing computation, intro- duced by Dijkstra and Scholten, to solve a class of graph problems. We present a detailed ...
1 1. Introduction The problem of stability detection is one of the most widely studied problems i... more 1 1. Introduction The problem of stability detection is one of the most widely studied problems in distributed computing [ 1-28 ]. A stable properly is one that persists: if the property holds at any point, then it holds thereafter. Examples of stable properties are termination, deadlock ...
1. INTRODUCTION In a system of processes which communicate only with a single central agent, dead... more 1. INTRODUCTION In a system of processes which communicate only with a single central agent, deadlock can be detected easily because the central agent has complete infor- mation about every process. Deadlock detection is more difficult in systems where there is no ...
ABSTRACT this report was supported by Hitachi Corporations 1o Networks of Processes This paper su... more ABSTRACT this report was supported by Hitachi Corporations 1o Networks of Processes This paper suggests methods for proving the correctness of networks of processes which communicate exclusively through messages
ACM Transactions on Programming Languages and Systems, 1982
A v e r t e x vi i n a d i r e c t e d g r a p h is i n a k n o t i f f o r e v e r y v e r t e x... more A v e r t e x vi i n a d i r e c t e d g r a p h is i n a k n o t i f f o r e v e r y v e r t e x vj r e a c h a b l e f r
Word processing software, email, and spreadsheet have revolutionized oce ac- tivities. There are ... more Word processing software, email, and spreadsheet have revolutionized oce ac- tivities. There are many other oce tasks that are amenable to automation, such as: scheduling a visit by an external visitor, arranging a meeting, and handling student application and admission to a university. Many business applications —protocol for Þlling an order from a customer, for instance— have similar struc- ture.
Page 1. Computing with Distributed Resources Young-ri Choi, Siddhartha Rai, Vinay SampathKumar, J... more Page 1. Computing with Distributed Resources Young-ri Choi, Siddhartha Rai, Vinay SampathKumar, Jayadev Misra, and Harrick Vin Department of Computer Science The University of Texas at Austin Austin, Texas 78712 {yrchoi,sid,vinay,misra,vin}@cs.utexas.edu ...
The changing levels of lead (Pb) in the soil and vegetationalong two National Highways near Luckn... more The changing levels of lead (Pb) in the soil and vegetationalong two National Highways near Lucknow, India, wereinvestigated. The pattern of Pb deposition, as reflected bysoil Pb burdens, showed decrease in concentration withincreasing distances from the road margins. At both the sitesPb concentration was above background concentration even atthe soil core depth of 15 cm. Oryza sativa, Colocasiaesculentum, Luffa cylindrica
Programming Techniques and Data Structures M. Douglas Mcllroy* Editor ... KM Chandy and J. Misra ... more Programming Techniques and Data Structures M. Douglas Mcllroy* Editor ... KM Chandy and J. Misra University of Texas at Austin ... We use the paradigm of diffusing computation, intro- duced by Dijkstra and Scholten, to solve a class of graph problems. We present a detailed ...
Uploads
Papers by Jayadev Misra