Dynamic Load Balancing in Parallel Database Systems
نویسنده
چکیده
Parallel database systems have to support both inter-transaction as well as intra-transaction parallelism. Inter-transaction parallelism (multi-user mode) is required to achieve high throughput, in particular for OLTP transactions, and sufficient cost-effectiveness. Intratransaction parallelism is a prerequisite for reducing the response time of complex and dataintensive transactions (queries). In order to achieve both goals dynamic strategies for load balancing and scheduling are necessary which take the current system state into account for allocating transactions and subqueries to processors and for determining the degree of intraquery parallelism. We study these issues for the major approaches of parallel database systems, Shared Nothing and Shared Disk, and for parallel scan and join processing in multi-
منابع مشابه
Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
Parallel database systems have to support both inter-transaction as well as intra-transaction parallelism. Inter-transaction parallelism (multi-user mode) is required to achieve high throughput, in particular for OLTP transactions, and sufficient cost-effectiveness. Intra-transaction parallelism is a prerequisite for reducing the response time of complex and data-intensive transactions (queries...
متن کاملDynamic Multi-Resource Load Balancing in Parallel Database Systems
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. For this purpose, dynamic scheduling and load balancing strategies are necessary that consider the current system state for determining the degree of intra-query parallelism and for selecting the processors for executi...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملDynamic Load Balancing in Hierarchical Parallel Database Systems
We consider the execution of multi-join queries in a hierarchical parallel system, i.e., a shared-nothing system whose nodes are shared-memory multiprocessors. In this context, load balancing must be addressed at two levels, locally among the processors of each shared-memory node and globally among all nodes. In this paper, we propose a dynamic execution model that maximizes local load balancin...
متن کاملEfficient Resource Utilization in Shared-Everything Environments
E cient resource usage is a key to achieve better performance in parallel database systems. Up to now, most research has focussed on balancing the load on several resources of the same type, i.e. balancing either CPU load or I/O load. In this paper, we present oating probe, a strategy for parallel evaluation of pipelining segments in a shared-everything environment that provides dynamic load ba...
متن کامل