IEEE Transactions on Software Engineering · 1987 · 132 citations · 13 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingConcurrency ControlData SynchronizationParallel Computing SystemsShared-memory MultiprocessingShared-memory ParallelismSynchronization PrimitivesData Dependence AnalysisDependence AnalysisDependence CheckingMultiprocessor SynchronizationParallel Program SynchronizationSynchronizationSynchronization In Parallel ComputationSynchronization Mechanisms
Enforcement of data dependence in parallel algorithms requires certain synchronization primitives. For simple data dependence, synchronization primitives like Full/Empty bit in HEP machine [5] can be very effective. However, if data dependence cannot be determined at compile time, or if very complicated, more efficient synchronization schemes and algorithms are needed.
13
Optimizing supercompilers for supercomputers
Michael Wolfe · 2020 · 840 citations
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
Gottlieb, Grishman, Kruskal et al. · IEEE Transactions on Computers · 1983 · 746 citations
Dependence graphs and compiler optimizations
David J. Kuck, Robert H. Kuhn, David Padua et al. · 1981 · 652 citations · Full text