Sciweavers

4045 search results - page 5 / 809
» Special Section on Parallel Distributed Computing and Networ...
Sort
View
ICDCS
1995
IEEE
13 years 11 months ago
A Distributed K-Mutual Exclusion Algorithm
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...
Shailaja Bulgannawar, Nitin H. Vaidya
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
APDC
1997
13 years 8 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' 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...
Ishfaq Ahmad, Muhammad Kafil