Extraction of logical concurrency in distributed applications

Some methods are discussed to extract and represent the concurrency inherent in distributed applications. Concurrency is an application level property that is characterized completely by the set of messages exchanged in the application and the causal ordering relationship among the messages. The concurrency may be viewed at the logical level in the application rather than at the physical message communication level. The concurrency has a direct relationship to the message delivery performance in the underlying computation such as asynchronism in message delivery protocols. The authors quantitatively analyze how the application level concurrency influences the execution of the application. The analysis is based on methods for representing concurrency and deriving measures of concurrency from the representations. System level execution models based on ISIS, x-kernel and the causal broadcast communication system are used as case studies in the analysis. The analysis is in general useful in the design of applications and to compare their projected performance levels in an implementation-independent manner.<<ETX>>

[1]  Erwin Mayer.  An Evaluation Framework for Multicast Ordering Protocols , 1992, SIGCOMM.

[2]  Bernadette Charron-Bost.  Measure of Parallelism of Distributed Computations , 1989, STACS.

[3]  Erwin Mayer.  An Evaluation Framework for Multicast Ordering Protocols , 1992, SIGCOMM.

[4]  Bernadette Charron-Bost.  Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory , 1989, WDAG.

[5]  Michel Raynal,et al.  Synchronization and concurrency measures for distributed computations , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[6]  Colin J. Fidge,et al.  Logical time in distributed computing systems , 1991, Computer.

[7]  D SchlichtingRichard,et al.  Preserving and using context information in interprocess communication , 1989 .

[8]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[9]  Wolfgang Reisig,et al.  Temporal Logic and Causality in Concurrent Systems , 1988, Concurrency.

[10]  Kenneth P. Birman,et al.  Exploiting virtual synchrony in distributed systems , 1987, SOSP '87.

[11]  André Schiper,et al.  The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[12]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[13]  Sriram Sankar,et al.  Exploiting locality in maintaining potential causality , 1991, PODC '91.

[14]  Richard D. Schlichting,et al.  Preserving and using context information in interprocess communication , 1989, TOCS.

[15]  K. Ravindran,et al.  A Flexible Causal Broadcast Communication Interface for Distributed Applications , 1992, J. Parallel Distributed Comput..