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.