TY  - UNPD
A1  - Kovács, Annamária
A1  - Meyer, Ulrich
A1  - Moruz, Gabriel
A1  - Negoescu, Andrei Laurian
T1  - Online paging for flash memory devices
T2  - Frankfurter Informatik-Berichte ; [Nr. 09,2]
N2  - We propose a variation of online paging in two-level memory systems where pages in the fast cache get modified and therefore have to be explicitly written back to the slow memory upon evictions. For increased performance, up to alpha arbitrary pages can be moved from the cache to the slow memory within a single joint eviction, whereas fetching pages from the slow memory is still performed on a one-by-one basis. The main objective in this new alpha-paging scenario is to bound the number of evictions. After providing experimental evidence that alpha-paging can adequately model flash-memory devices in the context of translation layers we turn to the theoretical connections between alpha-paging and standard paging. We give lower bounds for deterministic and randomized alpha-paging algorithms. For deterministic algorithms, we show that an adaptation of LRU is strongly competitive, while for the randomized case we show that by adapting the classical Mark algorithm we get an algorithm with a competitive ratio larger than the lower bound by a multiplicative factor of approximately 1.7.
T3  - Frankfurter Informatik-Berichte - 09,2 
KW  - Algorithmus
KW  - Seitenersetzungsstrategie
KW  - Paging Algorithms
KW  - Flash Memories
KW  - Online Algorithms
Y1  - 2009
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/7090
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-71163
SN  - 1868-8330
N1  - Partially supported by the DFG grant ME 3250/1-1, and MADALGO
ER  -