BTFNTBackward Taken, Forward Not Taken (computer programming)
References in periodicals archive ?
While simple, BTFNT is also quite successful, since many programs spend a lot of time executing inside of loops, and the backward branch in a loop is correctly predicted as taken when using the BTFNT heuristic.
In recent work, Ball and Larus [1993] showed that applying a number of simple program-based heuristics can significantly improve the branch prediction miss rate over BTFNT on tests based on the conditional branch operation.
The first column shows the results for the BTFNT architecture.