Show simple item record

dc.contributor.authorSpertus, Ellenen_US
dc.date.accessioned2004-10-20T20:22:55Z
dc.date.available2004-10-20T20:22:55Z
dc.date.issued1990-05-01en_US
dc.identifier.otherAITR-1233en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/7030
dc.description.abstractThe dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction- level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a "hybrid'' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism --- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement.en_US
dc.format.extent10874897 bytes
dc.format.extent4190780 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAITR-1233en_US
dc.titleDataflow Computation for the J-Machineen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record