Efficient Execution of Dataflow Programs

已经提出了许多架构来实现基本的 计算的基本原理。 所有人共同面临的主要问题 这些体系结构是与执行相关的大量开销， 每个单独的指令。 特别是， 从一个指令到另一个指令的传递可能需要相当长的时间 距离通过通信网络和各种硬件 组件（特殊存储器和队列）， 目的地 此外，指定给同一指令的操作数 必须在特殊的令牌匹配存储中识别和隔离。 只有当一条指令的所有操作数都到达时， 被调度用于在处理器上执行。 相比之下，通过一个 在冯·诺依曼计算机中从一条指令到另一条指令的操作数 仅需要简单的存储器存储操作。 在这项研究中，一个不同的方法是用来执行的EQUALLOW 程序，这大大减少了操作数路由的开销 和匹配。 这种方法是基于打破一个给定的 将程序分解为代码段，由于其操作数 依赖关系，必须按顺序执行。 每个这样的序列可以是 加载到存储器中，以便每当其第一条指令被 启用. 一旦加载，它可以被视为一个非常简单的顺序 进程，当它的当前指令被启用时，它就准备好了， 当有空闲的处理器时运行，当当前的 指令正在等待操作数到达。 因此， 程序可以被看作是一个非常简单的通信集合， 流程. 在这项研究中，他们将研究过程导向的方法 通过更详细地制定模型和架构， 进行广泛的模拟实验，以比较其性能 冯·诺依曼计算机和其他的牛顿系统。

A number of architectures have been proposed to implement the basic principles of dataflow computation. The main problem common to all these architectures is a large overhead associated with the execution of each individual instruction. In particular, each operand that passes from one instruction to another may have to travel considerable distances through a communication network and various hardware components (special memories and queues) before it reaches its destination. Furthermore, operands destined for the same instruction must be recognized and segregated in a special token matching store. Only when all operands have arrived for an instruction, can it be scheduled for execution on a processor. In comparison, passing an operand from one instruction to another in a von Neumann computer requires only a simple memory store operation. In this research, a different approach is used to executing dataflow program, which significantly reduces the overhead of operand routing and matching. The approach is based on the idea of breaking a given dataflow program into segments of code which, due to their operand dependencies, must be executed sequentially. Each such sequence may be loaded into memory for execution whenever its first instruction is enabled. Once loaded,it can be viewed as a very simple sequential process, which is ready when its current instruction is enabled, running when there is a free processor, and blocked when its current instruction is waiting for operands to arrive. Hence, the dataflow program may be viewed as a collection of very simple communicating processes. In this research, they will investigate the process-oriented approach by formulating the model and the architecture in more detail and by performing extensive simulation experiments to compare its performance to von Neumann computers and to other dataflow systems.