Rajive Bagrodia. Synchronization of asynchronous processes. ACM Transactions on Programming Languages and Systems, 11(4):585--597, October 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(that is, p i acts as a coordinator for itself when it is ready for interaction) then the messages between Coord i and p i are in fact local actions. So only two messages are needed for a process to attempt an interaction. This is the same as existing algorithms for biparty interaction scheduling [BS83, Ram87b, Bag89, TB94]. However, most of the algorithms can only guarantee a very weak form of semantic constraint weak interaction fairness (WIF) requiring that an enabled interaction be eventually disabled. To allow comparison with existing algorithms for scheduling interactions, we first discuss the message ....

R. L. Bagrodia. Synchronization of asynchronous processes in CSP. ACM Transactions on Programming Languages and Systems, 11(4):585--597, October 1989.

....protocol implementing causally ordered communications described in [31] is used in [5] as basic mechanism to implement causally consistent shared memories on top of a distributed system. In the same way it is possible to exhibit the same kind of similarity between the rendezvous communication mode [19, 10] and the atomic consistency criterion. 9 Conclusion Numerous protocols implementing distributed shared memory systems have been designed. In the most of them, the semantics (consistency criterion) they offer to users is defined only by the description of the protocol and not in an abstract way. ....

Bagrodia R. L. Synchronization of asynchronous processes in CSP. ACM Transactions on Programming Languages and Systems, 11(4):1053-1065, 1989.

....t 2 attempts select [receive c 2 , receive c 1 ] This can result in a situation in which t 1 holds a lock on c 1 and needs a lock on c 2 , while t 2 holds a lock on c 2 and needs a lock on c 1 i.e. deadlock. There are various known algorithms for this problem (e.g. see [BS83] Bor86] or [Bag89] The basic strategy is to first make tentative offers of communication; when two tentative offers match, one thread must freeze its state until the other thread either commits or rejects the communication. The choice of which thread will fix its state is based the order of the threads IDs; ....

Bagrodia, R. Synchronization of asynchronous processes in CSP. ACM Transactions on Programming Languages and Systems, 11(4), October 1989, pp. 585-- 597.

....is a member) All four processes are ready for interaction initially, and then the following scenario is repeated forever: ffl C 1 and M 1 establish access 1 ; ffl C 1 and M 1 exit access 1 and then respectively become ready again. WIF has been widely implemented in CSP like biparty interactions [8,31,29,5,33], as well as in the multiparty case [28,4,27,20,17] Although WIF can ensure some form of liveness, it is sometimes too weak to be useful. For example, consider another execution of the replica program: All four processes are ready for interaction initially, and then the following scenario is ....

R. L. Bagrodia. Synchronization of asynchronous processes in CSP. ACM Transactions on Programming Languages and Systems, 11(4):585--597, October 1989.

....concurrently activated. As more than one process can enrole into the same role, the failure of any one of them should not preclude the others from filling the role. Thus, first order interactions are inherently fault tolerant. The distributed algorithms of [Ramesh 1987; Chandy and Misra 1988; Bagrodia 1989a; Kumar 1990; Park and Kim 1990] for multiparty interaction guard scheduling are zeroth order in nature. The algorithms of [Chandy and Misra 1988; Bagrodia 1989a; Park and Kim 1990] employ a fixed coordinator for each interaction and thus cannot realize concurrent activations of a first order interaction, nor ....

Bagrodia, R. 1989b. Synchronization of asynchronous processes in CSP. ACM Transactions on Programming Languages and Systems 11, 4 (Oct.), 585--597.

No context found.

Rajive Bagrodia. Synchronization of asynchronous processes. ACM Transactions on Programming Languages and Systems, 11(4):585--597, October 1989.

No context found.

R. Bagrodia. Synchronisation of Asynchronous Processes in CSP. ACM Transactions on Programming Languages and Systems, 11(4):585--597, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC