6897 search results - page 420 / 1380 » Parallelization of Modular Algorithms |
146
Voted
PARLE
1991
15 years 7 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...
138
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
125
click to vote
IPPS
2007
IEEE
15 years 10 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...
128
click to vote
IPPS
2007
IEEE
15 years 10 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...
124
click to vote
PDCAT
2007
Springer
15 years 10 months 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. ...