2011 · 20 citations · 13 references
ComputingComputer EngineeringComputer ScienceCompilersParallel ComputingSchedulingConcurrency AnalysisConcurrent ProgrammingCpu SchedulingData SynchronizationTask ParallelismData Race AnalysisDynamic Code AnalysisIntertask DependenciesSynchronization MechanismsTask Graph AnalysisTask Graph ModelsTask SynchronizationTransactional Memory
Shared state access conflicts are one of the greatest sources of error for fine grained parallelism in any domain. Notoriously hard to debug, these conflicts reduce reliability and increase development time. The standard task graph model dictates that tasks with potential conflicting accesses to shared state must be linked by a dependency, even if there is no explicit logical ordering on their execution. In cases where it is difficult to understand if such implicit dependencies exist, the programmer often creates more dependencies than needed, which results in constrained graphs with large monolithic tasks and limited parallelism.
13
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh et al. · 2008 · 3.4K citations
Nir Shavit, Dan Touitou · 1995 · 1.2K citations · Full text
Program Analysis and Specialization for the C Programming Language
Lars Ole Andersen, Peter Lee · 2005 · 920 citations