Can Flash Memory Help in Model Checking?

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BARNAT Jiří BRIM Luboš EDELKAMP Stefan SULEWSKI Damian ŠIMEČEK Pavel

Year of publication 2009
Type Article in Proceedings
Conference Formal Methods for Industrial Critical Systems
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1007/978-3-642-03240-0_14
Doi http://dx.doi.org/10.1007/978-3-642-03240-0_14
Field Informatics
Keywords Flash memory; SSD disks; Model Checking
Description As flash media become common and their capacities and speed grow, they are becoming a practical alternative for standard mechanical drives. So far, external memory model checking algorithms have been optimized for mechanical hard disks corresponding to the model of Aggarwal and Vitter. Since flash memories are essentially different, the model of Aggarwal and Vitter no longer describes their typical behavior. On such a different device, algorithms can have different complexity, which may lead to the design of completely new flash-memory-efficient algorithms. We provide a model for computation of I/O complexity on the model of Aggarwal and Vitter modified for flash memories. We discuss verification algorithms optimized for this model and compare the performance of these algorithms with approaches known from I/O efficient model checking on mechanical hard disks. We also give an answer, when the usage of flash devices pays off and whether their further evolution in speed and capacity could broaden a range, where new algorithms outperform the old ones.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.