Can Flash Memory Help in Model Checking?

BARNAT, Jiří, Luboš BRIM, Stefan EDELKAMP, Damian SULEWSKI and Pavel ŠIMEČEK. Can Flash Memory Help in Model Checking? In Formal Methods for Industrial Critical Systems. Neuveden: Springer Berlin / Heidelberg, 2009, p. 150-165. ISBN 978-3-642-03239-4. Available from: https://dx.doi.org/10.1007/978-3-642-03240-0_14.

Basic information

Original name

Can Flash Memory Help in Model Checking?

Name in Czech

Mohou flash paměti pomoci při ověřování modelu?

Authors

BARNAT, Jiří (203 Czech Republic, guarantor, belonging to the institution), Luboš BRIM (203 Czech Republic, belonging to the institution), Stefan EDELKAMP (276 Germany), Damian SULEWSKI (276 Germany) and Pavel ŠIMEČEK (203 Czech Republic, belonging to the institution)

Edition

Neuveden, Formal Methods for Industrial Critical Systems, p. 150-165, 16 pp. 2009

Publisher

Springer Berlin / Heidelberg

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Italy

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/09:00065776

Organization unit

Faculty of Informatics

ISBN

978-3-642-03239-4

ISSN

DOI

http://dx.doi.org/10.1007/978-3-642-03240-0_14

UT WoS

000270704100010

Keywords (in Czech)

flash paměti; SSD disky; ověřování modelu

Keywords in English

Flash memory; SSD disks; Model Checking

Tags

International impact, Reviewed

---

Abstract

V originále

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.

In Czech

Technologie flash disků a pamětí se stala alternativou k pevným diskům. Tento článek zkoumá, zda algoritmy pro práci s externími mechanickými disky jsou stále dostatečně efektivní i pro práci s flash disky namísto pevných disků. V článku je definován nový model pro posuzování algoritmů pro práci s disky pro případ využití flash disků a je demonstrováno, že dedikované algoritmy pro flash disky mají svůj význam.

---

Links

GA201/06/1338, research and development project	Name: Automatizovaná verifikace softwaru Investor: Czech Science Foundation, Automated software verification
MSM0021622419, plan (intention)	Name: Vysoce paralelní a distribuované výpočetní systémy Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1ET408050503, research and development project	Name: Techniky automatické verifikace a validace softwarových a hardwarových systémů Investor: Academy of Sciences of the Czech Republic, Techniques for automatic verification and validation of software nad hardware systems