DocumentCode :
3459798
Title :
MLP-Aware Dynamic Cache Partitioning
Author :
Moreto, Miquel ; Cazorla, Francisco J. ; Ramirez, Alex ; Valero, Mateo
Author_Institution :
Univ. Polytech. de Catalunya, Barcelona
fYear :
2007
fDate :
15-19 Sept. 2007
Firstpage :
418
Lastpage :
418
Abstract :
The limitation imposed by instruction-level parallelism (ILP) has motivated the use of thread-level parallelism (TLP) as a common strategy for improving processor performance. TLP paradigms such as simultaneous multithreading (SMT), chip multiprocessing (CMP) and combinations of both offer the opportunity to obtain higher throughputs. However, they also have to face the challenge of sharing resources of the architecture. Simply avoiding any resource control can lead to undesired situations where one thread is monopolizing all the resources and harming the other threads. Some studies deal with the resource sharing problem in SMTs at core level resources like issue queues, registers, etc. In CMPs, resource sharing is lower than in SMT, focusing in the cache hierarchy.
Keywords :
cache storage; multi-threading; multiprocessing systems; resource allocation; cache hierarchy; chip multiprocessing; core level resources; dynamic cache partitioning; instruction-level parallelism; issue queues; processor performance; resource control; resource sharing; simultaneous multithreading; thread-level parallelism; Clustering algorithms; Costs; Parallel processing; Partitioning algorithms; Proposals; Resource management; Streaming media; Surface-mount technology; Throughput; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architecture and Compilation Techniques, 2007. PACT 2007. 16th International Conference on
Conference_Location :
Brasov
ISSN :
1089-795X
Print_ISBN :
978-0-7695-2944-8
Type :
conf
DOI :
10.1109/PACT.2007.4336246
Filename :
4336246
Link To Document :
بازگشت