You certainly got my attention. I have worked on a number of speedup projects in this life and prior. We have one right now where we need a vendor to make a change. The vendor will learn about this.
Previously though, the two techniques were hashing to reduce the length of queues and the use of CS/CDS w/ separate input and output queues (or if you wish requestor and servor queues). Have used a few binary searches. Always nice to have additional tools for worst case scenarios. Thanx IBM Mainframe Discussion List <[email protected]> wrote on 11/29/2006 09:30:47 PM: > Maintaining/replacing ad hoc code of this sort is a nightmarish job. .. .. .. > and it speeds up the execution of these applications enormously, often by a > factor of more than 10k (sic). ----------------------------------------- The information contained in this communication (including any attachments hereto) is confidential and is intended solely for the personal and confidential use of the individual or entity to whom it is addressed. The information may also constitute a legally privileged confidential communication. If the reader of this message is not the intended recipient or an agent responsible for delivering it to the intended recipient, you are hereby notified that you have received this communication in error and that any review, dissemination, copying, or unauthorized use of this information, or the taking of any action in reliance on the contents of this information is strictly prohibited. If you have received this communication in error, please notify us immediately by e-mail, and delete the original message. Thank you ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
