Parallel Computer Architecture Part I

1. Parallel Computer ArchitecturePart I (Part 2 on March 18)

2. Latency • Defn: Latency is the time it takes one message to travel from source to destination. Includes various overheads. • E.g. Taking the T (or the SMRT for the Singaporeans) • Time to walk out the door to the station • Time to wait for train • Time on the train • Time to walk to destination

3. Latency • Defn: Latency is the time it takes one message to travel from source to destination. Includes various overheads. • E.g. Taking the T (or the SMRT for the Singaporeans) • Time to walk out the door to the station • Time to wait for train • Time on the train • Time to walk to destination overhead

4. Latency • Defn: Latency is the time it takes one message to travel from source to destination. Includes various overheads. • E.g. Taking the T (or the SMRT for the Singaporeans) • Time to walk out the door to the station • Time to wait for train • Time on the train • Time to walk to destination overhead Productive communication

5. Latency • Defn: Latency is the time it takes one message to travel from source to destination. Includes various overheads. • E.g. Taking the T (or the SMRT for the Singaporeans) • Time to walk out the door to the station • Time to wait for train • Time on the train • Time to walk to destination Productive communication Bandwidth • Maximum Rate at which the network can propogate information • E.g. (speed of train) * (number of passengers)

6. Important • Bandwidth is easy to measure and easy to hype. It is an idealized peak communications rate most likely to be achieved for long messages under condiitons of no traffic contention. • (Long train ride, no delays.) • Ethernet = 100 Mbps • Latency varies with applications, conditions, etc. • (Train delays, rush hour, the weather, …) • Latency = How long it takes you to get to work. Bandwidth = How many miles you can ideally move people / unit time. • Latency & Bandwidth are related but not the same. Latency includes more realities!

