5183 search results - page 149 / 1037 » The Complexity of Distributions |
198
click to vote
MOBIHOC
2000
ACM
15 years 10 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
179
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
164
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
152
click to vote
JPDC
2008
15 years 6 months ago
2008
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
208
click to vote
TRIDENTCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the...