1923 search results - page 206 / 385 » Modeling Complexity in Secure Distributed Computing |
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
108
click to vote
HPCA
2000
IEEE
15 years 2 months ago
2000
IEEE
We consider a variety of dynamic, hardware-based methods for exploiting load/store parallelism, including mechanisms that use memory dependence speculation. While previous work ha...
DSN
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
IMC
2006
ACM
15 years 4 months ago
2006
ACM
The academic community has long acknowledged the existence of malicious botnets, however to date, very little is known about the behavior of these distributed computing platforms....