Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Evaluating the performance of four snooping cache coherency protocols
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Encapsulation of parallelism in the Volcano query processing system
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Journal of Algorithms
Parallel database systems: the future of high performance database systems
Communications of the ACM
Reducing TLB and memory overhead using online superpage promotion
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Iterators, schedulers, and distributed-memory parallelism
Software—Practice & Experience
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Garlic: a new flavor of federated query processing for DB2
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Practical Skew Handling in Parallel Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
ObjectGlobe: Ubiquitous query processing on the Internet
The VLDB Journal — The International Journal on Very Large Data Bases
Adapting to source properties in processing data integration queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Toward a progress indicator for database queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Estimating progress of execution for SQL queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Highly available, fault-tolerant, parallel dataflows
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
K2/Kleisli and GUS: experiments in integrated access to genomic data sources
IBM Systems Journal - Deep computing for the life sciences
Spreading the Load Using Consistent Hashing: A Preliminary Report
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Self-monitoring query execution for adaptive query processing
Data & Knowledge Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An adaptable distributed query processing architecture
Data & Knowledge Engineering
Parallel querying with non-dedicated computers
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Fault-Tolerance in Distributed Query Processing
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Concurrency and Computation: Practice & Experience
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Tuple routing strategies for distributed eddies
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
GridDB: a data-centric overlay for scientific grids
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Autonomic Query Parallelization using Non-dedicated Computers: An Evaluation of Adaptivity Options
ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Adapting to changing resource performance in grid query processing
DMG 2005 Proceedings of the First VLDB conference on Data Management in Grids
Progressive query optimization for federated queries
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Adaptive workload allocation in query processing in autonomous heterogeneous environments
Distributed and Parallel Databases
Evolution of Query Optimization Methods: From Centralized Database Systems to Data Grid Systems
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
An efficient skew-insensitive algorithm for join processing on grid architectures
Proceedings of the fifth international workshop on High-level parallel programming and applications
Efficient load balancing in partitioned queries under random perturbations
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Utility-driven adaptive query workload execution
Future Generation Computer Systems
Balancing reducer skew in MapReduce workloads using progressive sampling
Proceedings of the Third ACM Symposium on Cloud Computing
Hi-index | 0.00 |
Writing parallel programs that can take advantage of non-dedicated processors is much more difficult than writing such programs for networks of dedicated processors. In a non-dedicated environment such programs must use autonomic techniques to respond to the unpredictable load fluctuations that prevail in the computational environment. In adaptive query processing (AQP), several techniques have been proposed for dynamically redistributing processor load assignments throughout a computation to take account of varying resource capabilities, but we know of no previous study that compares their performance. This paper presents a simulation-based evaluation of these autonomic parallelization techniques in a uniform environment and compares how well they improve the performance of the computation. Four published strategies are compared with a new algorithm that seeks to overcome some weaknesses identified in the existing approaches. In addition, we explore the use of techniques from online algorithms to provide a firm foundation for determining when to adapt in two of the existing algorithms. The evaluations identify situations in which each strategy may be used effectively and in which it should be avoided.