Basic HTML version of Foils prepared 15 March 1996

Foil 58 A general theory of computation

From Complex Systems and Parallel Computing CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
The particle - process analogy does not apply to
Asynchronous problems
  • Database
  • Event driven simulations
  • Phone network traffic
  • Computer chess and other AI
Loosely synchronous problems where fundamental entities move between nodes on a microscopic time scale (such problems can be called microscopically dynamic)
Example - Global sums as used in
    • DO 1 I=1, Limit 1
    • A(I) = 0
    • DO 2 J=1, Limit 2
    • 2 A(I) = A(I) + B(I,J)
Where I and J distributed over nodes of hypercube

Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998