5448 search results - page 32 / 1090 » Breakpoints and Time in Distributed Computations |
98
Voted
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
107
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
115
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
116
Voted
EUROPAR
2010
Springer
15 years 1 months ago
2010
Springer
In the age of Grid, Cloud, volunteer computing, massively parallel applications are deployed over tens or hundreds of thousands of resources over short periods of times to complete...
91
Voted
FTCS
1993
15 years 1 months ago
1993
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...