Sciweavers

1007 search results - page 58 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IPPS
2003
IEEE
15 years 7 months ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
117
Voted
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
15 years 8 months ago
Parallel genetic algorithms on line topology of heterogeneous computing resources
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
Yiyuan Gong, Morikazu Nakamura, Shiro Tamaki
121
Voted
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 7 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
123
Voted
PVM
1999
Springer
15 years 6 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
CIKM
2008
Springer
15 years 4 months ago
Modeling and exploiting query interactions in database systems
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing per...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...