Differences

This shows you the differences between two versions of the page.

--- projects [2015/12/06 19:38]
nandita [Final Presentation (December 14th)]
+++ projects [2015/12/13 19:01] (current)
nandita [Important Dates]
@@ Line 17: / Line 17: @@
   * **Milestone 1**: October 20 and 21, 2015
   * **Milestone 2**: November 17, 2015
-  * **Final Presentation**: December 14, 2015 (1:30 - 4:30 PM)
+  * **Final Presentation**: December 14, 2015 (2:00 - 4:30 PM)
   * **Poster Session**: December 15, 2015 (1:30 - 4:30 PM)
   * **Project Report Due**: December 20, 2015 (midnight)
@@ Line 86: / Line 86: @@
 ===== Final Presentation (December 14th)  =====
-**When:**  December 14th, 2015 (1:30 - 4:30 PM)
+**When:**  December 14th, 2015 (2:00 - 4:30 PM)
 **Where:** CIC 4th Floor, Panther Hollow Conference Room
-**Format:** 15 mins in total:  presenting slides (12 mins)  + Q&A (3 mins).
+**Format:** 15 mins in total:  presenting slides (12 mins)  + Q&A (3 mins).  **Please practice for this length.** You will be given a warning at 10 minutes and cut off at 12.
+**Submission:** You must send your slides in pptx format to 740-official@ece.cmu.edu by 11 AM on December 14th. We will be running all presentations on a staff computer to reduce delay between presenters.
+**What to present:**
+  * The problem you are solving + your goal
+  * How is this different from past work? What is your novelty?
+  * The key idea behind your solution
+  * More details on your mechanims
+  * Your methodology to test your ideas
+  * Results and analyses from your evaluation and comparison with prior work
+  * Conclusion with advantages and shortcomings of your mechanism and future work
+** Presentation Schedule (14th December)**
+  -  Dimitrios Stamoulis and Antonis Manousis
+  -  Jonathan Leung and Madhav Iyengar
+  -  Vignesh Balaji
+  -  Elliot Rosen and Gaurav Srivastava
+  -  Elena Feldman, Ashish Shrestha and Amanda Marano
+  - Amirali Boroumand and Minesh Patel
+  - Abhijith Kashyap
+** Presentation Schedule (16th December)**
+  - Damla Senol and Jeremie Kim
+  - Kais Kudrolli and Raghav Gupta
@@ Line 106: / Line 132: @@
 [[http://www.ece.cmu.edu/~ece740/f11/doku.php?id=wiki:project#poster_session|more example posters]]
+===== Final Project Report (December 20th) =====
+You will hand in a report in the conference submission style.
+Your final report should be formatted and written as if you are submitting the report to a top computer architecture conference.
+The report should include the following:
+  * A descriptive title and author names
+  * Abstract
+  * Introduction (Problem and Motivation)
+  * Related Work and its Shortcomings
+  * Description of the Techniques (designed and evaluated)
+  * Evaluation Methodology
+  * Results and Analyses
+  * Conclusion/Summary
+  * Lessons Learned, Shortcomings, and Future Work
+  * Acknowledgements (if any)
+  * References (cited throughout the paper)
+The page limit is 10 double column, single-spaced pages. Make sure your document is spell-checked and grammatically sound. You are encouraged to use the LaTeX template above.
+Advice:
+The key characteristic that distinguishes a “good” research paper from a “bad” one is the existence of “clearly explained insight.” I expect the highest quality of writing as well as clear descriptions of the ideas and techniques from the final report. Even if your research results in a “negative result” (not all research ideas pan out to be useful, in fact few of them do) writing it in a very insightful and intuitive manner can make the research very powerful and important. So, please do spend a significant amount of time and effort to ensure that your report is insightful and explains the ideas very clearly (possibly with examples and good analogies).
+**Examples:**
+See the readings throughout this course for examples. Some selected favorites:
+{{:parbs_isca08.pdf|Mutlu and Moscibroda, “Parallelism-Aware Batch Scheduling,” ISCA 2008.}}
+{{mutlu_micro05.pdf|Onur Mutlu, Hyesoon Kim, and Yale N. Patt, "Address-Value Delta (AVD) Prediction: Increasing the Effectiveness of Runahead Execution by Exploiting Regular Memory Allocation Patterns," MICRO 2005.}}