|
I have following scenario. Control program reads through a control file (control file has list of transactions to be processed) and calls programs as below: CREATE_TRAN_INFO -> this program writes record in CREATE_TRAN_INFO phy. file per transaction CREATE_CASH_INFO -> this program writes record in CREATE_CASH_INFO phy. file per transaction CREATE_COLLAERAL_INFO -> this program writes record in CREATE_COLLAERAL_INFO phy. file per transaction (Lets call these as work programs) If all work programs run successfully, control program flags transaction as processed and commits. This is taking about 20 min. to process around 40,000 transactions. I need to reduce this by 40% to meet SLA specified. Can I get some ideas on how best can this be achieved. I could think of creating IN and OUT data queues for each work program. Take them out (from inline call) to a separate job that runs in batch. Control program feeds these programs through IN data queue and picks the processed part from OUT and also writes to the respective phy. file. I am of the opinion that there would be too many dynamic calls to QSNDDTAQ and QRCVDTAQ, not sure if the objective would be achieved. Just for note, all work programs can run independently at the same time. Any help is greatly appreciated. Best rgds., Srikanth D
This e-mail and any files transmitted with it are for the sole use of the intended recipient(s) and may contain confidential and privileged information. If you are not the intended recipient, please contact the sender by reply e-mail and destroy all copies of the original message. Any unauthorised review, use, disclosure, dissemination, forwarding, printing or copying of this email or any action taken in reliance on this e-mail is strictly prohibited and may be unlawful. Visit us at http://www.cognizant.com
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2025 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.