الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 159 |  |  |
| | | from | 159 | | |
Abstract
In a multi-processing environment extra misses are endured in the last level shared cache because each process is trying to utilize the whole cache space, resulting in high interference between their working sets, and thus a degraded performance. Cache partitioning offers a solution to this problem by dividing the cache into partitions where. each process is allowed to place its working set only in the partition it belongs to. We present a new cache partitioning scheme, which opposed to prior partitioning schemes in the literature, offers both high performance and fair allocation even with increasing number of simultaneously running processes and decreased cache associativity. The proposed scheme takes advantage of the broad number of sets in the cache by partitioning it set-wise. Also the partitioning is adaptive such that the partition sizes change dynamically to accommodate to the changing requirements of the mix of running processes. In this thesis we present the new set-based adaptive cache partitioning organization, discuss and analyze its advantages and downsides, and show, through experimentation, the effectiveness of the proposed scheme in enhancing the cache performance.