Upper bound for defragmenting buddy heaps
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
A flexible data to L2 cache mapping approach for future multicore processors
Proceedings of the 2006 workshop on Memory system performance and correctness
Managing Distributed, Shared L2 Caches through OS-Level Page Allocation
Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
Adaptive insertion policies for high performance caching
Proceedings of the 34th annual international symposium on Computer architecture
Hi-index | 0.00 |
With the rapid development of computing performance on multicore era, the capacity of shared cache has been increasing. System architects need make maximum usage of shared resources to improve system performance. This paper mainly rebuilt free lists based on page coloring for achieving their privatization by a distributed method, which could really achieve page-level parallelism at the operating system level and decrease cache thrashing among applications. Experimental results show that if the paper uses matrix computing as working load, L2 Cache Misses Rate is reduced by about 12%, IPC increased by 10%.