1 / 13

What have we seen in class recently?

What have we seen in class recently?. Daniel Shapiro. Exec time = (Task Crunch Amount)/(speed of PE) Makespan (longest critical path) Adjacent communication delay( i ,j ) = (Data amount)/(transfer rate between PEs) in-forest: each node has at most one immediate successor

shea-puckett
Download Presentation

What have we seen in class recently?

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. What have we seen in class recently? Daniel Shapiro

  2. Exec time = (Task Crunch Amount)/(speed of PE) • Makespan (longest critical path) • Adjacent communication delay(i,j) = (Data amount)/(transfer rate between PEs) • in-forest: each node has at most one immediate successor • out-forest: each node has at most one immediate predecessor

  3. Time • Completion Time = Execution Time + Total Communication Delay • Total Communication Delay = Number of communication messages * delay per message • Execution time  maximum finishing time of any task

  4. Scheduling inforest/outforest task graphs • The level of each node in the task graph is calculated as given above and used as each node’s priority • Whenever a processor becomes available, assign it the unexecuted ready task with the highest priority

  5. Example

  6. Scheduling interval ordered tasks • The number of successors of each node is used as each node’s priority • Whenever a processor becomes available, assign it the unexecuted ready task with the highest priority

  7. Example

  8. Communication Delay versus Parallelism

  9. a a c c b b d d e e f f g g (b) (a) a a c b c b d e d e f f g g (d) (c) Clustering

  10. Duplications

  11. Real Stuff • http://www.site.uottawa.ca/eng/school/publications/techrep/2010/

  12. Where is my T.A.? http://www.eng.tau.ac.il/~ieee/Convention/index.html Instruction Set Extensions for Computation on Complex Floating Point Numbers Parallel instruction set extension identification

  13. Questions? • Danke

More Related