1257 search results - page 143 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
ENTCS
2002
14 years 10 months ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
SRDS
2006
IEEE
15 years 4 months ago
2006
IEEE
Determinism is mandatory for replicating distributed objects with strict consistency guarantees. Multithreaded execution of method invocations is a source of nondeterminism, but h...
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
IAT
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
110
Voted
ICDCS
2010
IEEE
15 years 2 months ago
2010
IEEE
—Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients’ messages. How...