J. B. Dennis, First Version Data Flow Procedure Language, Technical Memo MAC TM61, MIT Lincoln Laboratory for Computer Science, May 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....significant subsystems that are best conceptualized as dataflow systems, focusing on the flow of information between their components. There are numerous different dataflow models of computation, most of which fall into one of three categories [11] Kahn process networks [9] Dennis dataflow [3], and dataflow synchronous languages [1] This paper focuses on the second kind of dataflow, whose distinguishing characteristic is its notion of firing, i.e. atomic steps performed by the components of a model. Various kinds of dataflow models are used to describe a wide variety of software ....

J. B. Dennis. First version data flow procedure language. Technical Memo MAC TM 61, MIT Lab. Comp. Sci., May 1975.

....expressing independence among memory operations and support for distributed tag management. Also unlike all previous dataflow work that we are aware of, WaveScalar targets programs written in mainstream imperative languages (such as C) instead of those written in specialized dataflow languages [29, 30, 31, 32, 33, 34, 35]. There have been some prior attempts at this [36, 37] However, none adequately addressed the most difficult challenges including pointers, aliasing, and mutable data structures. The specific differences between the WaveScalar ISA and a normal RISC like instruction set are described below. ....

....aliasing. In our opinion, supporting traditional programming languages is required for instruction sets and new architectures to be successful. The WaveScalar ISA builds upon some of the original program representations used in [19, 27] which was derived from earlier compiler and theory work [33]. The intermediate compiler language, Pegasus [63] for NanoFabrics [64] adapts these ideas as well. The Pegasus researchers transform an entire application into a static dataflow graph and map it onto a large spatial fabric of molecular electronics that can operate like an FPGA. To date, the ....

J. B. Dennis, "First version data flow procedure language," Tech. Rep. MAC TM61, MIT Laboratory for Computer Science, May 1991.

....in sequentiality (v z, the program counter) By eliminating the notion of control flow for program sequendng, we can circumvent this problem directly. One alternative to sequential control flow is dataflow, where the execution of instructions is triggered solely by the availability of the operands [5]. In order to explain the operation of a dataflow processor, we proceed next with a discussion of program, data and structure representations. Program Representation: Dataflow compilers transl ate high level programs into directed graphs; vertices in the graph correspond to machine instructions, ....

Dennis, J. B. First Version of a Data Flow Procedure Language. In Lecture Notes in Computer Science Volume 19: Programming Symposium: Proceedings; Colloque sur la Programmation, B. Robinet, Ed., Springer-Verlag, 1974, pp. 362-376.

....for program optimisation and program transformations (e.g. vectorisation) that require interaction of different dependence types. Dataflow graphs, from which the PDG notation is extended by adding control arcs, have long been used to exploit parallelism independent of computer architectures [22, 23]. A dependence graph, like a Dataflow graph, exposes potential parallelism. A visual program dependence graph (VPDG) 24] an extension of a program dependence graph (PDG) supports both code transformations when parallelising programs and mapping when visualising the code. Common features of ....

J. B. Dennis (1975) First version of a data flow procedure language. Revised Comp. Struc. Group Memo 93, MIT LCS.

....Cadis) and the DSP Station from Mentor Graphics (formerly EDC) These software environments all claim variants of dataflow semantics, but a word of caution is in order. The term dataflow is often used loosely for semantics that deviate significantly from those outlined by Dennis in 1975 [13]. Most, however, can be described formally as special cases of dataflow process networks [29] which are in turn are a special case of Kahn process networks [20] In Kahn process networks, a number of concurrent processes communicate through unidirectional FIFO channels, where writes to the ....

J.B. Dennis, "First Version Data Flow Procedure Language", Technical Memo MAC TM61, May, 1975, MIT Laboratory for Computer Science.

....section, we showhow a certain class of data flowprogram graphs can be used to generate code sequences for a prioritized queue machine. Adata flowprogram graph is a directed graph in which the nodes correspond to instructions (called actors) and the arcs specify the movement of operands (tokens) [6]. In this section, we shall consider only acyclic data flowprogram graphs composed of actors that produce results on all of their output arcs. Let an n node graph consisting of actors A 1, A 2, A n be represented by an n n connectivity matrix C,where C ij = 1ifthere is a directed arc from A ....

Jack B. Dennis, "First Version of a Data FlowProcedure Language," Programming Symposium: Proceedings, Colloque sur la Programmation, LectureNotes in Computer Science 19, April 1974, pp. 362-376.

....of a language of this richness requires a flexible yet abstract domain theory of the kind presheaf models seem able to support. 2 Models for indeterminate dataflow The Dataflow paradigm for asynchronous parallel computation, originated in work of Jack Dennis and others in the mid sixties [21, 10, 11]. The basic idea is that data flows between autonomous computing agents, that are interconnected by communication channels. The essential idea is that computation is triggered by the arrival of data rather than by flow of control. The channels are assumed to act as unbounded FIFO queues. For ....

DENNIS, J. First version of a dataflow procedure language. In Proc Colloque sur la Programmation (1974), B. Robinet, Ed., vol. 19 of LNCS, Springer,

