5448 search results - page 478 / 1090 » Breakpoints and Time in Distributed Computations |
181
click to vote
ICPP
1990
IEEE
15 years 11 months ago
1990
IEEE
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
199
Voted
PODC
2000
ACM
15 years 11 months ago
2000
ACM
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
288
Voted
PODC
2011
ACM
14 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
331
Voted
GIS
2008
ACM
16 years 8 months ago
2008
ACM
With the advent of the data grid came a novel distributed scientific computing paradigm known as service-oriented science. Among the plethora of systems included under this framew...
221
click to vote
ICPADS
2007
IEEE
16 years 1 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...