Dynamic Memory Allocation for Multiple-Query Workloads

Abstract

This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate the inadequacies of static schemes with fixed scheduling and memory allocation policies. A dynamic adaptive scheme which integrates scheduling and memory allocation is developed and is shown to perform effectively under widely varying workloads. 1. Introduction An important reason for the popularity of relational database systems is their ability to process ad-hoc queries posed by the users. Past research on query processing has dealt with issues of query optimization, scheduling, and resource allocation. Unfortunately, most of the work in this area has concentrated on processing single queries and does not consider multi-user issues. A particularly important issue that has largely been ignored...