Boosting multi-core reachability performance with shared hash tables

Formal Methods in Computer Aided Design, FMCAD 2010

Volumn , Issue , 2010, Pages 247-255

  Laarman, Alfons ^a   Van De Pol, Jaco ^a   Weber, Michael ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE ARCHITECTURE; HASH TABLE; KEY COMPONENT; MODEL CHECKING ALGORITHM; MULTI CORE; MULTI-CORE MODEL; REACHABILITY; SEARCH ALGORITHMS; STATE SPACE; VERIFICATION METHOD;

ALGORITHMS; COMPUTER AIDED DESIGN; DATA STRUCTURES; FORMAL METHODS; MATHEMATICAL MODELS; PROGRAM PROCESSORS;

MODEL CHECKING;

EID: 79951804554     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Jiří Barnat, Luboš Brim, and P. Ročkai. Scalable multi-core LTL model-checking. In Model Checking Software, volume 4595 of LNCS, pages 187-203. Springer, 2007.
2. Jiří Barnat, Luboš Brim, and Petr Ročkai. DiVinE 2.0: High-Performance Model Checking. In 2009 International Workshop on High Performance Computational Systems Biology (HiBi 2009), pages 31-32. IEEE Computer Society Press, 2009.
3. Jiří Barnat and Petr Ročkai. Shared hash tables in parallel model checking. Electronic Notes in Theoretical Computer Science, 198(1):79 - 91, 2008. Proceedings of the 6th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2007). (Pubitemid 351749440)
4. Stefan Blom, Bert Lisser, Jaco van de Pol, and Michael Weber. A database approach to distributed state space generation. Electron. Notes Theor. Comput. Sci., 198(1):17-32, 2008. (Pubitemid 351749436)
5. Stefan Blom, Jaco van de Pol, and Michael Weber. LTSmin: Distributed and symbolic reachability. In Proceedings of CAV 2010, LNCS. Springer, 2010. (accepted for publication).
6. Luboš Brim. Distributed verification: Exploring the power of raw computing power. In Luboš Brim, Boudewijn Haverkort, Martin Leucker, and Jaco van de Pol, editors, Formal Methods: Applications and Technology, volume 4346 of LNCS, pages 23-34. Springer, August 2006.
7. Cliff Click. A lock-free hash table. Talk at JavaOne 2007, http://www.azulsystems.com/events/javaone-2007/2007-LockFreeHash.pdf, 2007.
8. Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Terminator: Beyond safety. In Proceedings of CAV 2006, pages 415-418, 2006. (Pubitemid 44560894)
9. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3 edition, September 2009.
10. Maurice Herlihy and Nir Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, March 2008.
11. Maurice Herlihy, Nir Shavit, and Moran Tzafrir. Hopscotch hashing. Distributed Computing, pages 350-364, 2008.
12. Gerard J. Holzmann. A stack-slicing algorithm for multi-core model checking. Electronic Notes in Theoretical Computer Science, 198(1):3 - 16, 2008. Proceedings of the 6th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2007). (Pubitemid 351749435)
13. Gerard J. Holzmann and Dragan Bošnacki. The design of a multicore extension of the SPIN model checker. IEEE Trans. Softw. Eng., 33(10):659-674, 2007. (Pubitemid 47455978)
14. Cornelia P. Inggs and Howard Barringer. Effective state exploration for model checking on a shared memory architecture. Electr. Notes Theor. Comput. Sci., 68(4), 2002.
15. Alfons Laarman, Jaco van de Pol, and Michael Weber. Boosting Multi-Core Reachability Performance with Shared Hash Tables. ArXiv e-prints, 1004.2772, April 2010.
16. Witold Litwin. Linear hashing: a new tool for file and table addressing. In VLDB '1980: Proceedings of the sixth international conference on Very Large Data Bases, pages 212-223. VLDB Endowment, 1980.
17. Michael Monagan and Roman Pearce. Parallel sparse polynomial multiplication using heaps. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 263-270, New York, NY, USA, 2009. ACM.
18. Radek Pelánek. BEEM: Benchmarks for explicit model checkers. In Proc. of SPIN Workshop, volume 4595 of LNCS, pages 263-267. Springer, 2007.
19. Chris Purcell and Tim Harris. Non-blocking hashtables with open addressing. Distributed Computing, pages 108-121, 2005.
20. Nageshwara V. Rao and Vipin Kumar. Superlinear speedup in parallel state-space search. Foundations of Software Technology and Theoretical Computer Science, pages 161-174, 1988.
21. Peter Sanders. Lastverteilungsalgorithmen fur parallele tiefensuche. number 463. In in Fortschrittsberichte, Reihe 10. VDI. Verlag, 1997.
22. Michael Weber. An embeddable virtual machine for state space generation. In D. Bosnacki and S. Edelkamp, editors, Proceedings of the 14th International SPIN Workshop, volume 2595 of Lecture Notes in Computer Science, pages 168-186, Berlin, 2007. Springer Verlag.