Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)
-
Upload
morgan-clemens -
Category
Documents
-
view
236 -
download
2
Transcript of Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)
![Page 1: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/1.jpg)
Computer Organization
Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)
![Page 2: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/2.jpg)
Exactly What IS a Computer?
• Processor
• Memory
• I/O
![Page 3: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/3.jpg)
Structure that Works
Complex systems have hierarchical structure.
• We observe this in the physical world.
• Artificial systems need it in order to “work”.
![Page 4: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/4.jpg)
Tempus and Hora
1000 parts in a watch
![Page 5: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/5.jpg)
Tempus and Hora
Hora
Tempus
1 assemply; 1000 partsProb(no interrupt) = (1 – p)1000
Cost/interrupt = t * (1/p)
p = probability of interruptiont = time to add one part
111 assemblies; 10 parts eachProb(no interrupt) = (1 – p)10
Cost/interrupt = t * 5
![Page 6: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/6.jpg)
Tempus and Hora
Hora
Tempus
1 assemply; 1000 partsProb(no interrupt) = (.99)1000 = 44 * 10-6 Cost/interrupt = t * 500
p = .01t = time to add one part
111 assemblies; 10 parts eachProb(no interrupt) = (.99)10 = .9 Cost/interrupt = t * 5
It will take Tempus 4,000 times as long to build one watch as it takes Hora.
![Page 7: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/7.jpg)
The Main Components
Data Bus
Memory(RAM) Central
ProcessingUnit (CPU) Secondary
Storage
Input/OutputI/O
![Page 8: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/8.jpg)
Main Memory
22 6F B2 1E 24 E6 07 5C 12 76 84 70 33 68 FD 3C
56 09 40 77 89 4A B5 42 61 04 AA 5E AB 43 71 1C
70 DF 32 2D
40 1F 69 C0 8A 7C 0F E9 90 9D 39 2E
4D 1F 60 9A 09 7D 10 4C 93 6F 81 B5 6A 9F 0A 1C
0
4
8
C
Word addressing
96 1A 89 AC
71 52 0C F3 8B 81 B2 D1 65 04 A5 18F8B
![Page 9: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/9.jpg)
Main Memory
22 6F B2 1E 24 E6 07 5C 12 76 84 70 33 68 FD 3C
56 09 40 77 89 4A B5 42 61 04 AA 5E AB 43 71 1C
70 DF 32 2D
40 1F 69 C0 8A 7C 0F E9 90 9D 39 2E
4D 1F 60 9A 09 7D 10 4C 93 6F 81 B5 6A 9F 0A 1C
0
10
20
30
Byte addressing
96 1A 89 AC
71 52 0C F3 8B 81 B2 D1 65 04 A5 183E2C
![Page 10: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/10.jpg)
Address Spaces• Let’s say we have a 16GB memory.
• That’s 24 (16) * 230 (giga) = 234 bytes.
• 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.
![Page 11: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/11.jpg)
Hierarchical Addresses
![Page 12: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/12.jpg)
The Main Components
Data Bus
Memory(RAM) Central
ProcessingUnit (CPU) Secondary
Storage
Input/OutputI/O
![Page 13: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/13.jpg)
Processor Chips
![Page 14: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/14.jpg)
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.
![Page 15: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/15.jpg)
Moore’s Law
http://computer.howstuffworks.com/moores-law.htmhttp://www.intel.com/pressroom/kits/events/moores_law_40th/index.htm
![Page 16: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/16.jpg)
Transistors in Intel Processors
![Page 17: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/17.jpg)
How It Has Happened
![Page 18: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/18.jpg)
The Old Way
ENIAC 1945
![Page 19: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/19.jpg)
The Stored Program Concept
22 6F B2 1E 24 E6 07 5C 12 76 84 70 33 68 FD 3C
56 09 40 77 89 4A B5 42 61 04 AA 5E AB 43 71 1C
70 DF 32 2D
40 1F 69 C0 8A 7C 0F E9 90 9D 39 2E
4D 1F 60 9A 09 7D 10 4C 93 6F 81 B5 6A 9F 0A 1C
0
10
20
30
Operation code: 40Memory address: 1F69C0
![Page 20: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/20.jpg)
When Do Things Happen?
1. Fetch next instruction2. Increment program counter3. Decode instruction4. ? Fetch additional data5. Execute
![Page 21: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/21.jpg)
When Do Things Happen?
1. Fetch next instruction2. Increment program counter3. Decode instruction4. ? Fetch additional data5. Execute
![Page 22: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/22.jpg)
When Do Things Happen?
1. Fetch next instruction2. Increment program counter3. Decode instruction4. ? Fetch additional data5. Execute
![Page 23: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/23.jpg)
When Do Things Happen?
1. Fetch next instruction2. Increment program counter3. Decode instruction4. ? Fetch additional data5. Execute
![Page 24: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/24.jpg)
The Computer’s Clock
from time import clock
def clock_it(n): for i in range(n): rand = clock() print(rand)
Let’s watch the clock on this machine:
![Page 25: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/25.jpg)
Clock Speed
![Page 26: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/26.jpg)
Clock Speeds
Intel® Core™ i3 - 370M processor (2.40GHz )
Apple Mac Book Pro
Intel® Core™ i7 970 Processor (6x 3.20GHz/12MB L3 Cache)
2011 Pallidin F
2.53 GHz
4Q 2012: Intel® Core™ i7 3970X Processor (6x 3.250GHz/15MB L3 Cache)
![Page 27: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/27.jpg)
What’s Going on Here?
Parallelism
![Page 28: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/28.jpg)
Pipelining
• Fill two cups of Diet Coke
• Build a housing development
• Can you think of more?
![Page 29: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/29.jpg)
Pipelining
• Fill two cups of Diet Coke
• Build a housing development
• Laundry
![Page 30: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/30.jpg)
Pipelining
• Bottlenecks
We can solve this problem by adding a new kind of parallelism.
![Page 31: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/31.jpg)
Adding Them Up
7621
80
72
28
67
94
19
9
![Page 32: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/32.jpg)
Single Instruction Stream Multiple Data Stream (SIMD)
• Add numbers
• Process insurance claims
• Rowing
![Page 33: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/33.jpg)
SIMD to Funnel
• UT admissions
![Page 34: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/34.jpg)
SIMD in Football
• A quilt of blocks
![Page 35: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/35.jpg)
Increasing Parallelism in SIMD
Problem: Bottlenecks
![Page 36: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/36.jpg)
Eliminating Bottlenecks
• Solution: Add more processors.
• Benefit: Faster throughput at peak times.
• Cost:
![Page 37: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/37.jpg)
The Essential SIMD Property
![Page 38: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/38.jpg)
The Main Components
Data Bus
Memory(RAM) Central
ProcessingUnit (CPU) Secondary
Storage
Input/OutputI/O
![Page 39: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/39.jpg)
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
![Page 40: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/40.jpg)
How Much Data Storage for Facebook?People share more than 30 billion pieces of content on Facebook each month.
![Page 41: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/41.jpg)
Data Centers Slurp Up Power
http://gizmodo.com/5880804/facebooks-oregon-data-center-uses-as-much-power-as-the-entire-county
![Page 42: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/42.jpg)
Memory Hierarchy
![Page 43: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/43.jpg)
The Beer Model
1) Glass
![Page 44: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/44.jpg)
The Beer Model
1) Glass2) Cooler
![Page 45: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/45.jpg)
The Beer Model
1) Glass2) Cooler3) Refrigerator
![Page 46: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/46.jpg)
The Beer Model
1) Glass2) Cooler3) Refrigerator4) Grocery Store
![Page 47: Computer Organization Section 4.3, Chapter 5 Sections 6.1 – 6.2 (Optional)](https://reader036.fdocuments.net/reader036/viewer/2022062300/56649c6e5503460f94921572/html5/thumbnails/47.jpg)
Memory Hierarchy