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

실시간 태스크의 마감시간 만족을 위한 캐쉬 최적 분할 형태의 분석

  • 김명희 (원광대학교 대학원 컴퓨터공학과) ;
  • 주수종 (원광대학교 컴퓨터공학과)
  • Published : 1997.11.01


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.