On reducing the complexity of matrix clocks

Details On reducing the complexity of matrix clocks On reducing the complexity of matrix clocks

2003-09-23

arxiv.org/abs/cs/0309042v1

Parallel Computing 29 (2003), 895-905

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

10.1016/S0167-8191(03)00066-8

Matrix clocks are a generalization of the notion of vector clocks that allows the local representation of causal precedence to reach into an asynchronous distributed computation's past with depth $x$, where $x\ge 1$ is an integer. Maintaining matrix clocks correctly in a system of $n$ nodes requires that everymessage be accompanied by $O(n^x)$ numbers, which reflects an exponential dependency of the complexity of matrix clocks upon the desired depth $x$. We introduce a novel type of matrix clock, one that requires only $nx$ numbers to be attached to each message while maintaining what for many applications may be the most significant portion of the information that the original matrix clock carries. In order to illustrate the new clock's applicability, we demonstrate its use in the monitoring of certain resource-sharing computations.

Affiliated with

Also associated with

No associations

Rating

On reducing the complexity of matrix clocks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On reducing the complexity of matrix clocks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On reducing the complexity of matrix clocks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182678