7. Latency: the details • Latency = Sender Overhead + Time of Flight + Transmission Time + Receiver Overhead • Sender Overhead: Time for processor to inject message into network. Time processor tied up from doing useful work because it is sending. • Time of Flight: Time for the start of the message to arrive at the receiver. • Transmission Time: Time for remainder of message to arrive at receiver = (# bits)/bandwidth • Receiver Overhead: Time for receiver to pull message (usually larger than sender overhead)

8. Latency vs Bandwidth on the internet • Experiment: Sending packets roundtrip from MIT to Singapore • Specifications • Time: 5am EST this morning (Feb 20) = 6pm Singapore • Source: pythagoras.mit.edu (ip address = 18.87.0.29) • Dest:sunsvr.comp.nus.edu.sg (ip address = 137.132.88.6) • Method: ping -s 137.132.88.6 num_bytes 5 (5 = num_trials) • Data:bytes: 8 100 500 1000 2000 3000 4000 5000 6000 7000 • msec:276 263 264 270 404 645 690 777 868 923

9. Congestion? Latency

10. Congestion (Traffic!) Latency and Bandwidth are not the whole story, congestion can also slow down communication!

11. Node Architecture • CPU, e.g. Athlon MP1800 • Registers: O(400B) Speed: O(1nsec) • Cache (on chip) • L1: 64 KB Instruction + 64 KB Data • L2: 256 KB Data O(10 nsec) Memory Bus  • Memory: e.g. 1 GB PC2100 DDR EEC O(100nsec)(Double Data Rate/Extended Error Correction)  I/O Bus  • Disk: IBM 120GXP 40GBO(5msec) Warning: all O’s are just guesses made in the early morning

12. Node Architecture • CPU O(400B)O(1nsec) • Cache • L1: 128 KB • L2: 256 KBO(10 nsec) Memory Bus  • Memory: 1 GBO(100nsec) I/O Bus  • Disk: 40GBO(5msec) Warning: all O’s are just guesses made in the early morning

13. Bus as an interconect network • One transaction at a time between source and destination • The “P”’s and “M”’s could be cache and memory, disk and memory, etc.

14. Where does the network meet the processor? • I/O Bus • Most Clusters • Memory Bus • Many MPPs • Processor Registers • RAW architecture at MIT Distance to Proc

15. Asci White at Lawrence Livermore (Currently #1) • IBM SP System: SP = Scalable Powerparallel • 512 “High Nodes” ({thin,wide,high}=physical space) • 1 High Node = 16 Processor SMP Connected by 1 SP Switch • Weight = 106 tons = roughly 100 Honda Civics! • Processor = RS/6000 Power 3 • RS=Risc System= “Reduced Instruction Set Chip/Comp” • SP Switch connects to 16 nodes and up to 16 other switches

16. IBM Sp Switch (Up to 16 P’s)

17. IBM Sp Switch (Up to 16 P’s) Other Nodes 16 P’s

18. IBM Sp Switch (Up to 16 P’s) 8 switch chips per switch

19. Cross Bar I’m guessing that every switch chip is a crossbar – someone check please -- maybe not???

20. Multiple Data Flows on an SP Switch Four “on-chip” stay on chip, off-chip pairs take three hops but not typically much slower

21. Connecting two 16-way SMPs=32 processors SMP SMP

22. Connecting three 16-way SMPs=48 processors SMP SMP Note: every pair share 8 wires SMP

23. Connecting five 16-way SMPs=80 processors SMP Every pair of SP chips not already on the same board are connected. There are 16 off board SP chips. Total of 40 wires. SMP SMP SMP (This is a guess but the only logical one, I think) SMP Always 4 parallel paths between any two processors!

24. Connecting eight 16-way SMPs=128 processors Intermediate switch boards needed for 81-128 nodes Each chip connected to one ISB! ISB’s

25. Guess at doubling What must be done?

26. Parallel Computer ArchitecturePart II

27. Caches: A means of solving the memory to processor latency problem • Memory just can’t get out the doorfast enough for the processor to handle • Not all the data is needed all the time • The data that is needed can often be predicted! • Solution: faster (= more expensive) but smaller memory in between

28. Caches : Write-through vs write-back • In a write-through cache, when data is written to cache, it also is written to memory • In a write-back cache, when data is written to cache it is declared “dirty” in cache but it is not written to memory. If the cache runs out of space for the data, it then returns to memory

29. fooA fooB fooA fooB Cache Coherence Coherence Error Due to False Sharing Proc A Proc B Both A and B get same line A only needs fooA, B only needs fooB Memory

30. HELLOfooB fooAWORLD Cache Coherence Coherence Error Due to False Sharing Proc A Proc B • Both A and B get same line • A only needs fooA, • B only needs fooB • A writes HELLO • B writes WORLD Memory

31. HELLOfooB fooAWORLD Cache Coherence Coherence Error Due to False Sharing Proc A Proc B • Both A and B get same line • A only needs fooA, • B only needs fooB • A writes HELLO • B writes WORLD • B writes cache to memory fooA|World

32. HELLOfooB fooAWORLD Cache Coherence Coherence Error Due to False Sharing Proc A Proc B • Both A and B get same line • A only needs fooA, • B only needs fooB • A writes HELLO • B writes WORLD • B writes cache to memory • A writes cache to memory HELLO|fooB

33. Evolution of Shared Memory P P P P C C C C Main Memory Processors use of cache has freed up many of the burdens of main memory other caches can be attached

34. Multiprocessor Cache Coherence defined • A memory system is coherent if • Uniprocessor Coherence: If P writes to location X, then reads from location X, the written value is read. • Multiprocessor Coherence: If P1 writes to location X, then P2reads from location X, the written value is read if sufficient time has passed. (Instantly is impossible!) • Serialization: If P1 writes “1” to X and P2writes “2” to X, then one occurs before the other, say 1 then 2. All processors see the write in the same order. No processor can read 2 and then later read it as 1.

35. Enforcing Coherence • Directory based schemes: One central directory keeps sharing status • Snooping: Caches keep status, caches “snoop” on the shared memory bus to determine status • Advantange: Uses pre-existing hardware: the bus to memory

36. Write invalidate vs Write Update Protocols • Two approaches to insure coherence • Write Invalidate: When P1 writes to X, all other cached versions of X are invalidated, forcing every other processor to read X from main memory • (Invalidate has become the method of choice) • Write Update: When P1 writes to X, all other cached versions of X are updated with the new value Examples 

37. Write invalidate Example • Write Invalidate: • 1.P1 reads X (from main memory to its cache) • 2.P2 reads X (from main memory (where else?) to cache) • 3.P1 writes X (to its cache and through to main memory) Invalidates all other cached copies of X • 4.P2 reads X (from main memory) since its cache is invalid • Bus Activity: 1,2,and 4 are cache misses for X, • 3 is an invalidate for X

38. Write Update Example • Write Invalidate: • 1.P1 reads X (from main memory to its cache) • 2.P2 reads X (from main memory (where else?) to cache) • 3.P1 writes X (to its cache and through to main memory) Updates all other cached copies of X • 4.P2 reads X (from cache) • Bus Activity: 1,2, are cache misses for X, • 3 is a write broadcast for X to the caches

39. Performance • The goal is to move as little memory as possible on the busses, indeed since another processor might not ever need the memory, it could be foolish to broadcast it all the time. •  Write invalidate is more popular since it gives better performance

40. Write invalidate with write-back cache • Every cache item has three extra bits • Valid bit (write invalidation model requires this) • Dirty bit (write-back cache requires this) • Shared bit (this is new!) • When writing to a shared block, the cache generates an invalidate on the bus and marks its block as private • If another processor requests this block it becomes shared (the owner would “see” the cache-miss on the snooping bus)

41. Distributed Shared Memory P P P P C C C C Can still support shared memory model, e.g., OpenMP on our beowulf M M M M • Simplest approach: only private data in the cache, once data is asked for by another processor it is removed from the cache • Common Approach: Directory-Based Cache-Coherence • States Included: • Shared: One or more processors have the block cached (and current) • Uncached: No processor has a copy • Exclusive: Exactly one processor has a copy of the data • Also need which processors have shared data to invalidate

42. Future of Caches • According to the “RAW Design Document” there have been three states of procesor design: • Famine 70s No room on chip concentrate on I/o • Moderation 80s Some room on chip – build caches • Abundance Now Send data straight through Viewpoint – caches are a barrier to the memory. Work great on traditional problems, but current problems seek much non-repeated data from the outside world

43. Basics of Raw: chip = 4x4 Tiles