1257 search results - page 143 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
145
click to vote
ENTCS
2002
15 years 4 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...
128
click to vote
SRDS
2006
IEEE
15 years 10 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...
134
click to vote
EMSOFT
2006
Springer
15 years 8 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...
138
click to vote
IAT
2007
IEEE
15 years 10 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...
164
click to vote
ICDCS
2010
IEEE
15 years 8 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...