16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007) (2007)
Sept. 15, 2007 to Sept. 19, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PACT.2007.49
Miquel Moreto , Universitat Politecnica de Catalunya, Spain
Francisco J. Cazorla , Universitat Politecnica de Catalunya, Spain
Alex Ramirez , Universitat Politecnica de Catalunya, Spain; Barcelona Supercomputing Center, Spain
Mateo Valero , Universitat Politecnica de Catalunya, Spain; Barcelona Supercomputing Center, Spain
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.
F. J. Cazorla, M. Valero, A. Ramirez and M. Moreto, "MLP-Aware Dynamic Cache Partitioning," 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)(PACT), Brasov, Romania, 2007, pp. 418.