5448 search results - page 414 / 1090 » Breakpoints and Time in Distributed Computations |
181
click to vote
OPODIS
2010
15 years 4 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
250
click to vote
GCA
2009
15 years 4 months ago
2009
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
168
Voted
ASPDAC
2006
ACM
16 years 24 days ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
195
click to vote
ICAS
2009
IEEE
16 years 1 months ago
2009
IEEE
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
166
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...