1995 · 163 citations · 34 references
ComputingComputer EngineeringComputer ScienceCompilersComputer ArchitectureParallel ComputingData ParallelismMultiprocessor SystemsParallel Computing SystemsParallel Data StructuresShared-memory MultiprocessingShared-memory ParallelismCompile-time OptimizationCompiler DesignData Dependence AnalysisFalse SharingParallel Program DesignShared Memory MultiprocessorsShared-memory AlgorithmsShared-memory Data Structures
We have developed compiler algorithms that analyze explicitly parallel programs and restructure their shared data to reduce the number of false sharing misses. The algorithms analyze per-process shared data accesses, pinpoint the data structures that are susceptible to false sharing and choose an appropriate transformation to reduce it. The transformations either group data that is accessed by the same processor or separate individual data items that are shared.
34
A data locality optimizing algorithm
Michael E. Wolf, Monica S. Lam · 1991 · 1.3K citations · Full text
The Stanford Dash multiprocessor
Daniel Lenoski, James Laudon, Kourosh Gharachorloo et al. · Computer · 1992 · 972 citations
Jaswinder Singh, Wolf-Dietrich Weber, Anoop Gupta · ACM SIGARCH Computer Architecture News · 1992 · 927 citations · Full text
The Stanford FLASH multiprocessor
Jeffrey S. Kuskin, David Ofelt, Mark Heinrich et al. · International Symposium on Computer Architecture · 1994 · 670 citations