Response time distribution of flash memory accesses

被引:6
|
作者
Harrison, Peter G. [2 ]
Patel, Naresh M. [3 ]
Zertal, Soraya [1 ]
机构
[1] Univ Versailles, PRiSM, F-78000 Versailles, France
[2] Univ London Imperial Coll Sci Technol & Med, London SW7 2AZ, England
[3] NetApp Inc, Sunnyvale, CA 94089 USA
基金
英国工程与自然科学研究理事会;
关键词
Fluid model; Flash memory; Response time distribution; Preemptive priority;
D O I
10.1016/j.peva.2009.10.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Flash memory is becoming an increasingly important storage component among nonvolatile storage devices. Its cost is decreasing dramatically and its performance continues to improve, which makes it a serious competitor for disks and a candidate for enterprise-tier storage devices of the future. Consequently, it is important to devise models and tools to analyse its behaviour and to evaluate its effects on a system's performance. We propose a Markov modulated fluid model with priority classes to investigate the response time characteristics of Flash memory accesses. This model can represent well the Flash access operation types, respecting the erase/write/read relative priorities and autocorrelations. We apply the model to estimate response time densities at the chip for an OLTP-type of workload and indicate the magnitude of the penalty suffered by writes under priority scheduling of read operations. The model is validated against a customised hardware simulator that uses input-traces typical of our Markovian workload description. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:248 / 259
页数:12
相关论文
共 50 条
  • [1] Exploring Time and Energy for Complex Accesses to a Hybrid Memory Cube
    Schmidt, Juri
    Froening, Holger
    Bruening, Ulrich
    [J]. MEMSYS 2016: PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON MEMORY SYSTEMS, 2016, : 142 - 150
  • [2] Formalizing Memory Accesses and Interrupts
    Achermann, Reto
    Humbel, Lukas
    Cock, David
    Roscoe, Timothy
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (244): : 66 - 116
  • [3] The Synchronization Power of Coalesced Memory Accesses
    Ha, Phuong Hoai
    Tsigas, Philippas
    Anshus, Otto J.
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2008, 5218 : 320 - +
  • [4] Software Prefetching for Indirect Memory Accesses
    Ainsworth, Sam
    Jones, Timothy M.
    [J]. CGO'17: PROCEEDINGS OF THE 2017 INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2017, : 305 - 317
  • [5] Informed Prefetching for Indirect Memory Accesses
    Cavus, Mustafa
    Sendag, Resit
    Yi, Joshua J.
    [J]. ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2020, 17 (01)
  • [6] Compiler analysis of irregular memory accesses
    Lin, Y
    Padua, D
    [J]. ACM SIGPLAN NOTICES, 2000, 35 (05) : 157 - 168
  • [7] SAM: Accelerating Strided Memory Accesses
    Xin, Xin
    Guo, Yanan
    Zhang, Youtao
    Yang, Jun
    [J]. PROCEEDINGS OF 54TH ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, MICRO 2021, 2021, : 324 - 336
  • [8] A B-Tree index extension to enhance response time and the life cycle of flash memory
    Roh, Hongchan
    Kim, Woo-Cheol
    Kim, Seungwoo
    Park, Sanghyun
    [J]. INFORMATION SCIENCES, 2009, 179 (18) : 3136 - 3161
  • [9] Exploring Irregular Memory Accesses on FPGAs
    Halstead, Robert J.
    Villarreal, Jason
    Najjar, Walid
    [J]. PROCEEDINGS OF THE FIRST WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHM (IAAA'11), 2011, : 31 - 34
  • [10] Optimizing memory accesses for spatial computation
    Budiu, M
    Goldstein, SC
    [J]. CGO 2003: INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2003, : 216 - 227