Basic HTML version of Foils prepared 21 October 1995

Foil 7 General Types of Synchronization

From New CPS615 Foils-- B 28 August 95 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Geoffrey C. Fox
1 An implied constraint on the ordering of operations.
  • In distributed memory, messages often used to synchronize.
  • In shared memory, software semaphores, hardware locks, or other schemes needed. [Denning, P. 1989]
2 Synchronous: Objects (processors, network, tasks) proceed together in lockstep fashion
3 Asynchronous: Objects may proceed at somewhat different speeds, sometimes with occasional synchronization points (barriers) to allow slower objects to catch up.
in Table To:

© on Tue Oct 7 1997