4045 search results - page 16 / 809 » Special Section on Parallel Distributed Computing and Networ... |
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
14 years 9 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
111
click to vote
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper is a contribution to the inception of multiple tokens in solving distributed mutual exclusion problem. The proposed algorithm is based on the token ring approach and al...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
TRIDENTCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
77
Voted
GCC
2004
Springer
15 years 3 months ago
2004
Springer
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...