Assuming you do not have the advanced job scheduler so you cannot just put a dependent job on the schedule, how about using a data queue rather than the data area? Each job enques an entry as its first action and a second entry as its last. The next job checks the queue with a non destructive read to be sure its ready to run. That will leave you a nice history, and queues are faster and, in my view, an easier thing to manage. Your last job just needs to sit on a Dequeue wait on a keyed queue until the proper entry appears. More efficient than the data area check every so often.

Jim Oberholtzer
Chief Technical Architect
Agile Technology Architects


On 9/12/2011 8:36 AM, Alan Shore wrote:
Good morning all
I have one job that submits numerous (a lot) of submit jobs
Once ALL of them have finished SUCCESSFULLY, I need to submit another one (let's call it PROGRAMLAST)
I was just wondering if anyone else is doing or has done the same thing, what process was used.
I am toying with the idea of using a data area and within each SBMJOB adding 1 to this data area and checking for a particular value in the PROGRAMLAST program
This would mean that PROGRAMLAST would need to be always submitted, but waiting for a value to appear in the data area


Alan Shore
Programmer/Analyst, Direct Response
E:AShore@xxxxxxxx
P:(631) 200-5019
C:(631) 880-8640
"If you're going through Hell, keep going" - Winston Churchill

--

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 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.