On 29/04/2016 8:46 PM, Elardus Engelbrecht wrote:
David Crayford wrote:
We're doing some performance work on our assembler code and one of my
colleagues ran the following test which was surprising. Unconditional branching
can add significant overhead. I always believed that conditional branches were
expensive because the branch predictor needed to do more work and unconditional
branches were easy to predict. Does anybody have an explanation for this. Our
machine is z114. It appears that it's even worse on a z13.
Hmmm, interesting, but I'm clueless about this one.
Perhaps someone lurking on Assembler-L can help you out? Could you post your
message there?
Indeed! But most of the guys in the know hang out here, which is the
epicenter of knowledge in our world. I do post on MVS-OE for Unix stuff
because some of the IBM developers of USS only hang out there.
Groete / Greetings
Elardus Engelbrecht
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
