cs 470 570 lecture 4 n.
Download
Skip this Video
Download Presentation
CS 470/570 Lecture 4

Loading in 2 Seconds...

play fullscreen
1 / 8

CS 470/570 Lecture 4 - PowerPoint PPT Presentation


  • 91 Views
  • Uploaded on

CS 470/570 Lecture 4. Performance measures Interconnection networks Cache coherence Parallel Software Parallel Program design Example Problems. Performance Measures. Speedup T serial /T parallel Efficiency Speedup/number of processors Amdahl’s law Scalable. Interconnection Networks.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'CS 470/570 Lecture 4' - uriel-oneil


Download Now 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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
cs 470 570 lecture 4
CS 470/570 Lecture 4
  • Performance measures
  • Interconnection networks
  • Cache coherence
  • Parallel Software
  • Parallel Program design
  • Example Problems
performance measures
Performance Measures
  • Speedup
    • Tserial/Tparallel
  • Efficiency
    • Speedup/number of processors
  • Amdahl’s law
  • Scalable
interconnection networks
Interconnection Networks
  • Bus
  • Crossbar
  • Fully connected
  • Hypercube
  • Omega
  • Latency
  • Bandwidth
cache coherence
Cache Coherence
  • Snooping cache coherence
  • Directory based cache coherence
parallel software
Parallel Software
  • Nondeterminism
    • Race conditions
    • Critical section
    • Mutual exclusion
  • Thread Safe
parallel program design
Parallel Program Design
  • Partitioning
  • Communication
  • Aggregation
example problems
Example Problems
  • 1. Draw a 4X4 crossbar switch.
  • 2. Draw a 4X4 Omega network
  • 3. Suppose there are 16 processors connected in a 4 dimensional hypercube.
    • a. How many direct connections to other processors does each processor have?
    • b. What is the minimum number of links that will have to be traversed to send data from processor 3 to processor 12?
example problems1
Example Problems
  • 4. Suppose you have a machine with 4 cores that uses snooping cache coherence. Core 0 reads from address 10,000, core 3 reads from address 10,000. Core 3 writes to address 10,000. How does Core 0 know its copy of the contents of address 10,000 is out of date.
  • 5. On a 4X4 Omega network can the following source destination requests be satisfied at the same time. (0,0), (3,1), (1,2), (2,3)
  • 6. How many switches are in an 8X8 crossbar?
  • 7. How many switches are on an 8X8 Omega network?