Dataflow: Passing the Token - Computation Structures Group - MIT

More documents

Recommendations

Info

Well Behaved Schemas one-in-one-out & self cleaning Conditional T F f g T F • • • P • • • • • • Before After Bounded Loop Loop Needed for resource management f T F T F ISCA, Madison, WI, June 6, 2005 Arvind - 8 P • • • p F
Outline • Dataflow graphs √ – A clean model of parallel computation • Static Dataflow Machines ← – Not general-purpose enough • Dynamic Dataflow Machines – As easy to build as a simple pipelined processor • The software view – The memory model: I-structures • Monsoon and its performance • Musings ISCA, Madison, WI, June 6, 2005 Arvind - 9
Page 1 and 2: Dataflow: Passing the Token Arvind
Page 3 and 4: Dataflow Machines Static - mostly f
Page 5 and 6: This talk is mostly about MIT work
Page 7: Dataflow Operators • A small set
Page 11 and 12: Static Dataflow Machine Jack Dennis
Page 13 and 14: Outline • Dataflow graphs √ - A
Page 15 and 16: A Frame in Dynamic Dataflow 1 2 3 4
Page 17 and 18: Temporary Registers & Threads Rober
Page 19 and 20: Instructions directly control the p
Page 23 and 24: Id World implicit parallelism Id Da
Page 25 and 26: Data Structures in Dataflow • Dat
Page 29 and 30: Id Applications on Monsoon @ MIT
Page 31 and 32: Single Processor Monsoon Performanc
Page 33 and 34: Base Performance? Id on Monsoon vs.
Page 37 and 38: What would we have done differently
Page 39 and 40: Locality and Parallelism: Dual prob
Page 41 and 42: Thank You! and thanks to R.S.Nikhil

Dataflow: Passing the Token - Computation Structures Group - MIT

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?