6105 search results - page 344 / 1221 » A Parallel Algorithm for Bound-Smoothing |
178
click to vote
PARLE
1991
15 years 10 months ago
1991
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
165
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...
163
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
164
click to vote
PDCAT
2007
Springer
16 years 26 days ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...
189
click to vote
PDP
2006
IEEE
16 years 23 days ago
2006
IEEE
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of prev...