This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
readings [2015/11/03 07:17] nandita [Review Set 8] |
readings [2015/11/05 04:20] nandita [Optional Readings Mentioned in the Lecture] |
||
|---|---|---|---|
| Line 219: | Line 219: | ||
| * Kim et al., [[http://users.ece.cmu.edu/~omutlu/pub/tcm_micro10.pdf|Thread Cluster Memory Scheduling]], //MICRO 2010.// | * Kim et al., [[http://users.ece.cmu.edu/~omutlu/pub/tcm_micro10.pdf|Thread Cluster Memory Scheduling]], //MICRO 2010.// | ||
| * Ebrahimi et. al., [[ https://users.ece.cmu.edu/~omutlu/pub/fst_asplos10.pdf | Fairness via Source Throttling: A Configurable and High-Performance Fairness Substrate for Multi-Core Memory Systems]], // ASPLOS 2010// | * Ebrahimi et. al., [[ https://users.ece.cmu.edu/~omutlu/pub/fst_asplos10.pdf | Fairness via Source Throttling: A Configurable and High-Performance Fairness Substrate for Multi-Core Memory Systems]], // ASPLOS 2010// | ||
| + | |||
| + | |||
| + | ===== Lecture 16 ===== | ||
| + | ==== Optional Readings Mentioned in the Lecture ==== | ||
| + | * Moscibroda et al., [[https://users.ece.cmu.edu/~omutlu/pub/bless_isca09.pdf | A Case for Bufferless Routing in On-Chip Networks]] , //ISCA 2009// | ||
| + | * Das et al., [[http://research.microsoft.com/en-us/um/people/moscitho/Publications/MICRO2009.pdf |Application-Aware Prioritization Mechanisms for On-Chip Networks]], //MICRO 2009// | ||