Boosting Multi-Core Reachability Performance with Shared Hash Tables

This paper focuses on data structures for multi-core reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of an efficient solution is the storage of visited states. In related work, static partitioning of the state space was combined with thread-local storage and resulted in reasonable speedups, but left open whether improvements are possible. In this paper, we present a scaling solution for shared state storage which is based on a lockless hash table implementation. The solution is specifically designed for the cache architecture of modern CPUs. Because model checking algorithms impose loose requirements on the hash table operations, their design can be streamlined substantially compared to related work on lockless hash tables. Still, an implementation of the hash table presented here has dozens of sensitive performance parameters (bucket size, cache line size, data layout, probing sequence, etc.). We analyzed their impact and compared the resulting speedups with related tools. Our implementation outperforms two state-of-the-art multi-core model checkers (SPIN and DiVinE) by a substantial margin, while placing fewer constraints on the load balancing and search algorithms.Comment: preliminary repor

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the state-of-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.Comment: In Proceedings GaM 2015, arXiv:1504.0244

Best-first heuristic search for multicore machines

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals

Highly multimode memory in a crystal

We experimentally demonstrate the storage of 1060 temporal modes onto a thulium-doped crystal using an atomic frequency comb (AFC). The comb covers 0.93 GHz defining the storage bandwidth. As compared to previous AFC preparation methods (pulse sequences i.e. amplitude modulation), we only use frequency modulation to produce the desired optical pumping spectrum. To ensure an accurate spectrally selective optical pumping, the frequency modulated laser is self-locked on the atomic comb. Our approach is general and should be applicable to a wide range of rare-earth doped material in the context of multimode quantum memory

The Timing of Reward-Seeking Action Tracks Visually-Cued Theta Oscillations in Primary Visual Cortex

An emerging body of work challenges the view that primary visual cortex (V1) represents the visual world faithfully. Theta oscillations in the local field potential (LFP) of V1 have been found to convey temporal expectations and, specifically, to express the delay between a visual stimulus and the reward that it portends. We extend this work by showing how these oscillatory states in male, wild-type rats can even relate to the timing of a visually cued reward-seeking behavior. In particular, we show that, with training, high precision and accuracy in behavioral timing tracks the power of these oscillations and the time of action execution covaries with their duration. These LFP oscillations are also intimately related to spiking responses at the single-unit level, which themselves carry predictive timing information. Together, these observations extend our understanding of the role of cortical oscillations in timing generally and the role of V1 in the timing of visually cued behaviors specifically.Fil: Levy, Joshua M.. University Johns Hopkins; Estados UnidosFil: Zold, Camila Lidia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Fisiología y Biofísica Bernardo Houssay. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Fisiología y Biofísica Bernardo Houssay; ArgentinaFil: Namboodiri, Vijay Mohan K.. University of North Carolina; Estados UnidosFil: Hussain Shuler, Marshall G. University Johns Hopkins; Estados Unido