T. Tachikawa and M. Takizawa, \Communication protocol for group of distributed objects ", Proceedings of the International Conference on Parallel and Distributed Systems, Tokyo, Japan (June 1996), pp. 370-377. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Atomic Group Protocols: Reliable Ordered Message Delivery for.. - Koch (2000) (Correct)
....is executed in each subgroup and the gateways forward messages between subgroups. The system employs one gatewaybetween every two di erent subgroups. A similar system is described in [73] OGC is a protocol that uses timestamps derived from physical clocks to achieve causal message ordering [74]. The protocol assumes FIFOchannels with a bounded latency. OGC uses real time vector clocks attached to each message. Moreover, each message contains a list of its causal predecessors. The message length increases with the number of nodes squared. RAMP [45] is a reliable multicast protocol, ....
T. Tachikawa and M. Takizawa, \Communication protocol for group of distributed objects ", Proceedings of the International Conference on Parallel and Distributed Systems, Tokyo, Japan (June 1996), pp. 370-377.
The Atomic Group Protocols: Reliable Ordered Message Delivery for.. - Koch (2000) (Correct)
....is executed in each subgroup and the gateways forward messages between subgroups. The system employs one gateway between every two di erent subgroups. A similar system is described in [73] OGC is a protocol that uses timestamps derived from physical clocks to achieve causal message ordering [74]. The protocol assumes FIFO channels with a bounded latency. OGC uses real time vector clocks attached to each message. Moreover, each message contains a list of its causal predecessors. The message length increases with the number of nodes squared. RAMP [45] is a reliable multicast protocol, ....
T. Tachikawa and M. Takizawa, \Communication protocol for group of distributed objects ", Proceedings of the International Conference on Parallel and Distributed Systems, Tokyo, Japan (June 1996), pp. 370-377.
Checkpointing and Rollback Recovery in Object-based Systems - Katsuya Tanaka Hiroaki (1996) Self-citation (Takizawa) (Correct)
....the number of objects to be rolled back can be reduced. In the distributed computation, objects send kinds of messages, i.e. request, response, and data messages. In the significant messages, the transmissions of the request, response, and data messages are not considered. Tachikawa and Takizawa [14] discuss the significant precedence of messages based on the conflicting relation on the operations supported by the objects. In this paper, we would like to define influential messages by considering the kinds of messages sent by the objects and the nested operations. Then, we would like to ....
Tachikawa, T. and Takizawa, M., "Communication Protocol for Group of Distributed Objects, " Proc. of IEEE ICPADS'96 , 1996, pp. 370--377.
Distributed Checkpointing Based on Influential Messages - Katsuya Tanaka And (1996) (1 citation) Self-citation (Takizawa) (Correct)
....receive request messages and send back the response messages. If the request is computed, the state of the object may be changed, and the response may carry the data. In the significant messages, the communication of the request and response messages is not considered. Tachikawa and Takizawa [21] discuss the significant precedence of request and response messages which is defined based on the conflicting relation on the operations supported by the objects. In this paper, we would like to define influential messages based on the semantics of request response messages under a situation ....
....precedes m 2 (m 1 ) m 2 ) iff the sending event of m 1 precedes the sending event of m 2 by the happen before relation of events [12] in the distributed system. m 1 has to be delivered before m 2 to every common destination of m 1 and m 2 if m 1 ) m 2 . Kinds of group communication protocols [1,2,12,14 16,19 21] for sup porting the causally ordered delivery of messages are discussed so far. Each object is required to receive in the causal order only messages to be causally delivered, but not necessarily all the messages received. Tachikawa and Takizawa [21] define the significant order of messages which ....
[Article contains additional citation context not shown here]
Tachikawa, T., and Takizawa, M., "Communication Protocol for Group of Distributed Objects," to appear in the Proc. of ICPADS'96 , 1996.
Object-Based Checkpoints in Distributed Systems - Katsuya Tanaka Hiroaki (1998) (1 citation) Self-citation (Takizawa) (Correct)
No context found.
Tachikawa, T. and Takizawa, M., "Communication Protocol for Group of Distributed Objects," Proc. of IEEE ICPADS'96 , pp. 370--377, 1996.
Significant Checkpoint in Distributed System - Katsuya Tanaka Hiroaki (1996) Self-citation (Takizawa) (Correct)
....the number of objects to be rolled back can be reduced. In the distributed computation, objects send kinds of messages, i.e. request, response, and data messages. In the significant messages, the transmissions of the request, response, and data messages are not considered. Tachikawa and Takizawa [15] discuss the significant precedence of messages based on the conflicting relation on the operations supported by the objects. In this paper, we would like to define influential messages by considering the kinds of messages sent by the objects and the nested operations. Then, we would like to ....
Tachikawa, T. and Takizawa, M., "Communication Protocol for Group of Distributed Objects," to appear in Proc. of IEEE ICPADS'96 , 1996.
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