An adaptive bloom filter cache partitioning scheme for multicore architectures

Nikas, K; Horsnell, M; Garside, J

dc.contributor.author	Nikas, K	en
dc.contributor.author	Horsnell, M	en
dc.contributor.author	Garside, J	en
dc.date.accessioned	2014-03-01T02:45:05Z
dc.date.available	2014-03-01T02:45:05Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32146
dc.subject	Bloom iters	en
dc.subject	Cache partitioning	en
dc.subject	Multicore architectures	en
dc.subject.other	Architecture	en
dc.subject.other	Blooms (metal)	en
dc.subject.other	Buffer storage	en
dc.subject.other	Embedded systems	en
dc.subject.other	Bloom filters	en
dc.subject.other	Bloom iters	en
dc.subject.other	Cache partitioning	en
dc.subject.other	Cache replacement policies	en
dc.subject.other	Core systems	en
dc.subject.other	Dynamic caches	en
dc.subject.other	Least Recently Used	en
dc.subject.other	LRU policies	en
dc.subject.other	Multi-core systems	en
dc.subject.other	Multicore architectures	en
dc.subject.other	Multiple applications	en
dc.subject.other	New systems	en
dc.subject.other	Replacement policies	en
dc.subject.other	Resource Sharing	en
dc.subject.other	Shared caches	en
dc.subject.other	Shared resources	en
dc.subject.other	Uniprocessor	en
dc.subject.other	Uniprocessor systems	en
dc.subject.other	Computer architecture	en
dc.title	An adaptive bloom filter cache partitioning scheme for multicore architectures	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICSAMOS.2008.4664843	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICSAMOS.2008.4664843	en
heal.identifier.secondary	4664843	en
heal.publicationDate	2008	en
heal.abstract	This paper investigates the problem of partitioning the last-level shared cache of multicore architectures. 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 the last-level cache. Today, cache replacement policies, extensively studied for uniprocessor systems, are being employed within new multicore architectures with little, if any, adaptation. However the parameters in these new systems are likely to be different. The least recently used (LRU) policy, for example, which is widely accepted as the best replacement policy in uniprocessor caches, often results in poor resource sharing in a multicore system, signalling the importance of reevaluating the effectiveness of these policies in the new architectures. This paper proposes Adaptive Bloom Filter Cache Partitioning (ABFCP), a low-cost, dynamic cache partitioning mechanism capable of better resource sharing at the last-level cache than LRU, improving the performance of an eight-core system on average by 5.92% over the LRU policy. Moreover, the proposed scheme provides the equivalent performance bene ts that could be gained from almost a 50% increase in the last-level cache and shows increasing bene t as the number of cores rises. ©2008 IEEE.	en
heal.journalName	Proceedings - 2008 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, IC-SAMOS 2008	en
dc.identifier.doi	10.1109/ICSAMOS.2008.4664843	en
dc.identifier.spage	25	en
dc.identifier.epage	32	en