T. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Transactions on Computers, 43(5):513--527, May 1994. 21  Home/Search   Document Not in Database   Summary   Related Articles   Check

....causal ordering [12] These message orderings can be specified using forbidden predicates. By constructing predicate graphs of these predicates it can be shown that these orderings can be implemented without using any control messages. Logically synchronous ordering of messages has been studied in [9, 18, 24]. It has also been studied extensively as implementation of the guard statement of Communicating Sequential Process (CSP) 6, 3, 23] and as the binary interaction problem [2, 8] Thus, these message orderings have either been studied as synchronization primitives, or are embedded in some protocol. ....

T. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Transactions on Computers, 43(5):513--527, May 1994. 21

....develop and verify than algorithms working in a synchronous environment [11] This quotation expresses the relative advantages of synchronous communication with respect to asynchronous communication. This paper focuses on a particular message ordering property, namely, Logical Instantaneity (li [12]) This property is weaker than rdv in the sense that it does not provide synchronization; more precisely, the sender of a message is not blocked until the destination processes are ready to deliver the message. But li is stronger than co (Causally Ordered communication) co means that, if two ....

.... the same destination process, then the corresponding messages are delivered in their sending order [3] co has received a great attention as it simplifies the design of protocols solving consistency related problems [4] It has been shown that these communication modes form a strict hierarchy [11,12]. More precisely, rdv ) li ) co ) fifo, where x ) y means that if the communications satisfy the x property, they also satisfy the y property. Of course, the less constrained the communications are, the more efficient the corresponding executions can be. But, as indicated previously, a price has ....

[Article contains additional citation context not shown here]

Soneoka T. and Ibaraki T., Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE TC, 43(5):513-527, (1994).

....develop and verify than algorithms working in a synchronous environment [8] This quotation expresses the relative advantages of synchronous communication with respect to asynchronous communication. This paper focuses on a particular message ordering property, namely, Logical Instantaneity (li [21]) This property is weaker than rdv in the sense that it does not provide synchronization; more precisely, the sender of a message is not blocked until the destination processes are ready to deliver the message. But li is stronger than co (Causally Ordered communication) co means that, if two ....

.... the same destination process, then the corresponding messages are delivered in their sending order [4] co has received a great attention as it simplifies the design of protocols solving consistency related problems [18] It has been shown that these communication modes form a strict hierarchy [8, 21]. More precisely, rdv ) li ) co ) fifo, where x ) y means that if the communications satisfy the x property, they also satisfy the y property. More sophisticated communication modes can found in [1] Of course, the less constrained the communications are, the more efficient the corresponding ....

[Article contains additional citation context not shown here]

Soneoka T. and Ibaraki T., Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE TC, 43(5):513-527, (1994). 12

....and op3 H op2. 8.2 Logically Instantaneous and Causally Ordered Communications The similarity between both models is not limited to their definitions. PRAM, causal and sequential consistencies in the shared memory model correspond to FIFO, causally ordered [14, 31] and logically instantaneous [34] communications in the message passing model. Characterizations of these communication modes can be found in [12, 15, 34] 8.2.1 Causally ordered Communications A distributed computation b H has causally ordered communications if: 8 m 1 ; m 2 : send(m 1 ) H send(m 2 ) m 1 and m 2 are sent ....

....is not limited to their definitions. PRAM, causal and sequential consistencies in the shared memory model correspond to FIFO, causally ordered [14, 31] and logically instantaneous [34] communications in the message passing model. Characterizations of these communication modes can be found in [12, 15, 34]. 8.2.1 Causally ordered Communications A distributed computation b H has causally ordered communications if: 8 m 1 ; m 2 : send(m 1 ) H send(m 2 ) m 1 and m 2 are sent to the same destination process) receive(m 1 ) H receive(m 2 ) So, causal ordering imposes, for each process, ....

T.S. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Transactions on Computers, 43(5);513--527, 1994.

....order to each process. In light of this, when a message is delivered to a process, all messages that causally precede it have been already delivered to that process. To master asynchrony, other communication modes have been defined such as FIFO, Rendezvous and logical instantaneous ordering [20]. From the user viewpoint, causal ordering increases the control of a distributed application compared to a simple FIFO ordering, at the cost of a reduction of the potential concurrency of the distributed application. Compared with logically instantaneous communication, causal ordering provides ....

