2110 search results - page 84 / 422 » What is the complexity of a distributed computing system |
111
click to vote
HPDC
2000
IEEE
15 years 8 months ago
2000
IEEE
We describe MW – a software framework that allows users to quickly and easily parallelize scientific computations using the master-worker paradigm on the computationalgrid. MW ...
120
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
138
click to vote
PODC
2009
ACM
15 years 8 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
137
click to vote
ICDCS
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
130
click to vote
COORDINATION
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...