schedule
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
schedule [2019/05/05 13:35] firtinac [2019 Lectures/Schedule] |
schedule [2019/05/24 09:35] alserm |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ===== Lecture Video Playlist on YouTube ===== | ===== Lecture Video Playlist on YouTube ===== | ||
| - | [[https://www.youtube.com/playlist?list=PL5Q2soXY2Zi-R5gIzmy3SO7keDNnQ0b8v|Lecture Playlist]] | + | [[https://www.youtube.com/playlist?list=PL5Q2soXY2Zi8OJwH_bn9UQqSF4wWYSzkp|Lecture Playlist]] |
| - | {{url>https://www.youtube.com/embed/videoseries?list=PL5Q2soXY2Zi-R5gIzmy3SO7keDNnQ0b8v}} | + | {{url>https://www.youtube.com/embed/6yITVKTDV0s}} |
| ====== 2019 Lectures/Schedule ====== | ====== 2019 Lectures/Schedule ====== | ||
| Line 14: | Line 14: | ||
| | W3 | 11.04 \\ Thu. |<hi #fff200> S1. {{https://people.inf.ethz.ch/omutlu/pub/rlmc_isca08.pdf|Self Optimizing Memory Controllers: A Reinforcement Learning Approach}}, ISCA 2008</hi> \\ {{SelfOptimizingMC-ege_slides.pdf|(PDF)}} | | | | | W3 | 11.04 \\ Thu. |<hi #fff200> S1. {{https://people.inf.ethz.ch/omutlu/pub/rlmc_isca08.pdf|Self Optimizing Memory Controllers: A Reinforcement Learning Approach}}, ISCA 2008</hi> \\ {{SelfOptimizingMC-ege_slides.pdf|(PDF)}} | | | | ||
| | @#CEECF5:W4 | @#CEECF5:18.04 \\ Thu. |@#CEECF5:<hi #fff200> S2. {{https://people.inf.ethz.ch/omutlu/pub/tesseract-pim-architecture-for-graph-processing_isca15.pdf|A Scalable Processing-in-Memory Accelerator for Parallel Graph Processing}}, ISCA 2015</hi> \\ {{Tesseract-slides.pdf|(PDF)}}{{Tesseract-slides.pptx|(PPT)}} |@#CEECF5: |@#CEECF5: | | | @#CEECF5:W4 | @#CEECF5:18.04 \\ Thu. |@#CEECF5:<hi #fff200> S2. {{https://people.inf.ethz.ch/omutlu/pub/tesseract-pim-architecture-for-graph-processing_isca15.pdf|A Scalable Processing-in-Memory Accelerator for Parallel Graph Processing}}, ISCA 2015</hi> \\ {{Tesseract-slides.pdf|(PDF)}}{{Tesseract-slides.pptx|(PPT)}} |@#CEECF5: |@#CEECF5: | | ||
| - | | W4 | 2.05 \\ Thu. |<hi #fff200> S3.1 {{https://people.inf.ethz.ch/omutlu/pub/drange-dram-latency-based-true-random-number-generator_hpca19.pdf | D-RaNGe: Using Commodity DRAM Devices to Generate True Random Numbers with Low Latency and High Throughput"}}, HPCA 2019</hi> \\ {{ca_seminar_presentation_d-range.pdf|(PDF)}} {{ca_seminar_presentation_d-range.pptx|(PPT)}} | | | | + | | W5 | 2.05 \\ Thu. |<hi #fff200> S3.1 {{https://people.inf.ethz.ch/omutlu/pub/drange-dram-latency-based-true-random-number-generator_hpca19.pdf | D-RaNGe: Using Commodity DRAM Devices to Generate True Random Numbers with Low Latency and High Throughput"}}, HPCA 2019</hi> \\ {{ca_seminar_presentation_d-range.pdf|(PDF)}} {{ca_seminar_presentation_d-range.pptx|(PPT)}} | | | |
| | ::: | ::: |<hi #fff200> S3.2 {{https://spectreattack.com/spectre.pdf|Spectre Attacks: Exploiting Speculative Execution}}, SP 2019</hi> \\ {{spectre_may2.pdf|(PDF)}} | | | | | ::: | ::: |<hi #fff200> S3.2 {{https://spectreattack.com/spectre.pdf|Spectre Attacks: Exploiting Speculative Execution}}, SP 2019</hi> \\ {{spectre_may2.pdf|(PDF)}} | | | | ||
| - | + | | @#CEECF5:W6 | @#CEECF5:9.05 \\ Thu. |@#CEECF5:<hi #fff200> S4.1 {{https://people.inf.ethz.ch/omutlu/pub/data-center-network-errors-at-facebook_imc18.pdf | A Large Scale Study of Data Center Network Reliability}}, ACM IMC 2018</hi> \\ {{paper_presentation_david_graf.pdf|(PDF)}}{{paper_presentation_david_graf.pptx|(pptx)}} |@#CEECF5: | @#CEECF5:| | |
| + | | ::: | ::: |@#CEECF5:<hi #fff200> S4.2 {{https://web.stanford.edu/~yatisht/pubs/darwin.pdf|Darwin: A genomics co-processor provides up to 15,000 x acceleration on long read assembly}}, ASPLOS 2018</hi> \\ {{20190503_joaosf_darwin.pdf|(PDF)}}{{20190503_joaosf_darwin.pptx|(PPT)}} |@#CEECF5: |@#CEECF5: | | ||
| + | | W7 | 16.05 \\ Thu. | <hi #fff200>S5.1 {{http://users.ece.cmu.edu/~rausavar/pubs/mosaic-osr18.pdf | Mosaic: Enabling Application-Transparent Support for Multiple Page Sizes in Throughput Processors}}, ACM SIGOPS Operating Systems Review 2018 </hi>\\ {{mosaic-cgiannou-16.05.19.pdf|(PDF)}}{{mosaic-cgiannou-16.05.19.pptx|(pptx)}} | | | | ||
| + | | ::: | ::: | <hi #fff200>S5.2 {{perceptron_branch_predictor.pdf|Dynamic branch prediction with perceptrons}}, HPCA 2001 </hi>\\ {{sca_branch_prediction_perceptron_simone_guggiari.pdf|(PDF)}} | | | | ||
| + | | @#CEECF5:W8 | @#CEECF5:23.05 \\ Thu. | @#CEECF5:<hi #fff200>S6 {{https://people.inf.ethz.ch/omutlu/pub/pim-enabled-instructons-for-low-overhead-pim_isca15.pdf|PIM-Enabled Instructions: A Low-Overhead, Locality-Aware Processing-in-Memory Architecture}}, ISCA, 2015 </hi>\\ {{pim-instructions.pptx|(PDF)}}{{pim-instructions.pptx|(pptx)}} |@#CEECF5: |@#CEECF5: | | ||
schedule.txt · Last modified: 2019/05/24 09:35 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
