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...
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of su...