13,247 Hits in 2.9 sec

Multi-threaded Explicit State Space Exploration with State Reconstruction [chapter]

Sami Evangelista, Lars Michael Kristensen, Laure Petrucci
2013 Lecture Notes in Computer Science  
This article introduces a parallel state space exploration algorithm for shared memory multi-core architectures using state compression and state reconstruction to reduce memory consumption.  ...  An important feature of the algorithm is that it requires little inter-thread synchronisation making it highly scalable.  ...  The large number of states combined with the size of each state is a limiting factor for the practical use of standard explicit state space exploration.  ... 
doi:10.1007/978-3-319-02444-8_16 fatcat:weidx2alfve75mh6jv6hj2mkq4

SymDIVINE: Tool for Control-Explicit Data-Symbolic State Space Exploration [chapter]

Jan Mrázek, Petr Bauch, Henrich Lauko, Jiří Barnat
2016 Lecture Notes in Computer Science  
Internally, Sym-DIVINE extends the standard explicit-state state space exploration with SMT machinery to handle non-deterministic data values.  ...  The key differentiating aspect present in SymDIVINE is the ability to decide about equality of two symbolically represented states preventing thus repeated exploration of the state space graph.  ...  Control-Explicit Data-Symbolic Approach In the standard explicit state model checking, the state space graph of a program is explored by an exhaustive enumeration of its states.  ... 
doi:10.1007/978-3-319-32582-8_14 fatcat:q7j2iiz2r5dylevwpngpsrtffi

Multicore bundle adjustment

Changchang Wu, Sameer Agarwal, Brian Curless, Steven M. Seitz
2011 CVPR 2011  
We explore the use of multicore CPU as well as multicore GPUs for this purpose.  ...  We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene reconstruction problems.  ...  The authors would also like to acknowledge the discussions with Christopher Zach.  ... 
doi:10.1109/cvpr.2011.5995552 dblp:conf/cvpr/WuACS11 fatcat:fh63qupqfjfznpvr56js5fqqqa

Recursive Variable-Length State Compression for Multi-Core Software Model Checking [article]

Freark I. van der Berg
2021 arXiv   pre-print
We show that its performance approaches that of state-of-the-art model checkers for fixed-length states. For models with variable-length states, dtree is up to 2.9 times faster.  ...  Tests for such data structures have significantly smaller state spaces than the entire software, making it feasible to model check them.  ...  Related state space exploration tools LTSmin [6] is a model checker with multi-core [7] (up to 64 threads), distributed [8] and symbolic implementations.  ... 
arXiv:2007.12174v2 fatcat:qayl7fxp3vb2rbcdqncsuxmtie

Software Model Checking with Explicit Scheduler and Symbolic Threads

Alessandro Cimatti, Iman Narasamdya, Marco Roveri, Parosh Abdulla
2012 Logical Methods in Computer Science  
On the one side, each thread may have infinite state space, and might call for abstraction.  ...  Each thread is translated into a separate sequential program and explored symbolically with lazy abstraction, while the overall verification is orchestrated by the direct execution of the scheduler.  ...  We denote by Reach red (S 0 , T ) ⊆ S the set of states reachable from the states in S 0 by the transitions in T such that, during the state space exploration, in every visited state we only explore the  ... 
doi:10.2168/lmcs-8(2:18)2012 fatcat:2fkbgkrlyzh4blbvpia556aofq

IibDMC: a Library to Operate Efficient Distributed Model Checking

Alexandre Hamez, Fabrice Kordon, Yann Thierry-Mieg
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Performance evaluations are reported and clearly show the advantages of multi-threading to occupy processors while waiting for the network, with linear speedup over the number of processors.  ...  However it is often prohibitively expensive in time and memory complexity, due to the so-called state space explosion problem.  ...  We also intend to plug Spin into libDMC to further validate our framework genericity, and run more comparisons with existing solutions.  ... 
doi:10.1109/ipdps.2007.370647 dblp:conf/ipps/HamezKT07 fatcat:cqycyjfqdrduppb2y45bjgplru

Autonomic Power Management in Speculative Simulation Runtime Environments

Stefano Conoci, Mauro Ianni, Romolo Marotta, Alessandro Pellegrini
2020 Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation  
In this paper, we explore the issues associated with applying these techniques on speculative Time-Warp based simulation runtime environments.  ...  Literature results show that, for a wide class of multi-threaded applications, tuning both the degree of parallelism and frequency/ voltage of cores allows a more effective use of the budget, compared  ...  Subsequently, Phase 2 explores the space of configurations with P-state lower than 1 and with the number of active threads lower than 1 .  ... 
doi:10.1145/3384441.3395980 dblp:conf/pads/ConociIM020 fatcat:mqaave42gvcj7lhdv7fqsan5h4

BarrierPoint: Sampled simulation of multi-threaded applications

Trevor E. Carlson, Wim Heirman, Kenzo Van Craeynest, Lieven Eeckhout
2014 2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)  
A number of sampling techniques have recently been developed that extend wellknown single-threaded techniques to allow sampled simulation of multi-threaded applications.  ...  In this work, we propose BarrierPoint, a sampling methodology to accelerate simulation by leveraging globally synchronizing barriers in multi-threaded applications.  ...  This technique requires explicit cache state reconstruction in the simulator, is limited to single-core systems, and does not provide a way to reconstruct coherency state. Barr et al.  ... 
doi:10.1109/ispass.2014.6844456 dblp:conf/ispass/CarlsonHCE14 fatcat:kguga3khxjfbxnk56ygshkg65i

