DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/9726
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChaturvedi, Nitin-
dc.date.accessioned2023-03-14T11:16:22Z-
dc.date.available2023-03-14T11:16:22Z-
dc.date.issued2010-12-
dc.identifier.uri10.5121/ijcsit.2010.2604-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9726-
dc.description.abstractThis paper is aimed at exploring the various techniques currently used for partitioning last level (L2/L3)caches in multicore architectures, identifying their strengths and weaknesses and thereby proposing a novel partitioning scheme known as Adaptive Block Pinning which would result in a better utilization of the cache resources in CMPs. The widening speed gap between processors and memory along with the issue of limited on-chip memory bandwidth make the last-level cache utilization a crucial factor in designing future multicore processors. Contention for such a shared resource has been shown to severely degrade performance when running multiple applications. As architectures incorporate more cores, multiple application workloads become increasingly attractive, further exacerbating contention at thelast-level cache. Several Non-Uniform Cache Architecture (NUCA) schemes have been proposed which try to optimally use the capacity of last-level shared caches and lower access times on an average. This isdone by continually monitoring the cache usage by each core and dynamically partitioning it so as to increment the overall hit ratio.en_US
dc.language.isoenen_US
dc.publisherIJCSTen_US
dc.subjectEEEen_US
dc.subjectMulti-core Architecturesen_US
dc.titleAdaptive Block Pinning Based: Dynamic Cache Partitioning for Multi-core Architecturesen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.