ICCS 2017 Main Track (MT) Session 12

Time and Date: 16:20 - 18:00 on 13th June 2017

Room: HG D 1.1

Chair: Manfred Trummer

490 Parallel Parity Games: a Multicore Attractor for the Zielonka Recursive Algorithm [abstract]
Abstract: Parity games are abstract infinite-duration two-player games, widely studied in computer science. Several solution algorithms have been proposed and also implemented in the community tool of choice called PGSolver, which has declared the Zielonka Recursive (ZR) algorithm the best performing on randomly generated games. With the aim of scaling and solving wider classes of parity games, several improvements and optimizations have been proposed over the existing algorithms. However, no one has yet explored the benefit of using the full computational power of which even common modern multicore processors are capable of. This is even more surprisingly by considering that most of the advanced algorithms in PGSolver are sequential. In this paper we introduce and implement, on a multicore architecture, a parallel version of the Attractor algorithm, that is the main kernel of the ZR algorithm. This choice follows our investigation that more of the 99% of the execution time of the ZR algorithm is spent in this module. We provide testing on graphs up to 20K nodes generated through PGSolver and we discuss performance analysis in terms of strong and weak scaling.
Umberto Marotta, Aniello Murano, Rossella Arcucci and Loredana Sorrentino
492 Replicated Synchronization for Imperative BSP Programs [abstract]
Abstract: The BSP model (Bulk Synchronous Parallel) simplifies the construction and evaluation of parallel algorithms, with its simplified synchronization structure and cost model. Nevertheless, imperative BSP programs can suffer from synchronization errors. Programs with textually aligned barriers are free from such errors, and this structure eases program comprehension. We propose a simplified formalization of barrier inference as data flow analysis, which verifies statically whether an imperative BSP program has replicated synchronization, which is a sufficient condition for textual barrier alignment.
Arvid Jakobsson, Frederic Dabrowski, Wadoud Bousdira, Frederic Loulergue and Gaetan Hains
496 IMCSim: Parameterized Performance Prediction for Implicit Monte Carlo Codes [abstract]
Abstract: We design an application model (IMCSim) of the implicit Monte Carlo particle code IMC using the Performance Prediction Toolkit (PPT), a discrete-event simulation-based modeling framework for predicting code performance on a large range of parallel platforms. We present validation results for IMCSim. We then use the fast parameter scanning that such a high-level loop-structure model of a complex code enables to predict optimal IMC parameter settings for interconnect latency hiding. We find that variations in interconnect bandwidth have a significant effect on optimal parameter values, thus suggesting the use of IMCSim as a pre-step to substantial IMC runs to quickly identify optimal parameter values for the specific hardware platform that IMC runs on.
Stephan Eidenbenz, Alex Long, Jason Liu, Olena Tkachenko and Robert Zerr
532 Efficient Implicit Parallel Patterns for GIS [abstract]
Abstract: With the data growth, the need to parallelize treatments become crucial in numerous domains. But for non-specialists it is still difficult to tackle parallelism technicalities as data distribution, communications or load balancing. For the geoscience domain we propose a solution based on implicit parallel patterns. These patterns are abstract models for a class of algorithms which can be customized and automatically transformed in a parallel execution. In this paper, we describe a pattern for stencil computation and a novel pattern dealing with computation following a pre-defined order. They are particularly used in geosciences and we illustrate them with the flow direction and the flow accumulation computations.
Kevin Bourgeois, Sophie Robert, Sébastien Limet and Victor Essayan
103 Taking Lessons Learned from a Proxy Application to a Full Application for SNAP and PARTISN [abstract]
Abstract: SNAP is a proxy application which simulates the computational motion of a neutral particle transport code, PARTISN. In this work, we have adapted parts of SNAP separately; we have re-implemented the iterative shell of SNAP in the task-model runtime Legion, showing an improvement to the original schedule, and we have created multiple Kokkos implementations of the computational kernel of SNAP, displaying similar performance to the native Fortran. We then translate our Kokkos experiments in SNAP to PARTISN, necessitating engineering development, regression testing, and further thought.
Geoffrey Womeldorff, Joshua Payne and Benjamin Bergen