Service Value Aware Memory Scheduler by Estimating Request Weight and Using per-Thread Traffic Lights

Keisuke Kuroyanagi 1 André Seznec 2
2 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : The memory controller has become one of the performance enabler of a computer system. Its impact is even higher on multicores than it was on uniprocessor systems. In this paper, we propose the sErvice Value Aware memory scheduler (EVA) to enhance memory usage. EVA builds on two concepts, the request weight and the per-thread traffic light. For a read request on memory, the request weight is an evaluation of the work allowed by the request. Per-thread traffic lights are used to track whether or not in a given situation it is worth to service requests from a thread, e.g. if a given thread is blocked by refreshing on a rank then it is not worth to serve requests from the same thread on another rank. The EVA scheduler bases its scheduling decision on a service value which is heuristically computed using the request weight and per-thread traffic lights. Our EVA scheduler implementation relies on several hardware mechanisms, a request weight estimator, per-thread traffic estimators and a next row predictor. Using these components, our EVA scheduler estimates scores to issue scheduling decisions. EVA is shown to perform efficiently and fairly compared with previous proposed memory schedulers. For the memory scheduling competition, we submit EVA to Delay and PFP tracks and EVA-E (EVA with optimisations for EDP) to EDP track. Total delay is 2975 ×107, EDP value is 19.79 and PFP value is 2842 ×107.
Type de document :
Communication dans un congrès
3rd JILP Workshop on Computer Architecture Competitions (JWAC-3): Memory Scheduling Championship (MSC), Jun 2012, Portland, United States. 2012
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00746951
Contributeur : André Seznec <>
Soumis le : mardi 30 octobre 2012 - 10:42:00
Dernière modification le : mardi 16 janvier 2018 - 15:54:17
Document(s) archivé(s) le : jeudi 31 janvier 2013 - 03:45:39

Fichier

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

Identifiants

  • HAL Id : hal-00746951, version 1

Citation

Keisuke Kuroyanagi, André Seznec. Service Value Aware Memory Scheduler by Estimating Request Weight and Using per-Thread Traffic Lights. 3rd JILP Workshop on Computer Architecture Competitions (JWAC-3): Memory Scheduling Championship (MSC), Jun 2012, Portland, United States. 2012. 〈hal-00746951〉

Partager

Métriques

Consultations de la notice

445

Téléchargements de fichiers

149