From: lkcl Date: Sat, 14 May 2022 00:26:25 +0000 (+0100) Subject: (no commit message) X-Git-Tag: opf_rfc_ls005_v1~2247 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=25f0a2b63056e9fbb2a12b063e3c19cc1d3a8983;p=libreriscv.git --- diff --git a/openpower/sv/SimpleV_rationale.mdwn b/openpower/sv/SimpleV_rationale.mdwn index 5e5ca12ca..bc3eeb677 100644 --- a/openpower/sv/SimpleV_rationale.mdwn +++ b/openpower/sv/SimpleV_rationale.mdwn @@ -605,10 +605,10 @@ out to an entirely different loop, all based on conditions determined dynamically at runtime. Even when deployed on as basic a CPU as a single-issue in-order RISC -core, the performance and power-savings were astonishing: between 20 -and **80%** reduction in algorithm completion times were achieved compared +core, the performance and power-savings were astonishing: between 27 +and **75%** reduction in algorithm completion times were achieved compared to a more traditional branch-speculative in-order RISC CPU. MPEG -Decode, the target algorithm specifically picked by the researcher +Encode's timing, the target algorithm specifically picked by the researcher due to its high complexity with 6-deep nested loops and conditional execution that frequently jumped in and out of at least 2 loops, came out with an astonishing 43% improvement in completion time. 43%