This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
I present a general framework for observing and controlling a distributed computation and its applications to distributed debugging. Algorithms for observation are useful in distr...
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
– Communication overhead is one of the dominant factors that affect performance in high-performance computing systems. To reduce the negative impact of communication, programmers...