Dataflow: Passing the Token - Computation Structures Group - MIT

More documents

Recommendations

Info

Dynamic Dataflow Architectures • Allocate instruction templates, i.e., a frame, dynamically to support each loop iteration and procedure call – termination detection needed to deallocate frames • The code can be shared if we separate the code and the operand storage a token frame pointer instruction pointer ISCA, Madison, WI, June 6, 2005 Arvind - 14
A Frame in Dynamic Dataflow 1 2 3 4 5 1 2 3 4 5 + * - + * 1 2 3 4 5 3L, 4L 7 3R, 4R 5L 5R out Program Frame a b 1 + 2 *7 - 4 + Need to provide storage for only one operand/operator ISCA, Madison, WI, June 6, 2005 Arvind - 15 3 x 5 * y
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 and 8: Dataflow Operators • A small set
Page 9 and 10: Outline • Dataflow graphs √ - A
Page 11 and 12: Static Dataflow Machine Jack Dennis
Page 13: Outline • Dataflow graphs √ - A
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

Create successful ePaper yourself

Delete template?

Save as template?