C. Valot. "Characterizing the accuracy of distributed timestamps." In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pages 43--52, May 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....about the task it directly communicates with for each event. Each message carries with it the sending task s event counter when the message was sent. The information that is recorded for each communication event is the sending task, receiving task, and the appropriate event counters. Valot [50] suggests that there is a trade off between space (memory) and timestamp accuracy for the happened before relation. She describes a family of timestamps (called k vectors) that can be tailored for the particular analysis needs. Instead of allocating a position in the vector to a single task, a ....

....ordering between events that respects the event ordering during execution. Potential causality is characterized as the future not being able to influence the past [29] an event may be the cause of event if event occurs earlier than event . Previous work which subscribed to this definition are [29, 50, 28, 14, 51, 43]. A vector clock characterizes potential causality because the event ordering is consistent with system execution. Potential causality is a weak characterization of realized causality because it results in Figure 4: Relationships of Different Kinds of Causality (a larger set interprets more ....

C. Valot. "Characterizing the accuracy of distributed timestamps." In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pages 43--52, May 1993.

....about the task it directly communicates with for each event. Each message carries with it the sending task s event counter when the message was sent. The information that is recorded for each communication event is the sending task, receiving task, and the appropriate event counters. Valot [50] suggests that there is a trade off between space (memory) and timestamp accuracy for the happened before relation. She describes a family of timestamps (called k vectors) that can be tailored for the particular analysis needs. Instead of allocating a position in the vector to a single task, a ....

....between events that respects the event ordering during execution. Potential causality is characterized as the future not being able to influence the past [29] an event may be the cause of event if event occurs earlier than event . Previous work which subscribed to this definition are [29] [50] [28] 14] 51] 43] A vector clock characterizes potential causality because the event ordering is consistent with system execution. Potential causality is a weak characterization of realized causality because it results in all previous events being potential causes for later events. This is a ....

C. Valot. "Characterizing the accuracy of distributed timestamps." In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pages 43--52, May 1993.

....while (b) shows two racing messages. To detect frontiers as described above, it is necessary to order events by their causality. In [Lam78] a simple and correct, but not sufficiently accurate method is given. Instead we implemented the algorithm using vector timestamps described in [Fid89] [Val93] proves that this algorithm provides the most accurate event ordering scheme. The interested reader should refer to [Ray91] which provides a complete analysis of current algorithms to provide causal event ordering. Figure 9 shows an example of a block race. In this example, all three messages ....

C. Valot. Characterizing the accuracy of distributed timestamps. In Proceedings of ACM/ONR Workshop on Parallel and Distributed Debugging, pages 43--52, San Diego, California, May 1993.

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