This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiprocessor Synchronization for Concurrent Loops
January/February 1988 (vol. 5 no. 1)
pp. 34-42

Execution of concurrent loops on multiprocessor computers often requires synchronizing the processors. Synchronization schemes are surveyed that are suitable for automatic problem decomposition. The model of a shared-memory multiprocessor is used, as is the concurrent-loop paradigm, which is to compile a loop so each processor is assigned a different loop iteration. The discussion covers data dependence, removing synchronization points, random synchronization, pipelining, barrier synchronization, and critical sections.

Index Terms:
concurrent loops; multiprocessor computers; automatic problem decomposition; shared-memory multiprocessor; loop iteration; data dependence; synchronization points; random synchronization; pipelining; barrier synchronization; critical sections; multiprocessing programs; parallel programming; synchronisation
Citation:
Michael Wolfe, "Multiprocessor Synchronization for Concurrent Loops," IEEE Software, vol. 5, no. 1, pp. 34-42, Jan.-Feb. 1988, doi:10.1109/52.1992
Usage of this product signifies your acceptance of the Terms of Use.