The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (1988 vol. 5)
ISSN: 0740-7459
pp: 34-42
<p>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.</p>
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

M. Wolfe, "Multiprocessor Synchronization for Concurrent Loops," in IEEE Software, vol. 5, no. , pp. 34-42, 1988.
92 ms
(Ver 3.3 (11022016))