Title :
Parallel Exploration of State Space with Reduced Cross Transitions Partitioning
Author :
Jimenez Serrano, Eleazar
Author_Institution :
Dept. of Automotive Sci., Kyushu Univ., Fukuoka, Japan
Abstract :
We propose a method for conducting parallel state space exploration using grid computing. It is based on a partitioning method for a configuration of multiple hash tables with proven efficiency in reducing the number of address collisions and the amount of required memory. This paper presents the initial results of simulating the method, showing that for specific state spaces, it might be advantageous in reducing cross transitions and consequently reducing exploration time.
Keywords :
file organisation; grid computing; parallel processing; state-space methods; address collisions reduction; cross transitions partitioning reduction; exploration time reduction; grid computing; multiple hash tables configuration; parallel state space exploration; partitioning method; required memory reduction; Computational modeling; Grid computing; Memory management; Parallel processing; Proposals; Space exploration; Vectors; Distributed-memory; Grid computing; Hash tables; Parallel programming; Partitioning algorithm; State space;
Conference_Titel :
Computer Sciences and Applications (CSA), 2013 International Conference on
Conference_Location :
Wuhan
DOI :
10.1109/CSA.2013.108
