446 research outputs found
Derandomization of Online Assignment Algorithms for Dynamic Graphs
This paper analyzes different online algorithms for the problem of assigning
weights to edges in a fully-connected bipartite graph that minimizes the
overall cost while satisfying constraints. Edges in this graph may disappear
and reappear over time. Performance of these algorithms is measured using
simulations. This paper also attempts to derandomize the randomized online
algorithm for this problem
Survey of Distributed Decision
We survey the recent distributed computing literature on checking whether a
given distributed system configuration satisfies a given boolean predicate,
i.e., whether the configuration is legal or illegal w.r.t. that predicate. We
consider classical distributed computing environments, including mostly
synchronous fault-free network computing (LOCAL and CONGEST models), but also
asynchronous crash-prone shared-memory computing (WAIT-FREE model), and mobile
computing (FSYNC model)
- …