Managing Distributed Memory to Meet Multiclass Workload Response Time Goals

  • Authors:
  • Arnd Christian König

  • Affiliations:
  • -

  • Venue:
  • ICDE '99 Proceedings of the 15th International Conference on Data Engineering
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we present an online method for managing a goal oriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedback mechanism which dynamically changes the sizes of dedicated buffer areas and thereby the buffer hit rate for the different classes in such a way that user specified response time goals will be satisfied. The aggregated size of the buffer memory across all network nodes remains constant and only the partitioning is changed. The algorithm is based on efficiently approximating the trajectory of the per-class response time curves as a function of the available buffer. Changes in the workload that would lead to the violation of response time goals are counteracted by accordingly adjusting the buffer allocation. For local replacement decisions, we integrate a cost based buffer replacement algorithm to fit into our goal oriented approach. We have implemented out algorithm in a detailled simulation prototype and we present some first results with this prototype.