Order of Magnitude Instruction Level Parallelism

这个项目正在探索一种指令级并行的新方法。这种新的方法，即不接合急切执行，利用分支预测和急切执行来最大化每个循环中可以有效执行的指令数量。分支路径的集合形成一棵树，其中每个节点代表一个分支指令，每个边代表分支之间执行的代码。在不相交的急切执行中，所有最有可能的代码段都是推测执行的候选者，而不仅仅是那些最可能路径上的代码段。换句话说，执行的指令子树可能不是一个简单的链。初步研究包括对基准的一些模拟，表明大约30的加速是可能的。该项目包括更全面的模拟，以确定好处，以及架构研究，以确定并行性对机器周期时间的影响。

This project is exploring a new approach to instruction-level parallelism. The new approach, disjoint eager execution, uses branch prediction and eager execution to maximize the number of instructions that can be usefully executed on each cycle. The set of branch paths forms a tree, in which each node represents a branch instruction and each edge represents the code executed between branches. In disjoint eager execution, all of the most likely code segments are candidates for speculative execution, rather than only those code segments on the most likely path. In other words, a subtree of instructions is executed that may not be a simple chain. Preliminary research has included some simulations on benchmarks suggesting that speedup of about 30 is possible. This project includes more comprehensive simulations to determine the benefits, along with architectural studies to determine the effects of parallelism on cycle time of the machine.