28 search results - page 4 / 6 » wdag 2005 |
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative a...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...