1 / 21

Computer Organization TI1400

Computer Organization TI1400. Alexandru Iosup (lecturer) Parallel and Distributed Systems. http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_0-plus-13.ppt. Course website: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm. The Peak Performance Issue.

tashya-mckay
Download Presentation

Computer Organization TI1400

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer OrganizationTI1400 Alexandru Iosup (lecturer) Parallel and Distributed Systems http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_0-plus-13.ppt Course website: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm

  2. The Peak Performance Issue Source: http://www.cs.berkeley.edu/~volkov/cs267.sp09/hw1/results/

  3. The Performance Gap Processor-Memory Processor: CPU Speeds 2X every 2 years~Moore’s Law; limit ~2010 Memory: DRAM Speeds 2X every 7 years Gap Still Growing? Gap: 2X every 2 years 3

  4. The “Data Deluge”: Facts and Predictions "Everywhere you look, the quantity of information in the world is soaring. According to one estimate, mankind created 150 exabytes (billion gigabytes) of data in 2005. This year, it will create 1,200 exabytes. Merely keeping up with this flood, and storing the bits that might be useful, is difficult enough. Analysing it, to spot patterns and extract useful information, is harder still.“The Data Deluge, The Economist, 25 February 2010.

  5. TI1400 in Numbers • Seen 126 students • 106 took the entry quiz • 81 (64%) took the mid-term exam (52% grade 6 or higher) • 47 (37%) gained activity points • 37 (29%) gained Course/Tutorial activity points • 22 (17%) completed the self-study assignment • 30 got access to the extra lectures • 22+ got access to the extra Lab assignments

  6. TI1400: Course/Tutorial Cum Laudae Semi-Anonymized Name Activity Items Jeroen P. 13 Remco de W. 12 Laurens V. 10 Tim H. 9 Martijn de V. 8 Lucas van D. 7 Stefan H. 5 Yanick van L. 5 Jesse D. 5 Ginger G. 5

  7. TI1400: Self-Study Assignment Complete Wendy B. Niels D. Martijn de V. 10/22 students have not been active in the Course/Tutorial Remco de W. Martijn den H. Jesse D. Jan G. Bart H. Tim H. Stefan H. Soheil J. Martin K. Valentine M. Markus P. Alexander P. Hugo R. Vera S. Wiebe van G. Yanick van L. Kevin van N. Laurens V.

  8. TI1400/2012 Schedule

  9. Conceptual Map of TI1400/2012 L0. Introduction L1. Digital Logic L2. Digital Data L3. ISAs L4. Assembler L5. IA-32/MIPS L6. Basic Processing Unit You are here L7.1. I/O + OS L7.1. Memory + Perf. L9. Large Sys. L8. Pipelining + Perf. Rd. Prog. Principles

  10. The Grading System—Learn, not Hunt 1. Course Points 2. Access Tokens 3. Brownie Points 10,000 for straight 10 Start with 1 • Tim H. already has 4,050 points +1,000 team self-study Bonus Lab assignments I will bake brownies for you!(but not forceyou to eat them) +1,000 lab bonus #2 +500 lab bonus #1 Advanced topics (GPUs, clouds) +300 correct exam Q +50 activity in Lab/Lecture/Tutorial Discuss w Lecturer +25 correct end-lecture quiz Propose Exam Qs Rec. letter +500 entry quiz

  11. Access: Advanced Topics • HB09.130, 09:00 to 11:00 • June 1, Cloud Computing • June 18, GPU and Multi-Core Computing • Access • Top 10 score • Top 5 course/tutorial activity • Top 5 end-lecture quiz • Another 10 seats open, announced May 31 Tim H. Laurens V. KoosvdL. RemcodW. Niels S. Tiemen J. Kevin vN. Erwin vE. Dimitri S. Robert L. Alexander P. YanickvL. MartijndV. Ginger G. Lucas vD. Rik N. Dirk S. Jesse D. Stefan H.

  12. More SAs Laboratory (+Bonus Exercises) More hours • Goal: practical experience with assembly (mandatory) • Goal: lots of work, lots of fun … +500 to 1,500 points • Bonus topics • High-performance data privacy … in assembly • An interactive game … in assembly • Access to bonus • Complete the 5 mandatory exercises in the first 2 sessions • Activity points at course and/or tutorial • Self-study assignment complete

  13. Final Exam: July 2(?), 2012 Mandatory, access only with Lab complete 30 multiple-choice questions, up to 9,000 points First 10 multiple-choice questions match mid-term exam Automatic use of best score for first 10 questions from mid-term and final exams(You can only win!) Questions change between mid-term and final exam (Unlike last year!)

  14. Final Exam 2012 [1/6]Po-ta-to, Po-tah-to Q: What happens to terms in Dutch? After all, you did lecture in English?! A: Goede vraag! Most terms are in English anyway Every question includes both Dutch and English version The Dutch version has been checked by a native Dutch speaker

  15. Final Exam 2012 [2/6]Our Kind of Questions Q: What kind of questions will you ask? A: In principle, any kind of questions. However, think about all those end-lecture tests: Four choices, answer not obvious (unless you learned the tricks) Excercises that look like much work aren’t (learn the tricks) Q: How difficult? A: Enough to test your skills. Hopefully enough to separate. Difficult for the easy stuff, mid-level for difficult stuff Think mid-term exam!

  16. Final Exam 2012 [3/6] V.C. Hamacher, Z.G. Vranesic, S.G. Zaky, Computer Organization, McGraw-Hill, fifth edition, 2002. Chapter 1 Complete Chapter 2 Complete Chapter 3 No Chapter 4 All but 4.3,4.6,4.7 Chapter 5 All but 5.2.2-3,5.5.3-4,5.6-5.10 Chapter 6 All but 6.2,6.4-6,6.7.4 Chapter 7 All but example details Chapter 8 All but 8.7 Appendix A Complete Chapter 9 No Appendix B No Chapter 10 All but 10.3 Appendix C No Chapter 11 No Appendix D No Chapter 12 Complete Appendix E Only E.2 Supersedeshttp://www.pds.its.tudelft.nl/vakken/in1705/exams/ti1400_tentamenstof.pdf

  17. Final Exam 2012 [3/6] see Blackboard or web site for course schedule http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm Reader (Dictaat), version 2007 Chapter 1 Complete Chapter 2 Complete Chapter 3 Complete Chapter 4 Complete Chapter 5 Complete Lab Result: Complete Assignment 2 Complete Assignment 3 Complete Assignment 4 Complete Assignment 5 Complete Extras 6 and 7 Not necessary

  18. Final Exam 2012 [4/6]Topics for First Two Lectures Q: Which chapters topics for the mid-term exam? A: see Blackboard or web site for course lectures: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm Lectures 1.1 and 1.2 cover … Basic Concepts, Digital Logic (Karnaugh maps/diagrams), Memory Elements, Finite State Machines Lectures 2.1 and 2.2 cover … Number representation (SM, 1C, 2C, Excess-x, Fixed point, Floating point, …), Arithmetic (…), Conversion (SM to 1C, Fixed to Float, Rounding, …)

  19. Final Exam 2012 [5/6]Topics for Remainder Q: Which chapters topics for the mid-term exam? A: see Blackboard or web site for course lectures: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm ISA: Von Neumann machine; instruction fetch, decode, execute; instruction sets and types; instruction formats; addressing types; subroutine call and return mechanisms; I/O and interrupts; … Memory: memory hierarchy; main memory organization and operation; performance issues; cache memories; virtual memory; … I/O: handshaking; buffering; programmed I/O; interrupt-driven I/O; interrupt structure: vectored, prioritized; buses: types (incl. DMA), arbitration; relation to Operating Systems; …

  20. Final Exam 2012 [6/6]Topics for Remainder Q: Which chapters topics for the mid-term exam? A: see Blackboard or web site for course lectures: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm Basic Processing Unit: control unit: hardwired vs microprogrammed; instruction pipelining and instruction-level parallelism; performance issues; … Multiprocessor architectures: Flynn taxonomy, incl. SIMD and MIMD; interconnection networks; shared- and distributed-memory systems; distributed memory systems, incl. cache coherence policies; memory consistency; … Good Luck!

  21. Questions? http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_0-plus-13.ppt Course website: http://www.pds.ewi.tudelft.nl/~iosup/Courses/2012_ti1400_results.htm

More Related