Scheduling and mapping for parallel execution of extended SQL queries
Abdelkader Hameurlain, Franck Morvan · 1995
In this paper, we present an extension of PSA strategy (Parallel Scheduling Algorithm ), to determine an appropriate mapping of operations onto physical processors, taking into account the interconnection network topology of a sharednothing architecture. Performance evaluation, which relies on two benchmarks shows the efficiency of PSA strategy by comparing to Static Right-Deep strategy and to Bushy Tree Scheduling strategy. The major contributions of this work are (i) the incorporation of the mapping process into PSA strategy and (ii) the PSA strategy which provides a good trade-off between response time minimization and throughput maximization. 1 Introduction The problem of ESQL [9] queries optimization for parallel execution is fundamental to obtain high performance and high data availability. One way to increase optimization capacity is to improve the efficiency of generating an optimal execution plan. The design of an ESQL queries Optimizer may be decomposed into three dimension...