Multi-dimensional Resource Scheduling for Parallel Queries

Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution environment, where each system node represents a collection of time-shareable resources (e.g., CPU(s), disk(s), etc.) and communicates with other nodes only by message-passing. Significant research effort has concentrated on only a subset of the various forms of intra-query parallelism so that scheduling and synchronization is simplified. In addition, most previous work has focused its attention on one-dimensional models of parallel query scheduling, effectively ignoring the potential benefits of resource sharing. In this paper, we develop an approach that is more general in both directions, capturing all forms of intra-query parallelism and exploiting sharing of multi-dimensional resourcenodesamongconcurrentplan operators. This allows scheduling a set of independent query tasks (i.e., operator pipelines) to be...

• Type: Conference
• Year: 1996
• Where: SIGMOD
• Authors: Minos N. Garofalakis, Yannis E. Ioannidis
• Keywords: Database, Intra-query Parallelism, List Scheduling, Parallel Query Scheduling, SIGMOD 1996