Moreover, typically, previous work investigated en- forcing a given resource partitioning of a single re- source, within a single software tier at a time. In our own previous work in the area of dynamic parti- tioning, we have investigated either partitioning mem- ory, through a simulation-based exhaustive search ap- proach [24], or partitioning storage bandwidth, through an adaptive feedback-loop approach [23], but not both. In this paper, we consider the problem of global resource allocation, which involves proportioning the database and storage server caches, and the storage band- width among applications, according to overall perfor- mance goals. To achieve this, we focus on building a simple performance model in order to guide the.
