A data centered approach for cache partitioning in embedded real-time database system

  • Authors:
  • Hu Wei;Chen Tianzhou;Shi Qingsong;Jiang Ning

  • Affiliations:
  • College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, P.R.China;College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, P.R.China;College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, P.R.China;College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, P.R.China

  • Venue:
  • WSEAS Transactions on Computers
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Embedded real-time databases become a basic part of the embedded systems in many using environments. Caches are used for reducing the gap between processor and off-chip memory. But caches introduce unpredictability in general real-time systems. Although several cache partitioning approaches have been purposed to tackle this problem, there is no scheme designed for real-time database system up to now. In this paper, we present a data centered cache partitioning approach that allows different tasks to have a shared locking partition in cache. The hard real-time tasks will have their own partitions and thus they can perform high predictability. At the same time, a shared non-locking partition is reserved for the soft real-time tasks. In this way we can target performance improvements based on the data that are frequently used by many tasks in the system. Our experiment results show that the miss rate can be reduced by about 10%∼18% compared with that of a statically partitioned cache and by about 24%∼40% compared with a dynamic cache using LRU replacement policy.