613 search results - page 26 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
EOR
2007
14 years 9 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
116
click to vote
VIS
2004
IEEE
15 years 11 months ago
2004
IEEE
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
TPDS
2010
14 years 8 months ago
2010
—In this paper we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divi...
PDCAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...