Functional Programming
A data flow architecture with a paged memory system
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE
Structure handling in data-flow systems
IEEE Transactions on Computers - The MIT Press scientific computation series
DVPP: a VLSI dynamic-graph ensemble machine
ICS '88 Proceedings of the 2nd international conference on Supercomputing
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Methods for handling structures in data-flow systems
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
A Design Pattern for Component Oriented Development of Agent Based Multithreaded Applications
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
In several data flow architectures, “streams” are proposed as special data structures able to improve parallel execution in functional programs by providing a pipelining effect between different program parts. This paper describes how streams are implemented on a data flow computer system based on a paged memory. This memory holds both the data flow programs and data structures such as streams. Streams are stored in the memory as a linked list of pages while pointers to the streams are flowing as data tokens. A reference count is used to prevent for excessive copying of data and to control the allocation and recovery of pages. Input/output is treated as a special application of streams.