6105 search results - page 948 / 1221 » A Parallel Algorithm for Bound-Smoothing |
155
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
184
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present Gatekeeper, a decentralized protocol that performs Sybil-resilient node admission control based on a social network. Gatekeeper can admit most honest nodes while limiti...
164
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
171
click to vote
GPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithm...
163
click to vote
GRID
2007
Springer
15 years 10 months ago
2007
Springer
Utility Grids create an infrastructure for enabling users to consume services transparently over a global network. When optimizing workflow execution on utility Grids, we need to c...