Dataflow Computation for the J-Machine

dc.creator	Spertus, Ellen
dc.date	2004-10-20T20:22:55Z
dc.date	2004-10-20T20:22:55Z
dc.date	1990-05-01
dc.date.accessioned	2013-10-09T02:48:03Z
dc.date.available	2013-10-09T02:48:03Z
dc.date.issued	2013-10-09
dc.identifier	AITR-1233
dc.identifier	http://hdl.handle.net/1721.1/7030
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	The 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.
dc.format	10874897 bytes
dc.format	4190780 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AITR-1233
dc.title	Dataflow Computation for the J-Machine

Files in this item

Files	Size	Format	View
There are no files associated with this item.