A SIMPLE MODEL OF DISTRIBUTED PROGRAMS BASED ON IMPLEMENTATION-HIDING AND PROCESS AUTONOMY (2009)
This paper presents a model for a network of communicating processes. We extend well known ideas in sequentia] programming such as procedures, parameter passing and binding, and recursion to...
ABSTRACT PROVING SAFETY AND LIVENESS OF COMMUNICATING PROCESSES WITH EXAMPLES (2009)
J. Misra, K. M. Ch, Todd Smith
A method is proposed for reasoning about safety and liveness properties of message passing networks. The method is hierarchical and is based upon combining the specifications of component processes...
ORIGINAL ARTICLE Concurrent maintenance of rings (2008)
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton, X. Li, J. Misra
Abstract A central problem for structured peer-topeer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join or leave the network, possibly concurrently....
Categories and Subject Descriptors: D.l.3 [Programming Techniques]: Concurrent Programming (2008)
The problem of concurrent accesses to registers by asynchronous components is considered. A set of axioms about the values in a register during concurrent accesses is proposed. It is shown that if...
Distributed Computation on Graphs: Shortest Path Algorithms (2008)
M. Douglas Mcllroy, K. M. Ch, J. Misra
We use the paradigm of diffusing computation, intro-duced by Dijkstra and Scholten, to solve a class of graph problems. We present a detailed solution to the problem of computing shortest paths from...
A Distributed Graph Algorithm" Knot Detection (2008)
A knot in a directed graph is a useful concept in deadlock detection. A distributed algorithm for identifying a knot in a graph by using a network of processes is presented. The algorithm is based on...
Keywords SOME CLASSES OF NATURALLY PROVABLE PROGRAMS (2008)
Program Verification, proving programs correct, inductive assertions, proof rule, uniform loop programs, stack schema, for programs. Three different classes of programs are identi-fied for which the...
A NONTRIVIAL EXAHPLE OF CONCURRENT PROCESSING: DISTRIBUTED SIMULATION (2007)
Ko M. Chandy, K. M. Chandy, J. Misra, J. Misra
This paper is concerned with the pros and cons of writing distributed applications software. Most applications software is highly sequential due to the sharing of variables. Here we focus attention...
K. M. Ch, J. Misra, How Distributed Computing, T. H. Lai, T. H. Yang, On Information, ...
[8] L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the A CM, 21(7):558-565, 1978. [9] W. S. Llyod and P. Kearns. Bounding sequence numbers in...
Misra, J., Alevizos, I., Bullen, J., Blueher, S., Mantzoros, C., Stephanopoulos, Gregory
A methodology for the construction of predictive empirical models of physiological characteristics from microarray data is presented. The method, applied here to the study of the development of...
Misra, J., Alevizos, I., Bullen, J., Blueher, S., Mantzoros, C., Stephanopoulos, Gregory
A methodology for the construction of predictive empirical models of physiological characteristics from microarray data is presented. The method, applied here to the study of the development of...
A Distributed Graph Algorithm: Knot Detection. (2002)
A knot in a directed graph is a useful concept in deadlock detection. This paper presents a distributed algorithm based on the work of Dijkstra and Scholten to identify knot in a graph by using a...
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems. (2002)
This paper presents a distributed algorithm to detect deadlocks in distributed data bases. Features of this paper are (1) a formal model of the problem is presented, (2) the correctness of the...
Distributed Computation on Graphs: Shortest Path Algorithms. (2002)
The authors use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. They present a detailed solution to the problem of computing shortest...
A Distributed Deadlock Detection Algorithm and Its Correctness Proof. (2002)
Chandy,K. M., Misra,J., Haas,L.
This paper presents a very simple distributed algorithm for deadlock detection in a network of processes. The algorithm is proven correct, i.e., we show that all true deadlocks are detected and no...
Proving Safety and Liveness of Communicating Processes with Examples. (2002)
Misra,J., Chandy,K. M., Smith,Todd
A method is proposed for reasoning about safety and liveness properties of message passing networks. The method is hierarchical and is based upon combining the specifications of component processes...
Annual Scientific Report, Grant AFOSR-81-0205. (2002)
Contents: Paradigms for Distributed Computing; Distributed Simulated; Processor Queueing Disciplines in Distributed Systems; The Effect of Queueing Disciplines on Response Times in Distributed...
Work has resulted in a number of significant algorithms for distributed systems. Notable among these are, (1) Distributed Snapshots: which allows for the construction of a consistent global state,...
Annual Scientific Report for Grant AFOSR-81-0205. (1998)
In the last several years, the investigators have developed a number of important, practical distributed algorithms for problems such as distributed simulation, termination and deadlock detection,...
Preserving Asymmetry by Symmetric Processes and Distributed Fair Conflict Resolution. (1998)
Conflicts arising in distributed systems, as in contentions for shared resources, are resolved either by a central process or by resorting to probabilistic decision making by individual processes or...
Air Force Scientific Report for AFOSR Grant AFOSR-85-0252. (1998)
Our work has concentrated on developing a unifying framework, under the name UNITY, for studying problem-solving in parallel programming independent of specific architectural considerations. We have...
Theory and Practice of Fault Tolerance in Distributed Systems. (1998)
Our work has concentrated on developing a unifying framework, under the name UNITY, for studying problem solving in parallel programming independent of specific architectural considerations. We have...
A Constructive Proof of Vizing’s Theorem (1992)
We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex have different colors. We prove Vizing’s Theorem. All the edges of a graph of...
A Constructive Proof of Vizing’s Theorem (1992)
We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex have different colors. We prove Vizing's Theorem. All the edges of a graph...
The Drinking Philosophers Problem (1984)
The problem of resolving conflicts between processes in distributed systems is of practical importance. A conflict between a set of processes must be resolved in favor of some (usually one) process...
Termination Detection of Diffusing Computations (1982)
This work was completed while the author was visiting Hahn
Asychronous distributed simulation via a sequence of Parallel Computations (1981)
An approach to carrying out asynchronous, distributed simulation on multiprocessor message-passing architectures is presented. This scheme differs from other distributed simulation schemes because...
On diffusing computations (1980)
Dijkstra and Scho!ten developed the notion of diffusing computations to provide a very general framework for a large and important class of problems. In this paper we show how the results of...
PLATELET 5-HYDROXY-TRYPTAMINE IN THROMBOTIC AND NON-THROMBOTIC DISEASES (1975)
MISRA, D. P., STADDON, G., JACKSON, P., POWELL, N., MISRA, J.
It is generally accepted that platelets form the main constituent of a thrombus. Experimental work has shown that 5-hydroxy-tryptamine (5 HT) in a concentration of 0.06 mg/ml produces clumping of...