Measuring and Evaluating Parallel State-Space Exploration Algorithms
نویسندگان
چکیده
منابع مشابه
Measuring and Evaluating Parallel State-Space Exploration Algorithms
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. This poses several challenges that so far have not been addressed in the literature: what exactly are those overheads, how can and cannot they be measured, and how should system models be selected in order to expose the c...
متن کاملParallel State Space Searching Algorithms
As a pedagogical exercise in parallel programming and scientific computing, we looked at the problem of state space searching. We focused on the standard example problem, the 15-puzzle, and developed original C++ code which quickly and efficiently finds solutions to the puzzle on a parallel machine, using two different algorithms. In this paper, we summarize the theory behind our two parallel i...
متن کاملA Parallel Algorithm for the State Space Exploration
Model checking has long been used as a means of verification of formal specifications. This is a verification technique of dynamic systems that explores all possible states of the system. It determines whether the given system satisfies its specification. This technique suffers from the state explosion problem when traversing all possible states of systems. Parallel and/or distributed approache...
متن کاملParallel Shared-Memory State-Space Exploration in Stochastic Modeling
Stochastic modeling forms the basis for analysis in many areas including biological and economic systems as well as the per formance and reliability modeling of computers and communication net works One common approach is the state space based technique which starting from a high level model uses depth rst search to generate both a description of every possible state of the model and the dynami...
متن کاملMeasuring Exploration Coverage and Evaluating Refinding Mechanisms
I discuss the issues of measuring exploration coverage to evaluate exploratory interaction techniques. I also discuss the ‘refinding’ problem in visual data exploration and how refinding techniques can be evaluated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.10.020