Learn More
Branch prediction is critical to the instruction-level parallelism. Researchers have been focusing on branch direction algorithm for a long time and recent improvement on the prediction accuracy in literatures is achieved by increasing the complexity of algorithms and at the cost of enlarging the branch target buffers. Thus many of these high accuracy(More)
Three types of two-way two-dimensional finite automata and three-way two-dimensional finite automata are studied, including deterministic, nondeterministic and Las Vegas finite automata. By comparing the languages recognized by above automata, two results are obtained: (1) The power of two-way two-dimensional nondeterministic finite automata and three-way(More)
In theory, branch predictors with more complicated algorithms and larger data structures provide more accurate predictions. Unfortunately, overly large structures and excessively complicated algorithms cannot be implemented because of their long access delay. To date, many strategies have been proposed to balance delay with accuracy, but none has completely(More)
  • 1