A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
k-Dependency Vectors: a scalable causality-tracking protocol
2003
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.
In this paper we present a scalable causality-tracking protocol, called -Dependency Vectors, which piggybacks on each application message a constant number of integers (with Ò). These integers are selected from a vector of size Ò which is local at each process. By reducing the size of the piggybacked information, only a subset of the causal dependencies can be "on-the-fly" detected by the checker. The other dependencies need an extra computation time to be rebuilt (detection delay). This delay
doi:10.1109/empdp.2003.1183592
dblp:conf/pdp/BaldoniM03
fatcat:nwvwzs3a35gency46hbrashr7y