5640 search results - page 64 / 1128 » Parallelizing the Data Cube |
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
14 years 2 months ago
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
WOMPAT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a new benchmark suite for parallel computers. SPEComp targets mid-size parallel servers. It includes a number of science/engineering and data processing applic...
DFT
2002
IEEE
14 years 1 months ago
2002
IEEE
Conversion of the flip-flops of the circuit into scan cells helps ease the test challenge; yet test application time is increased as serial shift operations are employed. Furthe...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
PPL
2008
13 years 8 months ago
2008
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...