GraphStep: Compute Model and Programming Tutorial

Add to your list(s) Download to your calendar using vCal

• Nachiket Kapre (Imperial College)
• Friday 15 July 2011, 13:00-15:00
• Level 9 Mahanakorn Lab., EE Dept..

If you have a question about this talk, please contact .

Sparse graph problems are pervasive in circuit CAD and many other application domains. They are rich source of irregular, unstructured parallelism which can be mapped really well to an FPGA fabric. In this talk, I will outline the key ideas of the GraphStep compute model and discuss a few programming examples.

The talk is primarily intended as a simple programming tutorial.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Level 9 Mahanakorn Lab., EE Dept.

Note that ex-directory lists are not shown.