Achieving parallel processor speedup (n times speedup with n processing elements) has been difficult for a broad class of applications. The problem is not technology but programming models. One answer to this speedup problem is to create an idealized data flow machine that exactly corresponds to the application and stream data through the resulting machine. In the dataflow paradigm an application is considered as a dataflow graph of the executable actions.. The extraordinary density achieved by FPGAs allows emulations of the application dataflow machine, providing more than an order of magnitude speedup even as executed as an emulation of the data flow machine.