[comp.arch] Refs algorithms not requiring consistency

eugene@eos.UUCP (Eugene Miya) (12/09/89)

Since some one asked for more details, I discovered I got the year wrong.
The following is the JACM article from his PhD thesis (harder to find).

%A Gerard M. Baudet
%T Asynchronous iterative methods for multiprocessors
%J Journal of the ACM
%V 25
%N 2
%D April 1978
%P 226-244
%K Chaotic relaxation
multiprocessor applications
%K bsatya
%X Presents techniques for exploiting the parallelism of multiprocessing
systems in solving a set of equations.  An interesting feature of the
algorithms described is that they do not require synchronization among
the cooperating processes working on the problem.
Text reproduced with the permission of Prentice-Hall \(co 1980.

I found his completed thesis one day by running into Dave Stevenson.
It's just a matter to find papers on topics like this.  One way is
to use the Science Citation Index [you do know what the SCI is don't
you?] and find out who referenced Baudet and others.
There are other papers for instance:

%A D. Scott Eberhardt
%A Donald Baganoff
%T Multiple Grid Problems on Concurrent Processing Computers
%R NASA TM 86675
%D February 1986
%K Concurrent processing, parallel processing, computational fluid dynamics,
overset grids, chaotic relaxation,

is a locally written paper.  Do not ask me for any of these papers.
I am not a library service.  Learn to use a library.

Another gross generalization from

--eugene miya, NASA Ames Research Center, eugene@aurora.arc.nasa.gov
  resident cynic at the Rock of Ages Home for Retired Hackers:
  "You trust the `reply' command with all those different mailers out there?"
  "If my mail does not reach you, please accept my apology."
  {ncar,decwrl,hplabs,uunet}!ames!eugene
  		Support the Free Software Foundation (FSF)