4045 search results - page 5 / 809 » Special Section on Parallel Distributed Computing and Networ... |
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
66
Voted
HPCA
2008
IEEE
15 years 4 months ago
2008
IEEE
91
Voted
HPCA
2008
IEEE
15 years 4 months ago
2008
IEEE
JPDC
2006
14 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
94
Voted
APDC
1997
14 years 11 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...