Compositional memory systems for data intensive applications

To alleviate the system performance unpredictability of multitasking applications running on multiprocessor platforms with shared memory hierarchies, we propose a task level set based cache partitioning. We evaluate our approach on a CAKE platform with three Trimedias, one MIPS, and a shared level 2 cache using a picture in picture benchmark. We compare the performance implications of two types of cache partitioning namely set based. Our experiments indicate that associativity-based cache partitioning induces at least 30% performance degradation, whereas set-based partitioning provides 27% performance improvement when compared to non-partitioned cache scenario.

[1]  John Turek,et al.  Optimal Partitioning of Cache Memory , 1992, IEEE Trans. Computers.

[2]  Derek Chiou Extending the reach of microprocessors: column and curious caching , 1999 .

[3]  Sharad Malik,et al.  Cache miss equations: an analytical representation of cache misses , 1997, ICS '97.

[4]  Henk L. Muller,et al.  Caches with Compositional Performance , 2002, Embedded Processor Design Challenges.

[5]  G. Edward Suh,et al.  Analytical cache models with applications to cache partitioning , 2001, ICS '01.

[6]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[7]  P. Stravers,et al.  Homogeneous multiprocessing and the future of silicon design paradigms , 2001, 2001 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers (Cat. No.01TH8517).

[8]  Tughrul Arslan,et al.  Proceedings Design, Automation and Test in Europe Conference and Exhibition , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[9]  D. B. Kirk,et al.  SMART (strategic memory allocation for real-time) cache design , 1989, [1989] Proceedings. Real-Time Systems Symposium.