| V. G. Grafe, G. S. Davidson, J. E. Hoch, and V. P. Holmes, "The epsilon dataflow processor," in International Symposium on Computer Architecture, 1989. |
....The problem then became how to build a fully decentralized dataflow machine. WaveScalar is the creative extension of this line of reasoning. Dataflow has a long history. The first designs appeared in the early 70 s [6, 19, 20] and there was a significant revival in the 80 s and early 90 s [21, 22, 23, 24, 25, 26, 27]. Dataflow machines execute programs according to the dataflow firing rule (DFR) which stipulates that an instruction may execute at any time, as long as its operands are available. When dataflow instructions complete, they trigger the execution of dependent instructions. Values in a dataflow ....
....projects and stands in contrast to them. 5.1 Dataflow Dataflow computing is perhaps the best studied alternative to the Von Neumann model of computation. The first dataflow architectures [6, 20] appeared in the mid to late 70 s, and in the late 80 s and early 90 s there was a notable revival [21, 22, 23, 24, 25, 26]. The dataflow work of the late 80 s and early 90 s made it clear that high performance dataflow machines were difficult to build. Culler et al. 58] articulated this difficulty as a cost benefit problem and argued that dataflow suffers from two fundamental problems, both of which have to with ....
V. G. Grafe, G. S. Davidson, J. E. Hoch, and V. P. Holmes, "The epsilon dataflow processor," in Proceedings of the 16th annual international symposium on Computer architecture, pp. 36--45, ACM Press, 1989.
.... in our thinking have been the seminal Denelcor HEP [30] and Iannucci s Dataflow von Neumann Hybrid architecture [20] which incorporated some dataflow ideas into von Neumann processors for MPA s (similar ideas were also expressed by Buehrer and Ekanadham [9] ETL s EM 4 [28] Sandia s Epsilon [15], Dennis and Gao s Argument Fetching Dataflow machine [14] and Dennis multithreaded architecture [13] are also dataflow machines supporting threads. Finally, the Network Interface Chip by Henry and Joerg [18] has had a direct influence on our implementation of T. Software considerations, ....
V. Grafe, G. Davidson, J. Hoch, and V. Holmes. The Epsilon Dataflow Processor. In Proc. 16th. Ann. Intl. Symp. on Computer Architecture, Jerusalem, Israel, pages 36--45, May 1989.
....size used in production runs, and was not chosen to make the Monsoon performance seem relatively better than the CM 5. result of network access contention, rather than being fundamentally associated with dataflow architectures. The fork overhead is eliminated in the Epsilon dataflow architecture [8] with a copy instruction which can send values to multiple instructions however, the copy instruction reduces instruction count, but does not reduce cycle count. Some overhead is the result of the k bounded loop scheme, which has proven to be difficult to use for the programmer as well as ....
V. Grafe, G. Davidson, J. Hoch, and V. Holmes. The Epsilon Dataflow Processor. In Proceedings of the 16th. Annual International Symposium on Computer Architecture, Jerusalem, Israel, pages 36--45, May 29-31 1989.
....exploitation of control parallelism. However, the advantages of dataflow computers are not specific to efficient implementation of functional languages, and recent research has pointed towards a synthesis of dataflow and von Neumann ideas, both in languages [17] 42] 52] and in architectures [32] [25] [40] 58] In this thesis, we examine the benefits of executing the data parallel programming model on a hybrid dataflow von Neumann computer, the EM 4. Our results indicate that the EM 4 processor architecture executes computational portions of data parallel codes as well as a conventional ....
....highbandwidth, fine grained network, and a fast processor network interface ability provide more general purpose, effective and sufficient mechanisms for the implementation of the data parallel communications on MIMD computers. 1. 2 What is dataflow Dataflow computer architectures [4] 5] [25] [26] 30] 32] 40] 43] 58] began their existence as hardware to directly execute dataflow graphs. As such, much of the architectural work was concerned with how to handle token matching and instruction firing in dataflow graphs. Language work was primarily concerned with compilation of ....
[Article contains additional citation context not shown here]
V.G. Grafe, G.S. Davidson, J.E. Hoch, and V.P. Holmes. The Epsilon Dataflow Processor. In Proceedings of the 16th. Annual International Symposium on Computer Architecture, Jerusalem, Israel, pages 36--45, May 29-31 1989.
.... languages with synchronizing data structures, e.g. I structures[6] On the other hand, asynchronous transfer of control (context switching) is notoriously expensive on current machines, leading many researchers to examine asynchronous parallel execution models through the study of real machines[11, 13, 15, 22, 25, 27], paper architectures[1, 5, 14, 16, 19] and abstract machines[21] In all of these proposals, the scheduling of threads is viewed as a property of the machine, invisible to the compiler. While we share the view that asynchronous events are the rule, not the exception, in large scale ....
V. G. Grafe, G. S. Davidson, J. E. Hoch, and V. P. Holmes. The Epsilon Dataflow Processor. In Proc. of the 16th Annual Int. Symp. on Comp. Arch., 1989.
No context found.
V. G. Grafe, G. S. Davidson, J. E. Hoch, and V. P. Holmes, "The epsilon dataflow processor," in International Symposium on Computer Architecture, 1989.
No context found.
V. Grafe, G. Davidson, J. Hoch, and V. Holmes, "The Epsilon Dataflow Processor," 16th. Ann. Intl. Symp. Comput. Archit., 1989, pp. 36-45.
No context found.
V. Grafe, G. Davidson, J. Hoch, and V. Holmes. The Epsilon dataflow processor. In 16th Annual International Symposium on Computer Architecture, pages 36--45, June 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC