1. 1 EGRE 426 Handout 1 8/25/09

2. 2 Preliminary EGRE 365 is a prerequisite for this class. Class web page http://www.people.vcu.edu/~jhtucker/f09- egre426/index.html Syllabus Grades: –Quizzes (2)40% –Homework10% –Laboratory10% –Design Project15% –Final Exam25% Text book Computer Organization and Design 3 rd edition, Designers Guide to VHDL.

3. 3 Computer Organization and Design This book and the slightly more advanced Computer Architecture a Quantitative Approach are the dominant computer architecture text books. Too big. –Chapter 1 – Read –Chapter 2-7 – will be covered in detail skipping some material. –Chapters 8-9 – Will depend on time. –Supplement with additional material.

4. 4 Introduction We will learn not just how computers work, but gain an understanding into how and why computers evolved into the current generation. Computer have undergone rapid changes. –Increasing performance –Decreasing cost

5. 5 History Computers did not really begin until World War II. The widespread use of microprocessors began about 35 years ago. Personal computers were not taken seriously until the introduction of the IBM PC in 1981.

6. 6 Computers have resulted in the information revolution. Agricultural revolution. –Several Thousand years. Industrial revolution. –Several Hundred years. Information revolution. –A couple of decades.

7. 7 My History I started at NASA in 1963 and worked in the computer division. –At that time computers were very expensive and very large. –Programs were written on punched cards (one line per card) and fed into the computer. –The state-of-the-art super computer that I worked with was capable of executing one million instructions per second, it cost several million dollars, and occupied the major portion of a large building.

8. 8 My History continued In the 60’s I did early work in interactive computing techniques. –Forerunner of what we do today, but not practical when it required a dedicated super computer connected to a display console. In 1974 I completed my PhD and started working with microprocessors.

9. 9 Moore’s Law One of the founders of Intel, Dr. Gordon Moore, observed in 1965 that the number of transistors in an IC was doubling every year. He predicted that this would continue for a couple of decades and then slow to doubling every 18 months. This prediction has proved remarkably accurate. So much so that it has come to be expected, and Moore’s prediction has become known as Moore’s law. –It is worth noting that since Moore made his prediction the consensus at any time has been that it would last for only about ten more years. –Economics not technology may be what actually stops Moore’s law.

10. 10

11. 11

12. 12

13. 13

14. 14

15. 15 Single instruction stream – single data stream

16. 16 Multiple instruction stream – multiple data stream.

17. 17 Single instruction stream – single data stream

18. 18

19. 19 Definitions Efficiency is the measurement of how close we come to achieving ideal speed up.

20. 20

21. 21 Assumptions All operations take one unit of time. All instructions and data are available when needed. i.e. We don’t have to wait for memory or communication. This is naïve and completely unrealistic, but can be used to teach some fundamental truths.

22. 22 Conventional uniprocessor (SISD) TA1*B1A2*B2A3*B3A4*B4…An*Bn 1 2 3 4 5 6

23. 23 Multiprocessor MIMD (unlimited processors) SIMD – same results. TA1*B1A2*B2A3*B3A4*B4…An*Bn 1 2 3 4 5 6

24. 24 Multifunction computer (2 * units) TA1*B1A2*B2A3*B3A4*B4…An*Bn 1 2 3 4 5 6

25. 25 SISD – single processor TA1A1 A2A2 A3A3 A4A4 A5A5 An 1 2 3 4 5 6

26. 26 MIMD or SIMD – with unlimited processors TA1A1 A2A2 A3A3 A4A4 A5A5 An 1 2 3 4 5 6

27. 27 Algorithm can effect speedup. SISD T A (B C D + E)A B C D +A E 1 2 3 4 5 6

28. 28 Algorithm can effect speedup. MIMD T A (B C D + E)A B C D +A E 1 2 3 4 5 6

29. 29 SISD Method A TA 0 + A 1 *X + A 2 *X*X + A 3 *X*X*X + A 4 *X*X*X*X 1 2 3 4 5 6 7 8 9 10 11

30. 30 SISD Method B TA 0 + A 1 *X + A 2 *X*X + A 3 *X*X*X + A 4 *X*X*X*X 1 2 3 4 5 6 7 8 9 10 11

31. 31 SISD Method C TA 0 + X ( A 1 +X ( A2 + X ( A3 + X ( A 4 + …)))) 1 2 3 4 5 6 7 8 9

32. 32 MIMD unlimited processors TA 0 + X ( A 1 +X ( A2 + X ( A3 + X ( A 4 + …)))) 1 2 3 4 5 6 7 8 9

33. 33 MIMD unlimited processors TA 0 + A 1 *X + A 2 *X*X + A 3 *X*X*X + A 4 *X*X*X*X 1 2 3 4 5 6 7 8 9

34. 34 SIMD unlimited processors TA 0 + A 1 *X + A 2 *X*X + A 3 *X*X*X + A 4 *X*X*X*X 1 2 3 4 5 6 7 8 9

35. 35 Where, And, for i > 2 Using an MIMD machine with unlimited processors, the time to compute is given by For example when N = 9, For N = 3000 T(3000)=23

36. 36 Compute using a SISD computer with a add-multiply arithmetic unit. T(4) = 4

37. 37 Pipeline examples

38. 38

39. 39

40. 40

41. 41

42. 42

43. 43 Using a four segment pipeline with the restriction that the pipeline must empty before a new type (add, multiply, etc.) of operation can begin. T 4 (4) = 16 segment times.

44. 44 Using a four segment pipeline which does not require that the pipeline empty before a new type of operation can begin. T 4 (4)=15 segment times.