An inherently parlle large grained data flow environment

  title={An inherently parlle large grained data flow environment},
  author={R. Eggen and J. Metzner},
  booktitle={CSC '88},
A parallel programming environment based on data flow is described. Programming in the environment involves use with an interactive graphic editor which facilitates the construction of a program graph consisting of modules, ports, paths and triggers. Parallelism is inherent since data presence allows many modules to execute concurrently. The graph is executed directly without transformation to traditional representations. The environment supports programming at a very high level as opposed to… Expand
A message based operating system promoting parallel programming
  • R. Eggen
  • Computer Science
  • Proceedings. IEEE Energy and Information Technologies in the Southeast'
  • 1989
The proposed system allows the programmer to concentrate on potential parallelism at a high level using predefined user-specific modules using C macros as a lower-level implementation tool. Expand
A Rollback-Recovery Protocol for Wide Area Pipelined Data Flow Computations
Over a large range of possible data flow graphs, the protocol is shown to support tolerance of a single machine failure, per execution of the data flow computation, and in many cases to provide a greater degree of fault-tolerance. Expand
Applying Low-Overhead Rollback-Recovery to Wide Area Distributed Query Processing
This paper presents an approach which exploits limited input from the application layer to implement a low overhead recovery protocol for data flow computations which supports tolerance of a single machine failure, per execution of the computation, and in many cases a greater degree of fault-tolerance. Expand


A very high level language for large-grained data flow
EASY-FLOW, a data flow language above the level of a traditional high level language, is presented for the purpose of adapting programs written in a conventional programming language to a parallelExpand
Communicating sequential processes
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. WhenExpand
Elimination algorithms for data flow analysis
A unified model of a family of data flow algorithms, called elimination methods, is presented, which provides implementation-independent descriptions of the algorithms to facilitate comparisons among them and illustrate the sources of improvement in worst case complexity bounds. Expand
Parallel Processing in Ada
The purpose of this discussion is to place the design of Ada's parallel processing in its proper historical and technical context, and show how Ada itself has clarified some issues and thus established trends in language design. Expand
Data parallel algorithms
The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was previously thought. Expand
How Data Flow can Improve Application Development Productivity
Use of the data flow technique is a key to increasing the productivity of the application developer. It allows greater independence between functions of an application, which substantially improvesExpand
Contention is no obstacle to shared-memory multiprocessing
Contention in large-scale shared-memory systems is less of a concern than generally believed. Through careful engineering of a parallel system, the effects of contention can be controlled.
Parallel free-text search on the connection machine system
A new implementation of free-text search using a new parallel computer—the Connection Machine®—makes possible the application of exhaustive methods not previously feasible for large databases.
Guest Editor's Introduction: Domesticating Parallelism