Experiments with low-level speculative computation based on multiple branch prediction

Holtmann, Ulrich; Ernst, Rolf

doi:10.1109/92.238440

Cited by 15 publications

(21 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That was the result of our previous work [11]. In the following we give an improvement and for the rst time present a suitable scheduling algorithm.…”

Section: Approach Examplementioning

confidence: 58%

“…Access to array x[i] is done by a RAM access with operation Now, we make use of MBP-SC to speed-up the loop. As in [11] w e m a y predict the most probable path (that one with the highest probability to be taken). It goes through the statement \case (0x0000)" and is taken in 50 iterations (prediction accuracy p = 0 : 5).…”

Section: Approach Examplementioning

confidence: 99%

“…As long as this prediction is correct, a new iteration may be started every clock cycle and yields a speed-up of 10 compared to the schedule without SC. From [11] we know that the necessary restore phase decreases the speed-up. Here, the probability for a prediction error correction is very high (p = 0 : 5) and signicantly limits the potential speed-up from 10 (p = 1 ) t o 2 : 778.…”

Section: Approach Examplementioning

confidence: 99%

“…In [11] m ultiple branch prediction and error correction (MBP-SC) is employed as SC-technique with low circuit overhead. Given a loop with proling information, MBP-SC predicts the path through the loop body with the highest probability t o b e t a k en.…”

Section: Introductionmentioning

confidence: 99%

“…The body itself is always predicted to continue rather than being terminated. HW overhead due to prediction error correction remains low [11].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Combining MBP-speculative computation and loop pipelining in high-level synthesis

Holtmann¹,

Ernst²

Proceedings the European Design and Test Conference. ED&TC 1995

Self Cite

View full text Add to dashboard Cite

Frequent control dependencies caused by IF-and loop-statements limit the parallelism usable in HighLevel Synthesis. Loop pipelining is a powerful way to increase parallelism, but is often limited by these control dependencies. Multiple branch prediction (MBP-SC) applies loop pipelining and speculative computation to the most probable path and serves other paths during the restore phase (prediction error correction).In this paper we combine MBP-SC and loop pipelining and give a scheduling algorithm. Further MBP-SC improvement comes from parallel branch execution.The results show a considerable speedup compared to previous approaches.

show abstract

“…That was the result of our previous work [11]. In the following we give an improvement and for the rst time present a suitable scheduling algorithm.…”

Section: Approach Examplementioning

confidence: 58%

Section: Approach Examplementioning

confidence: 99%

Section: Approach Examplementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…The body itself is always predicted to continue rather than being terminated. HW overhead due to prediction error correction remains low [11].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations