并行计算概述 Multi-core Programming Basic Concepts.ppt

* This should always be the last slide of all presentations. * Multi-core Programming: Basic Concepts Throughput Complete the most tasks in a fixed amount of time Example: Decorating cakes Multiple bakers doing entire decoration Assembly line of frosters and decorators Threading for Throughput or Turnaround? * Multi-core Programming: Basic Concepts Turnaround Complete single task in the smallest amount of time Example: Parents to arrive in one hour Hugues cleans living room Otto cleans bathroom Thomas cleans kitchen Threading for Throughput or Turnaround? * Multi-core Programming: Basic Concepts Throughput Complete the most tasks in a fixed amount of time Example: Produce pins “One man draws out the wire, another straights it, a third cuts it, a fourth points it, a fifth grinds it at the top for receiving the head;…” (A. Smith 1776) Threading for Throughput or Turnaround? * Multi-core Programming: Basic Concepts Threading for Functionality Assign threads to separate functions done by application Easiest method since overlap is unlikely Example: Coaching a football team Head coach, position coaches, special teams coach Threading for Functionality or Performance? * Multi-core Programming: Basic Concepts Deadlock Threads wait for some event or condition that will never happen Example: Traffic jam at intersection Cars unable to turn or back up What is Livelock? Threads change state in response to each other Example: Robin Hood and Little John on log bridge Deadlock * * Multi-core Programming: Basic Concepts Speaker’s Notes [Purpose of this Slide] Outline the objectives of this module [Details] No code segments will be used to illustrate any of the concepts. The instructor can give verbal illustration of code, but everything in this presentation is done with “agents” to perform work concurrently. * Multi-core Programming: Basic Concepts Speaker’s Notes [Purpose of this Slide] Put forth the Agenda topics of the module. [Background] The order and list o