Revision as of 18:02, 24 July 2023 edit Citation bot (talk \| contribs) Bots 5,863,285 edits Alter: title, template type. Add: chapter. Removed parameters. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 \| #UCB_webform_linked 1247/2384 ← Previous edit		Revision as of 00:10, 3 August 2023 edit undo 192.76.8.66 (talk) →Examples: Remove spammy, promotional item backed entirely by primary references to IBM's own advertising. Next edit →
Line 10: ==Examples== * "[[IBM]] Automatic Binary Optimizer for z/OS<ref name="IBM_ABO_2015"/>" (ABO) was introduced in 2015 as a cutting-edge technology designed to optimize the performance of [[COBOL]] applications on [[IBM Z]]<ref name="IBM_Z"/> mainframes without the need for recompiling source. It uses advanced optimization technology shipped in the latest Enterprise COBOL.<ref name="COBOL-zOS"/> ABO optimizes compiled [[binaries]] without affecting program logic. As a result, the application runs faster but behavior remains unchanged so testing effort could be reduced. Clients normally don't [[recompile]] 100 percent of their code when they upgrade to new compiler or IBM Z hardware levels, so code that's not recompiled wouldn't be able to take advantage of features in new IBM Z hardware. Now with ABO, clients have one more option to reduce [[CPU]] utilization and operating costs of their business-critical COBOL applications. You can try ABO out with an improved, easy-to-use ABO Trial Cloud Service <ref name="IBM_ABO_2020"/> without installing ABO on your system. * The earliest "COBOL Optimizer" was developed by [[Capex Corporation]] in the mid 1970s for [[COBOL]]. This type of optimizer depended, in this case, upon knowledge of 'weaknesses' in the standard IBM COBOL compiler, and actually replaced (or [[patch (computing)\|patch]]ed) sections of the object code with more efficient code. The replacement code might replace a linear [[lookup table\|table lookup]] with a [[binary search algorithm\|binary search]] for example or sometimes simply replace a relatively slow instruction with a known faster one that was otherwise functionally equivalent within its context. This technique is now known as [[strength reduction]]. For example, on the [[IBM/360]] hardware the <code>CLI</code> instruction was, depending on the particular model, between twice and 5 times as fast as a <code>CLC</code> instruction for single byte comparisons.<ref name="IBM"/><ref name="Evans_1982"/>

Object code optimizer: Difference between revisions