• DocumentCode
    1450363
  • Title

    Thread Cluster Memory Scheduling

  • Author

    Kim, Yoongu ; Papamichael, Michael ; Mutlu, Onur ; Harchol-Balter, Mor

  • Volume
    31
  • Issue
    1
  • fYear
    2011
  • Firstpage
    78
  • Lastpage
    89
  • Abstract
    Memory schedulers in multicore systems should carefully schedule memory requests from different threads to ensure high system performance and fair, fast progress of each thread. No existing memory scheduler provides both the highest system performance and highest fairness. Thread Cluster Memory scheduling is a new algorithm that achieves the best of both worlds by differentiating latency-sensitive threads from bandwidth-sensitive ones and employing different scheduling policies for each.
  • Keywords
    multi-threading; multiprocessing systems; scheduling; storage management; bandwidth sensitive thread; latency sensitive thread; multicore system; system performance; thread cluster memory scheduling; Clustering algorithms; Memory management; Multicore processing; Scheduling; Memory controller; bandwidth-sensitive threads; bank-level parallelism; fairness; latency-sensitive threads; memory intensity; memory scheduling algorithms; memory-level parallelism; multicore; multiprocessors; multithreaded systems; quality of service; row-buffer locality; system throughput; thread cluster;
  • fLanguage
    English
  • Journal_Title
    Micro, IEEE
  • Publisher
    ieee
  • ISSN
    0272-1732
  • Type

    jour

  • DOI
    10.1109/MM.2011.15
  • Filename
    5713324