irreducible branch

irreducible branch的基本解释

-

不可约分支

与irreducible branch相关的网络例句 [注：此内容来源于网络，仅供参考]

Based on a lot of experiment results, a conclusion is drawn: comparing with other factors, the performance of branch handling strategy is the key limits of processor to exploit the instruction level parallelism existed in nonscientific code, cache miss have severe effect on superscalar processor's performance when it runs scientific code. Second, in order to reduce the branch penalty and improve the performance of superscalar processor, a new branch handling strategy—a classification based hierarchical branch handling strategy, CHBHS is proposed. It first expands the traditional processor architecture to support multiple condition code, conditional execution and Mbranch instruction, as a result, compiler can reduce the number of static conditional branch when the code is generated. Then, CHBHS tries to use the best suitable mechanism to deal with different branch base on their different behavior. CHBHS can predict the target address of unconditional branch, subroutine call and conditional branch by buffering their target address in branch target buffer, a newly proposed high efficient return address stack is used to reduce the penalty of subroutine return instruction, a new Counter Register Stack is also proposed to reduce the penalty of loop-closing branch to zero, and dynamic branch predictor is incorporate with branch target buffer to predict the outcome of conditional branch.

基于上述结论，为了尽量消除转移指令对处理器开发指令级并行性能力的影响，进一步提高处理器性能，在详尽分析目前已存在的转移处理策略的特点与局限性的基础上，首次提出了一种新的转移处理策略即基于分类的层次转移处理策略CHBHS(Classification Based Hierarchical Branch Handling Strategy)，它首先通过扩展传统的体系结构，支持多条件码、条件式执行及多分支转移技术，以使编译程序在进行代码生成时可尽量少生成条件转移指令，从而减少静态条件转移指令的数目；其次，基于不同的转移指令的行为不同这一事实，提出了对不同的转移指令采用不同的机制进行处理的思想，即对无条件转移指令和函数调用指令以及条件转移指令的目标地址，采用转移目标缓冲器来预测，对于函数返回指令，采用所提出一种的高效返回地址栈来预测其目标地址，对于大多数循环控制转移指令，采用所提出的Counter Register Stack来将其所可能带来的损失减少为0，对于其他的条件转移指令采用动态预测机制来预测其方向。

We give the description of meet irreducible ideals in terms of matrix units in the limit of a direct sum of nest algebras.For each MI-chain ,the ideal I associated with it is meet irreducible.Conversely,every proper meet irreducible ideal is induced by some MI-chain,but there is not a 1-1 correspondence between MI-chain and meet irreducible ideals.

接下来我们用MI-链刻画了套代数直和的极限即NSAF代数的交不可约理想，与MI-链相对应的理想就是交不可约的，任给一个交不可约理想能找到一个MI-链与之对应，但它们不是一一应。

Analytic branch amount and branch angle are right produce can influence discovery: Mi Qian is planted increase of number of branch of? of You of that a pavilion or house on a terrace of joyous ǖ of Сざ sew, produce can reduce somewhat, think branch well should not seek overmuch branch amount, with 2~3 branch is advisable; branch angle increases, the yield of much branch well also can increase, but addition extent decrescent.

分析分支数目和分支角度对产能的影响发现：在总分支长度一定的情况下，分支数目增多，产能略有降低，认为分支井不应追求过多的分支数目，以2~3个分支为宜；分支角度增大，多分支井的产能也增大，但增加的幅度变小。

与irreducible branch相关的网络解释 [注：此内容来源于网络，仅供参考]

irreducible branch：不可约分支

irreducible algebraic variety 不可约代数簇 | irreducible branch 不可约分支 | irreducible case 不可约情形

irreducible branch：不可约的分支

不可约的代数方程 irreducible algebraic eq | 不可约的分支 irreducible branch | 不可约的特征标 irreducible character