6105 search results - page 760 / 1221 » A Parallel Algorithm for Bound-Smoothing |
181
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
211
click to vote
COLCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Networked virtual environments (NVE) refer to the category of distributed applications that allow a large number of distributed users to interact with one or more central servers i...
196
click to vote
CONCUR
2008
Springer
15 years 9 months ago
2008
Springer
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and ...
185
click to vote
COORDINATION
2008
Springer
15 years 9 months ago
2008
Springer
We present a novel approach for the sound orchestration of services. It is based on Orcharts and Typecharts: a service orchestration language and an associated behavioural typing l...
198
click to vote
CSE
2008
IEEE
15 years 9 months ago
2008
IEEE
Parallel computing is widely used for large scale threedimensional simulation of seismic wave propagation. One particularity of most of these simulations is to consider a finite c...