Dataflow Computation for the J-Machine
Item
-
Title
-
en_US
Dataflow Computation for the J-Machine
-
Creator
-
en_US
Spertus, Ellen
-
Date
-
2004-10-20T20:22:55Z
-
Date Available
-
2004-10-20T20:22:55Z
-
Date Issued
-
en_US
1990-05-01
-
Identifier
-
en_US
AITR-1233
-
Abstract
-
en_US
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.
-
Extent
-
10874897 bytes
-
4190780 bytes
-
Format
-
application/postscript
-
application/pdf
-
Language
-
en_US
-
Relation
-
en_US
AITR-1233