readings
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
readings [2014/09/10 00:48] yixinluo |
readings [2014/09/11 14:40] yixinluo |
||
|---|---|---|---|
| Line 49: | Line 49: | ||
| * [[http://users.elis.ugent.be/~seyerman/ISCA10.pdf|Eyerman et al., "Modeling critical sections in amdahl’s law and its implications for multicore design", ISCA 2010.]] | * [[http://users.elis.ugent.be/~seyerman/ISCA10.pdf|Eyerman et al., "Modeling critical sections in amdahl’s law and its implications for multicore design", ISCA 2010.]] | ||
| * [[http://users.ece.cmu.edu/~omutlu/pub/bottleneck-identification-and-scheduling_asplos12.pdf|Joao et al., "Bottleneck Identification and Scheduling in Multithreaded Applications", ASPLOS 2012.]] | * [[http://users.ece.cmu.edu/~omutlu/pub/bottleneck-identification-and-scheduling_asplos12.pdf|Joao et al., "Bottleneck Identification and Scheduling in Multithreaded Applications", ASPLOS 2012.]] | ||
| + | |||
| + | === 9/16/2014 === | ||
| + | * Base-Delta-Immediate Compression | ||
| + | * RowClone | ||
| + | * more is coming | ||
| + | |||
| + | === 9/18/2014 === | ||
| + | * stall-time fair memory access scheduling for chip multiprocessors | ||
| + | * fairness via source throttling | ||
| + | * Providing Fairness on Shared-Memory Multiprocessors via Process Scheduling, Sigmetrics 2012. | ||
readings.txt · Last modified: 2014/12/03 21:12 by yixinluo
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
