Data flow on a queue machine
Data flow on a queue machine
复制标题
队列机上的数据流
DOI：
10.1145/327070.327367
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
V. Hamacher
中科院分区：
文献类型：
--
作者：
B. R. Preiss;V. Hamacher
描述了一种支持程序可重性、递归和自动运行时循环解开的执行模型。这种执行模型是基于队列机器执行非循环数据流图。使用独立的指令和数据令牌空间允许程序可重入。被称为上下文的执行环境执行与高级代码块相关联的非循环数据流图。迭代和函数激活是通过动态创建上下文来实现的，不需要使用标记令牌。提出了一种支持这种执行模型的多处理器体系结构。T ~系统结构基于一个分区环，其中环的每个分区是一个常规的处理器/存储器总线。所提出的体系结构已在软件中模拟。已经开发了一些测试程序，并对其执行建议的架构进行了评估。所提出的架构与各种数量的处理元件的性能进行了描述。此外，一些任务调度算法提出和评估。
An execution model that supports program reantrancy, recurslon, and automatic run-time loop unravelling is described. This execution model Is based on queue machines that execute acyclic data-flow graphs. The use of separate instruction and data token spaces allows program reentrancy. Execution environments called contexts execute acyclic data-flow graphs associated with high-level code blocks. Iteration and function activation are implemented by the dynamic creation of contexts and do not require the use of tagged tokens. A multiprocessor architecture that supports this execution model is proposed. T ~ system architecture is based on a partitioned ring in which each partition of the ring is a conventional processor/memory bus. The proposed architecture has bean simulated in software. A number of test programs have been developed and their execution on the proposed architecture has been evaluated. The performance of the proposed architecture with various numbers of processing elements is described. In addition, a number of task scheduling algorithms are presented and evaluated.