Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Instruction set design issues relating to a static dataflow computer
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Building blocks for data flow prototypes
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The architecture and system method of DDM1: A recursively structured Data Driven Machine
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The Piecewise Data Flow Architecture: Architectural Concepts
IEEE Transactions on Computers
Path Length Computations on Graph Models of Computations
IEEE Transactions on Computers
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers
Performance of a Simulated Dataflow Computer
IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
IEEE Transactions on Computers
Computer
Optimal Scheduling Strategies in a Multiprocessor System
IEEE Transactions on Computers
Computation of lower bounds for multiprocessor schedules
IBM Journal of Research and Development
NP-complete scheduling problems
Journal of Computer and System Sciences
Recovery Point Selection on a Reverse Binary Tree Task Model
IEEE Transactions on Software Engineering
Efficient Algorithms for Selection of Recovery Points in Tree Task Models
IEEE Transactions on Software Engineering
Task allocation in data flow multiprocessors: an annotated bibliography
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Compile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration
IEEE Transactions on Computers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Compile-Time Scheduling of Dynamic Constructs in Dataflow Program Graphs
IEEE Transactions on Computers
Prediction of Performance and Processor Requirements in Real-Time Data Flow Architectures
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.99 |
The effect of incorporating a priority scheme into a data flow computer is studied in this paper. Specifically, we deal with the scheduling of instructions in a data flow program, and the mechanisms by which such scheduling may be implemented within a data flow computer. We show that the assignment of priorities to data flow operations is a special case of a problem in scheduling theory, and also belongs to the NP-complete class of problems. Therefore, we develop a heuristic approach, based on the well-known Critical Path algorithm, as a basis for determining instruction priorities. Our conclusions, based on the simulation of programs executed in a modified data flow computer, show that adding a priority mechanism is not justifiable in the general case. This is due mostly to the inability to reach the potential improvement offered by scheduling operations, because of implementation restrictions. Nevertheless, certain algorithms (e. g., DFT) can still benefit from the proposed scheme, mainly because of their highly regular, static structure.