....an action, it is not a priori determined with which other agent (if any) it will interact. Local interaction refers to the situation when communication takes place through interfaces which are local to two fixed agents, meaning that interaction can be modelled by composition. Dataflow networks [74, 33] as studied in Ch. 8 are classical examples of locally interacting systems. Local interaction has been advocated lately through the interaction semantics programme [6, 4, 5, 3] as the right setting for studying typed concurrency, opening up to a Curry Howard paradigm for concurrency. Others. The ....

....The semantics of a language of this richness requires a flexible yet abstract domain theory of the kind presheaf models seem able to support. 8. 1 Models for Indeterminate Dataflow The Dataflow paradigm for parallel computation, originated in work of Jack Dennis and others in the mid sixties [74, 33]. The essential idea is that data flows between asynchronous computing agents, that are interconnected by communication channels acting as unbounded bu#ers. Traditionally, the observable behaviour is taken to be the input output relation between sequences of values on respectively input and output ....

Jack B. Dennis. First version of a dataflow procedure language. In B. Robinet, editor, Proceedings Colloque sur la Programmation, volume 19 of LNCS, pages 362--376.

....with new ideas for applicative architectures, dramatically reducing the expense of such experimentation, in much the same way s MIT s proposed Multiple Processor Emulation Facility[ADI83] will when completed. We have designed simulators for three applicative architectures: Static data flow[Den74], VIM style dynamic data flow[Den80] and Combinator reduction[Tur79] We have actu0lly implemented the static data flow and combinator reduction simulators. In this paper we describe the design of those simulators for running on the CM, and some lessons we have learned from the design and ....

....Architectures We simulate static data flow, VIM style dynamic data flow, and combnator reduction archi tectures. This section defines what we mean by each of these architectures and describes a high level implementation strategy for each. 3. 1 Static Data Flow A static data flow computer[Den74] consists of two active components: The program graph, and the structure storage. 3.1.1 Static Data Flow Program Graphs Abstractly, a static data flow program graph is a directed graph with processing elements at the vertices. Data values travel along the arcs of the graph, and processing ....

J.B. Dennis. First version of a data flow procedure language. In Lecture Notes in Computer Science, pages 362-376, Springer-Verlag, 1974.

No context found.

J. B. Dennis, First Version Data Flow Procedure Language, Technical Memo MAC TM61, MIT Lincoln Laboratory for Computer Science, May 1975.

No context found.

Jack B. Dennis. First version of a data flow procedure language. In Lecture Notes in Computer Science 19: Programming Symposium, pages 362--376. Springer-Verlag: Berlin, New York, 1974.

No context found.

Dennis75 J. Dennis, "First Version of a Data Flow Procedure Language," MIT Technical Report TR-673, MIT, Cambridge, Massachusetts, USA, May 1975.

No context found.

J. B. Dennis. First version of a data flow procedure language. In Proceedings of the Colloque sur la Programmation, Vol. 19, Lecture Notes in Computer Science, pages 362--376, 1974.

No context found.

J. B. Dennis. First version of a data flow procedure language. In G. Goos and J. Hartmanis, editors, Programming Symposium, volume 19 of Lecture Notes on Computer Science, pages 362--376. Springer Verlag, 1974.

No context found.

Jack B. Dennis. First version of a data flow procedure language. In Lecture Notes in Computer Science 19: Programming Symposium, pages 362--376. Springer-Verlag: Berlin, New York, 1974.

No context found.

Jack B. Dennis. First version of a data flow procedure language. Technical Report 61, Laboratory for Computer Science, Massachusetts Institute of Technology, May 1975.

No context found.

J. B. Dennis, "First version data flow procedure language," Tech. Rep. MAC TM61, MIT Laboratory for Computer Science, 1991.

No context found.

Jack B. Dennis. First version of a data flow procedure language. In Lecture Notes in Computer Science 19: Programming Symposium, pages 362--376. Springer-Verlag: Berlin, New York, 1974.

No context found.

J. B. Dennis. First version of a dataflow procedure language. In Programming Symposium: Proceedings, Colloque sur la Programmation, number 19 in Lecture Notes in Computer Science, pages 362--376. Springer, Apr. 1974.

No context found.

J. B. Dennis. First version of a dataflow procedure language. In Programming Symposium: Proceedings, Colloque sur la Programmation, number 19 in Lecture Notes in Computer Science, pages 362--376. Springer, Apr. 1974.

No context found.

J. B. Dennis. First version data flow procedure language. Technical Report MAC TM61, MIT Laboratory for Computer Science, 1974.

No context found.

J. B. Dennis, "First version data flow procedure language," Massachusetts Inst. Technol. Lab. Comput. Sci. Tech. Memo MAC TM61, May 1975.

No context found.

$. B. Dennis. First version of a data flow procedure language. Technical report, Laboratory for Computer Science, Massachusetts Institute of Technology, May 1975.

No context found.

J. B. Dennis, "First Version of a Data Flow Procedure Language," Laboratory for Computer Science, Massachusetts Institute of Technology May 1975.

No context found.

J. Dennis, "First Version of a Data Flow Procedure Language," MIT Technical Report TR-673, MIT, Cambridge, Massachusetts, USA, May 1975

First 50 documents  Next 50

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