An Analysis on The Optimal Parititoning Configuration of Cache for Meeting Deadlines of Real - Time Tasks


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 11, pp. 2891-2902, Nov. 1997
10.3745/KIPSTE.1997.4.11.2891,   PDF Download:

Abstract

This paper presents an analysis on the optimal partitioning configuration of cache(memory) for meeting deadlines of periodic and aperiodic real-time task set. Our goal is not only to decrease the deadline missing ratio of each task by minimizing the task utilization, but also to allocate another tasks to idle spaces of cache. For this reason, we suggest an algorithm so that tasks could be allocated to cache segments. Here, the set of cache segments allocated tasks is called a cache partitioning configuration. Based on how tasks allocate to cache segments, we can get various cache partitioning configurations. From these configurations, we obtain the boundary of task utilization that tasks are possible to schedule, and analyze the cache optimal partitioning configuration that can be executed to minimize the task utilization.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. M. Hee and J. S. Chong, "An Analysis on The Optimal Parititoning Configuration of Cache for Meeting Deadlines of Real - Time Tasks," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 11, pp. 2891-2902, 1997. DOI: 10.3745/KIPSTE.1997.4.11.2891.

[ACM Style]
Kim Myung Hee and Joo Su Chong. 1997. An Analysis on The Optimal Parititoning Configuration of Cache for Meeting Deadlines of Real - Time Tasks. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 11, (1997), 2891-2902. DOI: 10.3745/KIPSTE.1997.4.11.2891.