On 2019-10-19 14:45, Charles Mills wrote:
Others have given you good replies. I've been thinking about your question
and thought I would summarize and re-phrase what has been said. You are not
very specific in what your situation is, so let me offer three possible
problem scenarios, each with its own solution.
I. "I am doing something that is going to require a whole lot of processing,
like computing pi to a million digits. It occurs to me that I have been
processing for quite some time. I would like to be polite and give others a
chance."
Oops, been there, did that, not for pi, but for "e", and I did it (in 1992), so
before Nemiroff & Bonnell (See <https://apod.nasa.gov/htmltest/gifcity/e.2mil>)
My PL/I program, using a far from optimal algorithm (a reverse Taylor series
summation, only adding digits when required, feel free to ask for the initial
source) just stopped after ten minutes, and I had to resubmit it again. A later
version, for which I lost the source would run for a max of 6 hours elapsed
time, but it also used the PL/I delay() builtin, and the PL/I multi-tasking
facility to stop it via an (operator) reply. That one ran occasionally for a few
hours on weekends. I no longer have any clue as to how much time the whole
calculation took.
Needlessly to say management wasn't overly happy about the endeavour...
Robert
--
Robert AH Prins
robert.ah.prins(a)gmail.com
The hitchhiking grandfather - https://prino.neocities.org/indez.html
Some REXX code for use on z/OS - https://prino.neocities.org/zOS/zOS-Tools.html
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