T. Soneoka, and T. Ibaraki, "Logically Instantaneous Message-Passing in Asynchronous Distributed Systems", IEEE Trans. on Computers, vol. 43, no. 5, pp. 513--527, 1994.

....causal ordering [12] These message orderings can be specified using forbidden predicates. By constructing predicate graphs of these predicates it can be shown that these orderings can be implemented without using any control messages. Logically synchronous ordering of messages has been studied in [9, 18, 24]. It has also been studied extensively as implementation of the guard statement of Communicating Sequential Process (CSP) 6, 3, 23] and as the binary interaction problem [2, 8] Thus, these message orderings have either been studied as synchronization primitives, or are embedded in some protocol. ....

T. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Transactions on Computers, 43(5):513--527, May 1994.

....baldoni dis.uniroma1.it In light of this, when a message is delivered to a process, all messages that causally precede it have been already delivered to that process. To master asynchrony, other communication modes have been defined such as FIFO, Rendezvous and logical instantaneous ordering [SI94]. However, from the user viewpoint, causal ordering increases the control of a distributed application compared to a simple FIFO ordering, at the cost of a reduction of the potential concurrency of the distributed application. Compared with logically instantaneous communication, causal ordering ....

T. Soneoka, and T. Ibaraki. Logically instantaneous message-passing in asynchronous distributed systems. IEEE Transaction on Computers, 43(5):513--527, 1994.

....= receive(m) in that case H is called message relation) or iii) 9op3 : op1 H op3 and op3 H op2. The similarity between both models is not limited to their definitions. PRAM, causal and sequential consistencies in the shared memory model correspond to FIFO, causal and logically instantaneous [23] communications in the message passing model. Characterizations of these communication modes can be found in [8, 11, 23] Let b H be a history in the message passing model. In [11] the following results are shown: ffl b H has causally ordered communications if it satisfies the empty interval ....

....between both models is not limited to their definitions. PRAM, causal and sequential consistencies in the shared memory model correspond to FIFO, causal and logically instantaneous [23] communications in the message passing model. Characterizations of these communication modes can be found in [8, 11, 23]. Let b H be a history in the message passing model. In [11] the following results are shown: ffl b H has causally ordered communications if it satisfies the empty interval property, namely: 8 receive(m) 2 b H : fop j send(m) H op H receive(m)g = 1) ffl b H has logically ....

T.S. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Trans. on Computers, 43(5);513--527, 1994.

.... and a (strong) synchronization: both the sender and the receiver of a message have to synchronize in order that the communication be realized (it is as if the communication took place through a buffer of size 0) A weakening of rendez vous gives the logical instantaneous communication mode [15], it requires only that communications appear instantaneous in some logical time (rendez vous is not necessary in physical time) FIFO communication mode means that for each pair of processes the receiving order is the same as the sending one. Causal order means that if two sends are causally ....

....pair of processes the receiving order is the same as the sending one. Causal order means that if two sends are causally related [9] and concern the same destination process,then messages are delivered in their sending order. Protocols implementing such communication modes have been proposed in [1, 14, 12, 11, 15]. In this paper we suppose a reliable asynchronous distributed system and we are interested in characterizing communications modes. Such characterizations are particularly useful whenone is interested in understanding distributed computations. We consider asynchronous distributed computations and ....

[Article contains additional citation context not shown here]

T. S. Soneoka and T. Ibaraki. Logically instantaneous message passing in asynchronous distributed systems. IEEE Trans. Comput., 43(5):513--527, 1994.

....is no causal dependency between them. Thus, the happened before relation induces a partial ordering on events based on their causal dependencies. Controlling the execution of a distributed application such that all the events are totally ordered is expensive and leads to a loss in concurrency [18]. A less severe form of ordering of message transmission and reception, called causal ordering, is sufficient for a variety of applications like management of replicated data, observation of a distributed system, resource allocation, multimedia systems, and teleconferencing [2, 4, 15] Protocols ....

T. S. Soneoka and T. Ibaraki. Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE Transactions on Computers, 43(5):513--527, May 1994.

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