Multi GPU implementation of iterative tomographic reconstruction algorithms

Byunghyun Jang, David Kaeli, Synho Do, Homer Pien
2009 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro  
We generate these results with no perceptible difference in image quality between the GPU and serial CPU implementations.  ...  We have implemented forward and backward projection steps of reconstruction on an NVIDIA Tesla S870 hardware using CUDA.  ...  Each thread is able to be executed independently, with its own instruction address and register state, and a group of 32 threads called warps are created, managed, and scheduled by the SIMT unit.  ... 
doi:10.1109/isbi.2009.5193014 dblp:conf/isbi/JangKDP09 fatcat:3rdpac6trve25csosjjpypjuqq

Porting CMS Heterogeneous Pixel Reconstruction to Kokkos

Matti J. Kortelainen, Martin Kwok, Taylor Childers, Alexei Strelchenko, Yunsong Wang, (on behalf of the CMS Collaboration), C. Biscarat, S. Campana, B. Hegner, S. Roiser, C.I. Rovelli, G.A. Stewart
2021 EPJ Web of Conferences  
In this paper we use heterogeneous pixel reconstruction code from the CMS experiment at the CERNL LHC as a realistic use case of a GPU-targeting HEP reconstruction software, and report experience from  ...  Table 1 shows the throughput of the Kokkos version with Serial and Threads execution spaces, and of the direct CPU version with 1 and 40 threads.  ...  For the Kokkos version with Threads execution space the maximum throughput from a scan from 1 to 20 threads is reported.  ... 
doi:10.1051/epjconf/202125103034 fatcat:wspdrmb5qzgvplcssj75xtvwrq

Variable and Thread Bounding for Systematic Testing of Multithreaded Programs [article]

Sandeep Bindal, Sorav Bansal, Akash Lal
2013 arXiv   pre-print
This paper proposes two new metrics to rank thread schedules for systematic state-space exploration.  ...  Previous approaches to systematic state-space exploration for testing multi-threaded programs have proposed context-bounding and depth-bounding to be effective ranking algorithms for testing multithreaded  ...  We believe that variable and thread bounding are more general methods of ranking (or reducing) the search space. CHESS [20] uses iterative context bounding to rank schedules.  ... 
arXiv:1207.2544v2 fatcat:5a2w7x5aanfflcq6vhqpexj6lq

A Common Tracking Software Project [article]

Xiaocong Ai, Corentin Allaire, Noemi Calace, Angéla Czirkos, Irina Ene, Markus Elsing, Ralf Farkas, Louis-Guillaume Gagnon, Rocky Garg, Paul Gessinger, Hadrien Grasland, Heather M. Gray (+20 others)
2021 arXiv   pre-print
multi-threaded event processing.  ...  We present here A Common Tracking Software (ACTS) toolkit, which draws on the experience with track reconstruction algorithms in the ATLAS experiment and presents them in an experiment-independent and  ...  These tests include checks for identical results when running in single threaded and multi threaded mode.  ... 
arXiv:2106.13593v1 fatcat:apbdvwybnngsnftzt6afqyozhe

Coordination and Concurrency in Multi-engine Prolog [chapter]

Paul Tarau
2011 Lecture Notes in Computer Science  
We advocate a combination of coroutining constructs with focus on expressiveness and a simplified, multi-threading API that ensures optimal use available parallelism.  ...  In this context, native multi-threading is made available to the application programmer as a set of high-level primitives with a declarative flavor while cooperative constructs provide efficient and predictable  ...  On the other hand, the explicit use of a procedural multi-threading API breaks the declarative simplicity of the execution model of logic based languages.  ... 
doi:10.1007/978-3-642-21464-6_11 fatcat:r6n2mozlfjdcpdc3ikowq3vtzy

Parallel Meta-heuristics [chapter]

Teodor Gabriel Crainic, Michel Toulouse
2010 International Series in Operations Research and Management Science  
Once all information is shared, each thread performs its own import procedures on the received data and proceeds with its exploration of the search space until the next synchronization event.  ...  Cooperative Multi- Thread Parallel Tabu Search with an Application to Circuit Partitioning.  ... 
doi:10.1007/978-1-4419-1665-5_17 fatcat:5hhwwngx6jb6pnaugdgvenjraq

Shared Memory in the Many-Core Age [chapter]

Stefan Nürnberger, Gabor Drescher, Randolf Rotta, Jörg Nolte, Wolfgang Schröder-Preikschat
2014 Lecture Notes in Computer Science  
These elementary operations will help in exploring and evaluating new memory models and consistency protocols.  ...  With the evolution toward fast networks of many-core processors, the design assumptions at the basis of software-level distributed shared memory (DSM) systems change considerably.  ...  Newer languages with explicit support for multi-threading, such as C++11, address this issue by defining a memory model based on sequential consistency for data race free programs.  ... 
doi:10.1007/978-3-319-14313-2_30 fatcat:ah6h3rubebh4zj52w4wfnhaz2m
« Previous Showing results 1 — 15 out of 13,247 results