Sciweavers

72 search results - page 11 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 8 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
ANCS
2008
ACM
13 years 9 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
FLAIRS
2004
13 years 8 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
GPC
2010
Springer
13 years 11 months ago
Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
Wei-Jen Wang, Carlos A. Varela, Fu-Hau Hsu, Cheng-...
DSN
2003
IEEE
14 years 20 days ago
N-Way Fail-Over Infrastructure for Reliable Servers and Routers
Maintaining the availability of critical servers and routers is an important concern for many organizations. At the lowest level, IP addresses represent the global namespace by wh...
Yair Amir, Ryan Caudy, Ashima Munjal, Theo Schloss...