Dataflow: Passing the Token - Computation Structures Group - MIT

More documents

Recommendations

Info

Static Dataflow Machine: Instruction Templates 1 2 3 4 5 Opcode Destination 1 + 3L 4L * 3R 4R - 5L + 5R * out Destination 2 Operand 1 Operand 2 Presence bits Each arc in the graph has a operand slot in the program a b 1 + 2 *7 3 - 4 + ISCA, Madison, WI, June 6, 2005 Arvind - 10 x 5 * y
Static Dataflow Machine Jack Dennis, 1973 Receive Send Instruction Templates 1 Op dest1 dest2 p1 src1 p2 src2 2 . . . FU FU FU FU FU , • Many such processors can be connected together • Programs can be statically divided among the processor ISCA, Madison, WI, June 6, 2005 Arvind - 11
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: Outline • Dataflow graphs √ - A
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

Create successful ePaper yourself

Delete template?

Save as template?