318 search results - page 1 / 64 » Distributed Graph Traversals by Relabelling Systems with App... |
ENTCS
2006
13 years 4 months ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
FUIN
2006
13 years 4 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
ICPP
2006
IEEE
13 years 10 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
DAIS
2011
12 years 8 months ago
2011
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...