A.: Synchronization via scheduling: techniques for efficiently managing shared state

Shared state access conflicts are one of the greatest sources of er-ror for fine grained parallelism in any domain. Notoriously hard to debug, these conflicts reduce reliability and increase develop-ment 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 im-plicit dependencies exist, the programmer often creates more de-pendencies than needed, which results in constrained graphs with large monolithic tasks and limited parallelism. We propose a new technique, Synchronization via Scheduling (SvS), that uses the results of static and dynamic code analysis to manage potential shared state conflicts by exposing the data accesses of each task to the scheduler. We present an in-depth performance analysis of SvS via examples from video games, our target domain, and show that SvS performs well in comparison to software transactional memory (TM) and fine grained mutexes