Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!rutgers!mailrus!cornell!rochester!udel!mmdf
From: BEB%UNO.BITNET@cunyvm.cuny.edu
Newsgroups: comp.sys.amiga
Subject: Re: need info on exceptions
Message-ID: <3882@louie.udel.EDU>
Date: 30 Aug 88 00:04:43 GMT
Sender: mmdf@udel.EDU
Lines: 18

Getting back to the original posting for a second: (not that all this stuff
on exceptions and tasking and critical sections wasn't real interesting)
I would like to know:

Is this application an essentially iterative process? If so, why not just
pick some arbitrary number of iterations to count, then checkpoint? If the
e.t. of the iterations is non-linear, than how about some similar non-linear
decrease in iterations between checkpoints? The advantage here is you avoid
the overhead and complexity  of multiple tasks and the synchronization thereof,
and you don't have to worry about invalid data.

                                  Bruce
death before disclaimer
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
<>Handle:   Bruce Bettis         USnail:   University of New Orleans  <>
<>BITnet:   <BEB@UNO.BITNET>               Computer Research Center   <>
<>Voices:   (504) 286-7067                 New Orleans, La. 70148     <>
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>