ACM Home Page
Please provide us with feedback. Feedback
Compositional, efficient caches for a chip multi-processor
Full text PdfPdf (304 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings table of contents
Munich, Germany
SESSION: Processor and memory design table of contents
Pages: 345 - 350  
Year of Publication: 2006
ISBN:3-9810801-0-6
Authors
A. M. Molnos  Delft University of Technology, Delft, The Netherlands
M. J. M. Heijligers  Philips Research Laboratories, Eindhoven, The Netherlands
S. D. Cotofana  Delft University of Technology, Delft, The Netherlands
J. T. J. van Eijndhoven  Philips Research Laboratories, Eindhoven, The Netherlands
Sponsors
: The EDA Consortium
EDAA : European Design and Automation Association
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In current multi-media systems major parts of the functionality consist of software tasks executed on a set of concurrently operating processors. Those tasks interfere with each other when they share memory and other hardware components. For instance when the tasks share caches and no precautions are taken they potentially flush each other's data at random. In this case the control over the system performance is lost. However, in media processing the performance must be under tight control. In particular the performance of each individual task must be preserved if the tasks are executed concurrently in arbitrary combinations or if additional tasks are added. A system satisfying this property is addressed as being compositional.This paper proposes a novel cache partitioning technique that enhances compostionality. We assume a cache to be a rectangular array of memory elements arranged in "sets" (rows) and "ways" (columns). We perform two partitioning types. First, each task and each inter-task common data gets an exclusive part of the cache sets. Second, inside the cache sets of common data each task accessing it gets a number of ways. We apply the proposed method on a homogeneous multiprocessor using two applications: H.264 decoding and picture-in-picture-TV. Our experiments indicate that, for both applications, under our partitioning scheme the sum of misses of the individual tasks executed separately and the number of misses of all tasks executed concurrently differs at most by 4%. We conclude that compositionality is achieved within reasonable bounds. Additionally, our technique appears to improve the efficiency of the cache operation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ftp://ftp.1dv.e-technik.tu-muenchen.de/pub/test_sequences/.
 
2
3
 
4
 
5
 
6
D. B. Kirk. Smart (strategic memory allocation for real-time) cache design. IEEE symposium on Real Time Systems, pages 229--237, 1989.
 
7
 
8
9
 
10
 
11
B. A. Nayfeh and K. Olukotun. Exploring the design space for a shared-cache multiprocessor. pages 166--175, 1994.
 
12
F. Sebek. The state of the art in cache memories and realtime systems. (01/37), Oct. 2 2001.
 
13
 
14
E. B. van der Tol, E. G. Jaspers, and R. H. Gelderblom. Mapping of H.264 decoding on a multiprocessor architecture. In Image and Video Communications and Processing 2003, pages 707--718, May 2003.
 
15
J. T. van Eijndhoven, J. Hoogerbrugge, M. Jayram, P. Stravers, and A. Terechko. Chapter: Cache-Coherent Heterogeneous Multiprocessing as Basis for Streaming Applications, in Dynamic and robust streaming between connected CE-devices. Kluwer Academic Publishers, 2005.

Collaborative Colleagues:
A. M. Molnos: colleagues
M. J. M. Heijligers: colleagues
S. D. Cotofana: colleagues
J. T. J. van Eijndhoven: colleagues