Some interesting information on branch prediction in that paper.
If you've got a z/OS C++ compiler try this snippet out, it's fascinating: https://stackoverflow.com/questions/11227809/why-is-processing-a-sorted-array-faster-than-processing-an-unsorted-array On 2019-08-13 11:47 PM, Charles Mills wrote:
A GREAT introduction to this topic, by someone who unlike me actually knows what he is talking about: https://linuxmain.blogspot.com/2017/02/zoptimizationprimer.html Charles -----Original Message----- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Brian Chapman Sent: Monday, August 12, 2019 5:48 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Instruction speeds Hi everyone, I did some searching, but I didn't find anything that really discussed this on the topic that I'm interested. Is there anything published that compares the cycle times of the most used instructions? For example; moving an address between areas of storage. I would assume that executing a LOAD and STORE would be much quicker than executing a MVC. Or executing a LOAD ADDRESS to increment a register instead of ADD HALF WORD. Or does this really matter as much as ordering the instructions so they are optimized for the pipeline? ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
