Computer Organization

1. Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)

2. Exactly What IS a Computer? • Processor • Memory • I/O

3. Structure that Works • Complex systems have hierarchical structure. • We observe this in the physical world. • Artificial systems need it in order to “work”.

4. Tempus and Hora 1000 parts in a watch

5. Tempus and Hora Tempus Hora p = probability of interruption t = time to add one part 111 assemblies; 10 parts each Prob(no interrupt) = (1 – p)10 Cost/interrupt = t * 5 1 assemply; 1000 parts Prob(no interrupt) = (1 – p)1000 Cost/interrupt = t * (1/p)

6. Tempus and Hora Tempus Hora p = .01 t = time to add one part 111 assemblies; 10 parts each Prob(no interrupt) = (.99)10 = .9 Cost/interrupt = t * 5 1 assemply; 1000 parts Prob(no interrupt) = (.99)1000= 44 * 10-6 Cost/interrupt = t * 500 It will take Tempus 4,000 times as long to build one watch as it takes Hora.

7. Data Bus Memory (RAM) The Main Components Input/Output I/O Central Processing Unit (CPU) Secondary Storage

8. Main Memory 0 24 E6 07 5C 33 68 FD 3C 22 6F B2 1E 12 76 84 70 89 4A B5 42 AB 43 71 1C 56 09 40 77 61 04 AA 5E 4 40 1F 69 C0 90 9D 39 2E 8 70 DF 32 2D 8A 7C 0F E9 09 7D 10 4C 6A 9F 0A 1C 4D 1F 60 9A 93 6F 81 B5 C  Word addressing 71 52 0C F3 65 04 A5 18 96 1A 89 AC 8B 81 B2 D1 F8B

9. Main Memory 0 24 E6 07 5C 33 68 FD 3C 22 6F B2 1E 12 76 84 70 89 4A B5 42 AB 43 71 1C 56 09 40 77 61 04 AA 5E 10 40 1F 69 C0 90 9D 39 2E 20 70 DF 32 2D 8A 7C 0F E9 09 7D 10 4C 6A 9F 0A 1C 4D 1F 60 9A 93 6F 81 B5 30  Byte addressing 71 52 0C F3 65 04 A5 18 96 1A 89 AC 8B 81 B2 D1 3E2C

10. Address Spaces • Let’s say we have a 16GB memory. • That’s 24 (16) * 230 (giga) = 234bytes. • To specify that many addresses, we need 34 bits. Oops, more than a whole word. • Possible solutions: • Use 64 bit words. • Use hierarchical address definitions.

11. Hierarchical Addresses

12. Data Bus Memory (RAM) The Main Components Input/Output I/O Central Processing Unit (CPU) Secondary Storage

13. Processor Chips

14. Transistors The Intel® Core 2 Duo processor has 291 million transistors, more than 10,000 times as many transistors as the Intel 8088 CPU in the first IBM PC which had only 29,000 transistors.

15. Moore’s Law http://computer.howstuffworks.com/moores-law.htm http://www.intel.com/pressroom/kits/events/moores_law_40th/index.htm

16. Transistors in Intel Processors

17. How It Has Happened

18. The Old Way ENIAC 1945

19. The Stored Program Concept 0 24 E6 07 5C 33 68 FD 3C 22 6F B2 1E 12 76 84 70 89 4A B5 42 AB 43 71 1C 56 09 40 77 61 04 AA 5E 10 40 1F 69 C0 90 9D 39 2E 20 70 DF 32 2D 8A 7C 0F E9 09 7D 10 4C 6A 9F 0A 1C 4D 1F 60 9A 93 6F 81 B5 30 Operation code: 40 Memory address: 1F69C0

20. When Do Things Happen? Fetch next instruction Increment program counter Decode instruction ? Fetch additional data Execute

21. When Do Things Happen? Fetch next instruction Increment program counter Decode instruction ? Fetch additional data Execute

22. When Do Things Happen? Fetch next instruction Increment program counter Decode instruction ? Fetch additional data Execute

23. When Do Things Happen? Fetch next instruction Increment program counter Decode instruction ? Fetch additional data Execute

24. The Computer’s Clock Let’s watch the clock on this machine: from time import clock def clock_it(n): for i in range(n): rand = clock() print(rand)

25. Clock Speed

26. Clock Speeds Apple Mac Book Pro Intel® Core™ i3 - 370M processor (2.40GHz ) 2011 Pallidin F 2.53 GHz 4Q 2012: Intel® Core™ i7 3970X Processor (6x 3.250GHz/15MB L3 Cache) Intel® Core™ i7 970 Processor (6x 3.20GHz/12MB L3 Cache)

27. What’s Going on Here? Parallelism

28. Pipelining • Fill two cups of Diet Coke • Build a housing development • Can you think of more?

29. Pipelining • Fill two cups of Diet Coke • Build a housing development • Laundry

30. Pipelining • Bottlenecks We can solve this problem by adding a new kind of parallelism.

31. Adding Them Up 9 76 21 94 19 80 67 72 28

32. Single Instruction Stream Multiple Data Stream (SIMD) • Add numbers • Process insurance claims • Rowing

33. SIMD to Funnel • UT admissions

34. SIMD in Football • A quilt of blocks

35. Increasing Parallelism in SIMD Problem: Bottlenecks

36. Eliminating Bottlenecks • Solution: Add more processors. • Benefit: Faster throughput at peak times. • Cost:

37. The Essential SIMD Property

38. Data Bus Memory (RAM) The Main Components Input/Output I/O Central Processing Unit (CPU) Secondary Storage

39. How Much Data Storage for Facebook? People share more than 2.5 billion pieces of content on Facebook each day (August, 2012). At least 60,000 in 6/2010

40. How Much Data Storage for Facebook? People share more than 30 billion pieces of content on Facebook each month.

41. Data Centers Slurp Up Power http://gizmodo.com/5880804/facebooks-oregon-data-center-uses-as-much-power-as-the-entire-county

42. Memory Hierarchy

43. The Beer Model Glass

44. The Beer Model Glass Cooler

45. The Beer Model Glass Cooler Refrigerator

46. The Beer Model Glass Cooler Refrigerator Grocery Store

47. Memory Hierarchy