P. D. Stotts, "The PFG Language: Visual Programming for Concurrent Computing," Proc. Int. Conf. on Parallel Programming, Vol. 2, pp. 72-79, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....parallelism and timing relationships in a huge variety of applications [26] In addition, specialized models can be combined into more general models with unified semantics. For example, dataflow and discrete event semantics have been combined for hardware design [33] and graphical programming [31]. However, such generality has a price. Analysis of systems using such general descriptions is difficult, and efficient compilers are difficult to implement. In the case of VHDL, for example, all effective VLSI synthesis tools restrict their domain to a subset of the language. Unfortunately, each ....

P. D. Stotts, "The PFG Language: Visual Programming for Concurrent Computing," Proc. Int. Conf. on Parallel Programming, Vol. 2, pp. 72-79, 1988.

....for years (cf. 7] Some approaches use graphical formalisms close to that of Meander. In [17] a graphical basis for visualization is obtained by program analysis; no support is given for program development. For the Petri net based work of [5] the focus lies in performance prediction. PFG [13] models control flow as well as data access in a graphical manner. The control flow part seems to be close to our approach although PFG works on shared data and hence uses a di#erent underlying computation model. The Schedule environment [4] is explicitly dedicated to the development of large ....

Stotts, P. D. The PFG language: Visual programming for concurrent computation. In Proc. Int. Conference on Parallel Processing (1988), pp. 72--79.

....such languages are no more or less analyzeable than their non dataflow counterparts) Instead, we refer to languages that explicitly reveal their dataflow underpinnings at the language level. Probably the best examples of such languages are the visual dataflow languages like TDFL [15] PFG [14], and Poker [13] These languages are loosely based on the Petri net programming model. If one were to base a language on a restricted class of Petri nets, with the limitations that the net be finite, contain no cycles, process only scalars, and that arcs be used only once, then the programs would ....

P. David Stotts. The PFG language: Visual programming for concurrent computation. Proceedings of the 1988 International Conference on Parallel Processing, II, Software:72--79, August 1988.

....[5] for an overview) Some approaches use graphical formalisms close to that of Meander. In [12] a graphical basis for visualization is obtained by program analysis and no support is given for program development. For the Petri net based work of [3] the focus lies in performance prediction. PFG [11] models control flow as well as data access in a graphical manner. The control flow part seems to be close to our approach although PFG works on shared data and hence uses a di#erent underlying computation model. The Schedule environment [2] is explicitly dedicated to the development of large ....

Stotts, P. D. The PFG language: Visual programming for concurrent computation. In Proc. Int. Conf. on Parallel Processing (1988), pp. 72-- 79.

....large scale numerical programs but restricted to sharedmemory machines and based on Fortran. In [7] a graphical basis for visualization is obtained by program analysis; no support is given for program development. For the Petri net based work of [8] the focus lies in performance prediction. PFG [9] models control flow as well as data access in a graphical manner. The control flow part seems to be close to our approach although PFG works on shared data and hence uses a different underlying computation model. The basic atomic entities of many graphical approaches are coarse grained entities ....

P. D. Stotts. The PFG language: Visual programming for concurrent computation. In Proc. Int. Conference on Parallel Processing, pages 72--79, 1988.

....has two levels, with control flow at the top level and data flow underneath. There are also modeling techniques that combine the two levels, permitting both control flow and data flow at the same level. The dataflow event graphs of [Whi92] are one such model; the PFG graphical programming language [Sto88] provides a similar capability. The Program Dependence Web, or PDW, is a relatively new program representation for use as an intermediate representation in compilation of imperative languages [Bal90] This model, an extension of program dependence graphs (PDG) Fer87] and 47 static single ....

P. D. Stotts, "The PFG Language: Visual Programming for Concurrent Computing, " Proc. Int. Conf. on Parallel Programming, Vol. 2, pp. 72-79, 1988.

....model, in our case we are providing a means for creating data models in our targeted domain, programming. There are existing systems which are similar to ours in that they provide a general graph based programming language which can be refined to specific applications such as the PFG system of [Sto88] and the Olympus system of [Nut91] Both of these systems are however tied to an underlying Petri Net model of computation; we are attempting to be more general. The h graph selectors used in PFG is similar the dot addressing scheme we use, though selectors describe a path through a ....

D.P. Stotts. The PFG Language: Visual Programming for Concurrent Computation Expressing High-Level Visual Concurrency Structures in the PFG Kernel Language. In Int. Conf. on Par. Proc., pages 72--79, August 1988. Vol2: Software, Univ Maryland.

....no associated execution semantics. However the interaction of a user with a hypertext system or the process of traversing the system in order to retrieve information is dynamic, and models this activity, based on the graph structure of hypertext have been developed in the Trellis and PFG systems [Sto88,Sto90] 2.2.1 Graph Grammars A more radical form of using graphs to model computational systems is to make the topology (the interconnection state) of the graph part of the execution model. In these graph grammar models, links and nodes can be created, deleted, connected, and disconnected ....

....previous chapter. The PFG system has an underlying Petri Net based model of computation. The primitives of the kernel computation engine have been made available to allow the creation higher level constructs to implement higher level visual languages for particular applications of the system [Sto88] Another example of this is the Olympus system [Nut91] This system was originally a graphical programming environment for a specific graph based model of computation: bilogic precedence graphs. The system was then made extensible to allow the model of execution to be customized while reusing ....

D.P. Stotts. The PFG Language: Visual Programming for Concurrent Computation Expressing High-Level Visual Concurrency Structures in the PFG Kernel Language. In Int. Conf. on Par. Proc., pages 72--79, August 1988. Vol2: Software, Univ Maryland.

No context found.

P.D. Stotts. The PFG Language: Visual Programming for Concurrent Computation, in Proceedings of the International Conference on Parallel Processing, 1988, vol. 2, pp.

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