Introducing a Data Sliding Mechanism for Cooperative Caching in Manycore Architectures

Abstract : In this paper, we propose a new cooperative caching method improving the cache miss rate for manycore micro- architec- tures. The work is motivated by some limitations of recent adaptive cooperative caching proposals. Elastic Cooperative caching (ECC), is a dynamic memory partitioning mechanism that allows sharing cache across cooperative nodes according to the application behavior. However, it is mainly limited with cache eviction rate in case of highly stressed neighbor- hood. Another system, the adaptive Set-Granular Cooperative Caching (ASCC), is based on finer set-based mechanisms for a better adaptability. However, heavy localized cache loads are not efficiently managed. In such a context, we propose a cooperative caching strategy that consists in sliding data through closer neighbors. When a cache receives a storing request of a neighbor's private block, it spills the least recently used private data to a close neighbor. Thus, solicited saturated nodes slide local blocks to their respective neighbors to always provide free cache space. We also propose a new Priority- based Data Replacement policy to decide efficiently which blocks should be spilled, and a new mechanism to choose host destination called Best Neighbor selector. The first analytic performance evaluation shows that the proposed cache management policies reduce by half the average global communication rate. As frequent accesses are focused in the neighboring zones, it efficiently improves on-Chip traffic. Finally, our evaluation shows that cache miss rate is en- hanced: each tile keeps the most frequently accessed data 1- Hop close to it, instead of ejecting them Off-Chip. Proposed techniques notably reduce the cache miss rate in case of high solicitation of the cooperative zone, as it is shown in the performed experiments.
Type de document :
Communication dans un congrès
The 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, Massachusetts, United States. pp.335-344, 2013
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00833565
Contributeur : Safae Dahmani <>
Soumis le : jeudi 13 juin 2013 - 09:38:42
Dernière modification le : jeudi 9 février 2017 - 15:01:39
Document(s) archivé(s) le : samedi 14 septembre 2013 - 04:10:58

Fichier

DahCudGog_HIPS2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00833565, version 1

Collections

Citation

Safae Dahmani, Loïc Cudennec, Guy Gogniat. Introducing a Data Sliding Mechanism for Cooperative Caching in Manycore Architectures. The 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, Massachusetts, United States. pp.335-344, 2013. <hal-00833565>

Partager

Métriques

Consultations de
la notice

395

Téléchargements du document

167