Probabilistic guards: A mechanism for increasing the granularity of work-stealing programs

Frigo, 1998, The implementation of the Cilk-5 multithreaded language, 212 IBM Research, X10: Performance and Productivity at Scale. http://www.x10-lang.org/. Halstead, 1990, New ideas in parallel lisp: language design, implementation, and programming tools, 2 Mohr, 1991, Lazy task creation: a technique for increasing the granularity of parallel programs, IEEE Trans. Parallel Distrib. Syst., 2, 264, 10.1109/71.86103 Hiraishi, 2009, Backtracking-based load balancing, 55 Barnes, 1986, A hierarchical O(Nlog N) force-calculation algorithm, Nature, 324, 446, 10.1038/324446a0 Yasugi, 2012, Parallel graph traversals using work-stealing frameworks for many-core platforms, J. Inf. Process., 20, 128 Intel Corporation, Intel Cilk Plus. http://www.software.intel.com/en-us/intel-cilk-plus. Frigo, 2009, Reducers and other Cilk++ hyperobjects, 79 Yoritaka, 2016, Extending a work-stealing framework with probabilistic guards, 171 J.E. Barnes, Treecode Guide, http://www.ifa.hawaii.edu/~barnes/treecode/treeguide.html. Barnes, 1990, A modified tree code: don’t laugh; it runs, J. Comput. Phys., 87, 161, 10.1016/0021-9991(90)90232-P Olivier, 2007, UTS: an unbalanced tree search benchmark, 235 Breuel, 1998, Lexical closures for C++ Feeley, 1993, A message passing implementation of lazy task creation, 94 Intel Corporation, Intel Threading Building Block Reference Manual, 2007. http://threadingbuildingblocks.org/. Taura, 1999, StackThreads/MP: integrating futures into calling standards, 60 Leiserson, 2015, Upper bounds on number of steals in rooted trees, Theory Comput. Syst., 1 Duran, 2008, An adaptive cut-off for task parallelism, 36:1 Wang, 2010, An adaptive task creation strategy for work-stealing scheduling, 266 Janjic, 2010, Granularity-aware work-stealing for computationally-uniform grids, 123