Design of a superscalar processor based on queue machine computation model

Abstract

The queue machine computation model is an evaluation scheme for expression trees, in which the input operands of operations are taken from head of a queue, and its result is put onto tail of the same queue. A series of operations for this model are generated by traversing the expression tree(s) from its leaf nodes in reverse of the breadth-first ordering. Since nodes with the same level in an expression tree can be processed concurrently, the generated operations can also be processed in parallel without reordering. In this paper, we describe a design of superscalar processor using this computation model.