Data Flow Analysis in Software Reliability
ACM Computing Surveys (CSUR)
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Dataflow Computing Models, Languages, and Machines for Intelligence Computations
IEEE Transactions on Software Engineering - Special Issue on Artificial Intelligence in Software Applications
Cache Memories for Data Flow Machines
IEEE Transactions on Computers
Design of cache memories for multi-threaded dataflow architecture
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Problem dynamics and working set principle as applied to concurrent processing
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Scheduled Dataflow: Execution Paradigm, Architecture, and Performance Evaluation
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
An Efficient Way of Passing of Data in a Multithreaded Scheduled Dataflow Architecture
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
| Hi-index | 0.00 |
This paper discusses the concept of the working set for data-flow machines in order to establish one of the criteria for the realization of cost effective data-flow machines. The characteristics of program execution in conventional machines and data-flow machines are compared. Then, a definition of the working set for data-flow machines is proposed, based on the simultaneity of execution and the principle of locality. Several segmentation, fetch, and removal policies are described. Evaluation is made in terms of feasibility, efficiency, and performance, through computer simulations.