Resource Scheduling for Parallel Query Processing on Computational Grids

Abstract

Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to run over collections of heterogeneous and autonomous nodes. In the context of database query processing, existing parallelisation techniques cannot operate well in Grid environments because the way they select machines and allocate tasks compromises partitioned parallelism. The main contribution of this paper is the proposal of a low-complexity, practical resource selection and scheduling algorithm that enables queries to employ partitioned parallelism, in order to achieve better performance in a Grid setting.

Resource allocation algorithm for a relational join operator in grid systems

“…The main idea behind the CA is very similar to the algorithm proposed by Gounaris et al [10,12]. The algorithm ranks the nodes in the grid according to their properties.…”

“…In this section we present quantitative evaluation of the Join Operator Resource Allocation (JORA) algorithm by comparing with a comparative algorithm (CA) which reflects the common properties of the recent resource allocation algorithms such as [10,12]. The main idea behind the CA is very similar to the algorithm proposed by Gounaris et al [10,12].…”

“…On the other hand, in [11,13] Gounaris et al enhanced their previous algorithm by providing dynamic resource allocation. In the proposed algorithm, the initial resource allocation is realized by the use of the algorithm which is proposed in [10]. Then, in each allocated node, a grid query evaluation service (GQES) is created.…”

“…Although these studies have common objectives, they provide different solutions for different types of parallelism for query processing. The studies [2,16,17,20,22] consider three types of parallelism, independent, pipelined and partitioned parallelism in allocating resources; whereas, the studies [10][11][12][13] propose resource allocation algorithms addressing only the partitioned parallelism.…”

“…For instance, Gounaris et al [10,12] proposed a resource scheduling method for parallel query processing in computational grids examining the partitioned parallelism problem. In their algorithm, they assumed the existence of a parallel query plan.…”