2924 search results - page 414 / 585 » Lower Bounds in Distributed Computing |
155
Voted
ECOOPW
1999
Springer
15 years 9 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
141
click to vote
PVM
1999
Springer
15 years 9 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
120
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. Previously it was known that the bisection width of an n-inp...
152
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...
117
Voted
SPAA
1992
ACM
15 years 9 months ago
1992
ACM
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...