1612 search results - page 127 / 323 » Analysing Randomized Distributed Algorithms |
117
Voted
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
122
click to vote
SPAA
1990
ACM
15 years 9 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
137
click to vote
GCC
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
144
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
135
click to vote
GCC
2003
Springer
15 years 10 months ago
2003
Springer
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hy...