Structure handling in data-flow systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Stored data structures on the Manchester dataflow machine
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
A scalable dataflow structure store
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Annual review of computer science vol. 1, 1986
ACM Computing Surveys (CSUR)
Code Optimization for Tagged-Token Dataflow Machines
IEEE Transactions on Computers
The Epsilon dataflow processor
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Can dataflow subsume von Neumann computing?
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Token Relabeling in a Tagged Token Data-Flow Architecture
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing - Special issue: data-flow processing
A vertically layered allocation scheme for data flow systems
Journal of Parallel and Distributed Computing
Monsoon: an explicit token-store architecture
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Multiprocessor memory organization and memory interference
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Hybrid Structure: A Scheme for Handling Data Structures in a Data Flow Environment
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
I-structures: Data structures for parallel computing
Proceedings of the Workshop on Graph Reduction
A multiple processor data flow machine that supports generalized procedures
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Divide and concer: Data structuring in applicative multiprocessing systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS
A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS
| Hi-index | 0.00 |
The asynchronous nature of the dataflow model of computation allows the exploitation ofmaximum inherent parallelism in many application programs. However, before the dataflow model of computation can become a viable alternative to the control flow model of computation, one has to find practical solutions to some problems such as efficienthandling of data structures. The paper introduces a new model for handling datastructures in a dataflow environment. The proposed model combines constant timeaccess capabilities of vectors as well as the flexibility inherent in the concept of pointers.This allows a careful balance between copying and sharing to optimize the storage andprocessing overhead incurred during the operations on data structures. The mode) iscompared by simulation to other data structure models proposed in the literature, and theresults are good.