Storage: Optimizing For Performance

最新推荐文章于 2023-09-19 13:11:40 发布
原创 最新推荐文章于 2023-09-19 13:11:40 发布 · 2k 阅读 · 4 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文深入探讨了优化存储性能的关键方向，并详细分析了文件系统、emmc性能及其工作状态对性能的影响。重点阐述了TLC eMMC在不同工作状态下的性能差异，通过iozone和bonnie++工具的测试数据展示了性能变化的惊人差异。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

1、优化存储性能需关注的地方、或者说优化的方向！


2、为什么关注文件系统？

同样的硬件环境，不同的文件系统表现的write performance差异很大。


三、为什么关注emmc本身性能？

 不同emmc使用不同的nand制造工艺（slc，mlc，tlc）
 不同emmc不同的controller
 不同emmc 支持不同的standard （4.5 、 5.0 等）
 等等
 ===========》导致不同厂家的、不同型号emmc性能差异非常之大！！！



emmc cache On/Off  ，performance性能差异之大！！！



 discard /erase/ trim /santinize , performance的影响！！！

参考另一篇文章，需进一步研究！


四、mmc使用tlc nand制造工艺的性能分析：

三星16G TLC emmc 为了延长使用寿命、提升write performance ，emmc controller可能将emmc运行在TLC nand 、SLC ==》TLC 切换、

SLC nand状态 （剩余空间充足的情况下） 三种状态。

如下图：



这三种工作状态对应的的write performance 差异也是惊人的！！！，如下图：



从上图可以看出同一颗TLC emmc 运行在不同状态时，性能差异是非常大的。

iozone  对TLC emmc 好和坏情况的性能对比数据如下：

iozone -a -s 2G -+n -i 0 -i 1 -f /data/iozone.tmp -Rb /storage/sdcard0/iozone.xls 


Writer Report
48163264128256512102420484096819216384
209715255143556225431854598541035478955101547765517455334556665578455975
Reader Report
48163264128256512102420484096819216384
2097152139094133405125010119449121387116444113972120090120404121261116745115610120769

Writer Report
48163264128256512102420484096819216384
209715212557243172339324727238922247421438203231914918441187531687216983
Reader Report
48163264128256512102420484096819216384
209715210619110046792003106630105283105421997298628691746971181010329310784510

bonnie++对TLC emmc 好和坏情况的性能对比数据如下：

bonnie++-d /data/ -s 1024 -m S3 -u 0:0


Version 1.03e       ------Sequential Output------ --Sequential Input- --Random-
                    -Per Chr- --Block-- -Rewrite- -Per Chr- --Block-- --Seeks--
Machine        Size K/sec %CP K/sec %CP K/sec %CP K/sec %CP K/sec %CP  /sec %CP
S3            4048M  6405  98 51895  41 36630  26  5870  99147249  65  4295  21
                    ------Sequential Create------ --------Random Create--------
                    -Create-- --Read--- -Delete-- -Create-- --Read--- -Delete--
              files  /sec %CP  /sec %CP  /sec %CP  /sec %CP  /sec %CP  /sec %CP
                 16   997 100 +++++ +++ 14394 112  1050 100 +++++ +++  3820 102
S3,4048M,6405,98,51895,41,36630,26,5870,99,147249,65,4295.0,21,16,997,100,+++++,+++,14394,112,1050,100,+++++,+++,3820,102



Version 1.03e       ------Sequential Output------ --Sequential Input- --Random-
                    -Per Chr- --Block-- -Rewrite- -Per Chr- --Block-- --Seeks--
Machine        Size K/sec %CP K/sec %CP K/sec %CP K/sec %CP K/sec %CP  /sec %CP
S3            4048M  4779  78 16461  12 10285   6  5785  99140367  71  3790  19
                    ------Sequential Create------ --------Random Create--------
                    -Create-- --Read--- -Delete-- -Create-- --Read--- -Delete--
              files  /sec %CP  /sec %CP  /sec %CP  /sec %CP  /sec %CP  /sec %CP
                 16   968 100 +++++ +++ 16455   0  1010 107 +++++ +++  3790 101
S3,4048M,4779,78,16461,12,10285,6,5785,99,140367,71,3789.6,19,16,968,100,+++++,+++,16455,0,1010,107,+++++,+++,3790,101


但是三星32G TLC emmc 根据实测没有这种performance变化的现象？


参考：

Linux on eMMC: Optimizing For Performance.pdf

[元带你学: 协议 26] Cache On, 写入缓存是怎么助力 eMMC 提速的？
串起点滴
07-22 906
　 1. 什么是Cache On？ 　　 1.1 Cache ON 有什么效果？ 　　 1.2 Cache ON 有什么弊端吗？ 　　 1.3 怎么打开Cache？ 　　 1.4 Cache ON 的使用限制 　 2. Flush Cache 　　 2.1 怎么Flush Cache? 　　 2.2 缓存数据何时会丢失？ 　　 2.3 缓存数据何时会删除 　　 2.4 缓存设置何时会失效 　　 2.5 Cache 上数据顺序会打乱吗？ 　 3. Cache 实践
[万字] 调试工具 | 性能测试工具 MMC -utils | DD test | FIO test | IOZone test| Kernal mmc test 实战
热门推荐
串起点滴
08-05 106万+
linux 和 Android emmc 性能测试主要有 4 种工具: DD FIO IOZone Keneral mmc_test
TensorFlow 性能优化之 Performance Guide
黑暗星球
06-22 6803
Performance Guide 本篇主要讲述：优化 TensorFlow 代码的一些方法。本篇将分为以下几部分来讲： 通用的一些优化技术 over 不同类型模型及硬件 针对 GPU 的一些优化技术 针对 CPU 的一些优化技术 1. 通用的一些优化技术 这一部分主要讲述一些通用技术（可以用于不同类型的模型 及 硬件）。这些技术将被拆分为以下几部分： 输入管道优化（Input p...
内存，RAM，ROM，Cache的区别与联系
一只青木呀
09-26 2万+
这里写目录标题1、内存2、RAM3、ROM4、Cache5、RAM和ROM的区别6、硬盘与内存的区别与联系 1、内存 内存在电脑中起着举足轻重的作用。内存一般采用半导体存储单元，包括随机存储器（RAM），只读存储器（ROM），以及高速缓存（CACHE）。 2、RAM RAM：随机存取存储器（random access memory），又称作“随机存储器”，是与CPU直接交换数据的内部存储器，也叫主存(内存)。可以随时读写，而且速度很快，通常作为操作系统或其他正在运行中的程序的临时数据存储媒介。当电源关闭时R
eMMC:Cache简介-0
忠s
11-16 4196
简简单单介绍Cache。
Best Practices for Elasticsearch Data Modeling: Optimizing Search Performance and Relevance
# Elasticsearch Data Modeling Best Practices: Optimizing Search Performance and Relevance ## 1. Overview of Elasticsearch Data Modeling Elasticsearch data modeling refers to the method of designing ...
MATLAB Uninstallation and System Performance: Optimizing System Performance and Enhancing System ...
# The Necessity of Uninstalling MATLAB and Optimizing System Performance MATLAB is a powerful technical computing software, but it can also consume a large amount of system resources. When MATLAB is ...
Installing and Optimizing Performance of NumPy: Optimizing Post-installation Performance of NumPy
NumPy, short for Numerical Python, is a Python library used for scientific computing. It offers a powerful N-dimensional array object, along with efficient functions for array operations. NumPy is ...
MATLAB Path and Parallel Computing: Optimizing Path Settings, Enhancing Parallel Code Performance, ...
# MATLAB Path Management and Parallel Computing: Optimizing Path Settings, Enhancing Parallel Code Performance, and Saying Goodbye to Low Parallel Computing Efficiency ## 1. The Basics of MATLAB Path...
MATLAB Performance Benchmark for Reading MAT Files: Comparing Different Methods and Optimizing ...
# Performance Benchmarking of MATLAB Reading MAT Files: Comparing Different Methods and Optimizing Performance ## 1. Overview of MATLAB Reading MAT Files A MAT file in MATLAB is a binary format used...
[Linux英文原版图书系列].PRENTICE_HALL-Optimizing_Linux_Performance_A_Hands_On_Guide_To_Linux_Performance_Tools.chm
06-12
[Linux英文原版图书系列].PRENTICE_HALL-Optimizing_Linux_Performance_A_Hands_On_Guide_To_Linux_Performance_Tools.chm
Linux_on_eMMC-_Optimizing_For_Performance
06-09
Linux_on_eMMC-_Optimizing_For_Performance
Linux性能监控和调优.pdf
05-25
Linux性能监控和调优.pdf
【x3m】EMMC稳定性测试
ldinvicible的专栏
09-19 1656
高温：45°、低温：-10°、常温下，程序正常执行，不会出现重启挂死的情况。Read上限：172.8MB/s、Write上限：35MB/s。常温环境下，程序正常执行，不会出现重启挂死等异常。统计实际测试读写速度是否符合性能指标。对EMMC文件系统读写速度进行测试。对EMMC进行文件系统读写测试。脚本对EMMC文件系统读写测试。
linux下emmc检测工具,emmc 调试
weixin_28724319的博客
05-07 6159
一、/dev/blockroot@:/dev/block #lsbootdevicemmcblk0mmcblk0p1mmcblk0p10…….mmcblk0p18mmcblk0p19mmcblk0p2mmcblk0p20……mmcblk0p29mmcblk0p3mmcblk0p30……mmcblk0rpmbplatformLK获取分区信息smem_ptable_init()从SMEM的entry ...
探秘Linux块设备驱动程序：成为内核开发大师的第一步
探索C++编程的奥秘，分享深入的技术见解和实践，旨在激发读者创造力与解决问题的思维。
04-22 1915
探秘Linux块设备驱动程序：成为内核开发大师的第一步
4. 内核解压-cache_on
ldl617的专栏
09-26 479
内核解压开启cache
eMMC基本架构
u010783226的专栏
09-13 2045
emmc
[eMMC]eMMC读写性能测试
anxuan3201的博客
06-12 5222
读写速率(dd) https://www.shellhacks.com/disk-speed-test-read-write-hdd-ssd-perfomance-linux/ eMMC健康情况(mmc_utils) https://superuser.com/questions/1181300/check-health-of-emmc 转载于:https://w...
Chapter 4: Processor Architecture. This chapter covers basic combinational and sequential logic elements, and then shows how these elements can be combined in a datapath that executes a simplified subset of the x86-64 instruction set called “Y86-64.” We begin with the design of a single-cycle datapath. This design is conceptually very simple, but it would not be very fast. We then introduce pipelining, where the different steps required to process an instruction are implemented as separate stages. At any given time, each stage can work on a different instruction. Our five-stage processor pipeline is much more realistic. The control logic for the processor designs is described using a simple hardware description language called HCL. Hardware designs written in HCL can be compiled and linked into simulators provided with the textbook, and they can be used to generate Verilog descriptions suitable for synthesis into working hardware. Chapter 5: Optimizing Program Performance. This chapter introduces a number of techniques for improving code performance, with the idea being that programmers learn to write their C code in such a way that a compiler can then generate efficient machine code. We start with transformations that reduce the work to be done by a program and hence should be standard practice when writing any program for any machine. We then progress to transformations that enhance the degree of instruction-level parallelism in the generated machine code, thereby improving their performance on modern “superscalar” processors. To motivate these transformations, we introduce a simple operational model of how modern out-of-order processors work, and show how to measure the potential performance of a program in terms of the critical paths through a graphical representation of a program. You will be surprised how much you can speed up a program by simple transformations of the C code. Bryant & O’Hallaron fourth pages 2015/1/28 12:22 p. xxiii (front) Windfall Software, PCA ZzTEX 16.2 xxiv Preface Chapter 6: The Memory Hierarchy. The memory system is one of the most visible parts of a computer system to application programmers. To this point, you have relied on a conceptual model of the memory system as a linear array with uniform access times. In practice, a memory system is a hierarchy of storage devices with different capacities, costs, and access times. We cover the different types of RAM and ROM memories and the geometry and organization of magnetic-disk and solid state drives. We describe how these storage devices are arranged in a hierarchy. We show how this hierarchy is made possible by locality of reference. We make these ideas concrete by introducing a unique view of a memory system as a “memory mountain” with ridges of temporal locality and slopes of spatial locality. Finally, we show you how to improve the performance of application programs by improving their temporal and spatial locality. Chapter 7: Linking. This chapter covers both static and dynamic linking, including the ideas of relocatable and executable object files, symbol resolution, relocation, static libraries, shared object libraries, position-independent code, and library interpositioning. Linking is not covered in most systems texts, but we cover it for two reasons. First, some of the most confusing errors that programmers can encounter are related to glitches during linking, especially for large software packages. Second, the object files produced by linkers are tied to concepts such as loading, virtual memory, and memory mapping. Chapter 8: Exceptional Control Flow. In this part of the presentation, we step beyond the single-program model by introducing the general concept of exceptional control flow (i.e., changes in control flow that are outside the normal branches and procedure calls). We cover examples of exceptional control flow that exist at all levels of the system, from low-level hardware exceptions and interrupts, to context switches between concurrent processes, to abrupt changes in control flow caused by the receipt of Linux signals, to the nonlocal jumps in C that break the stack discipline. This is the part of the book where we introduce the fundamental idea of a process, an abstraction of an executing program. You will learn how processes work and how they can be created and manipulated from application programs. We show how application programmers can make use of multiple processes via Linux system calls. When you finish this chapter, you will be able to write a simple Linux shell with job control. It is also your first introduction to the nondeterministic behavior that arises with concurrent program execution. Chapter 9: Virtual Memory. Our presentation of the virtual memory system seeks to give some understanding of how it works and its characteristics. We want you to know how it is that the different simultaneous processes can each use an identical range of addresses, sharing some pages but having individual copies of others. We also cover issues involved in managing and manipulating virtual memory. In particular, we cover the operation of storage allocators such as the standard-library malloc and free operations. CovBryant & O’Hallaron fourth pages 2015/1/28 12:22 p. xxiv (front) Windfall Software, PCA ZzTEX 16.2 Preface xxv ering this material serves several purposes. It reinforces the concept that the virtual memory space is just an array of bytes that the program can subdivide into different storage units. It helps you understand the effects of programs containing memory referencing errors such as storage leaks and invalid pointer references. Finally, many application programmers write their own storage allocators optimized toward the needs and characteristics of the application. This chapter, more than any other, demonstrates the benefit of covering both the hardware and the software aspects of computer systems in a unified way. Traditional computer architecture and operating systems texts present only part of the virtual memory story. Chapter 10: System-Level I/O. We cover the basic concepts of Unix I/O such as files and descriptors. We describe how files are shared, how I/O redirection works, and how to access file metadata. We also develop a robust buffered I/O package that deals correctly with a curious behavior known as short counts, where the library function reads only part of the input data. We cover the C standard I/O library and its relationship to Linux I/O, focusing on limitations of standard I/O that make it unsuitable for network programming. In general, the topics covered in this chapter are building blocks for the next two chapters on network and concurrent programming. Chapter 11: Network Programming. Networks are interesting I/O devices to program, tying together many of the ideas that we study earlier in the text, such as processes, signals, byte ordering, memory mapping, and dynamic storage allocation. Network programs also provide a compelling context for concurrency, which is the topic of the next chapter. This chapter is a thin slice through network programming that gets you to the point where you can write a simple Web server. We cover the client-server model that underlies all network applications. We present a programmer’s view of the Internet and show how to write Internet clients and servers using the sockets interface. Finally, we introduce HTTP and develop a simple iterative Web server. Chapter 12: Concurrent Programming. This chapter introduces concurrent programming using Internet server design as the running motivational example. We compare and contrast the three basic mechanisms for writing concurrent programs—processes, I/O multiplexing, and threads—and show how to use them to build concurrent Internet servers. We cover basic principles of synchronization using P and V semaphore operations, thread safety and reentrancy, race conditions, and deadlocks. Writing concurrent code is essential for most server applications. We also describe the use of thread-level programming to express parallelism in an application program, enabling faster execution on multi-core processors. Getting all of the cores working on a single computational problem requires a careful coordination of the concurrent threads, both for correctness and to achieve high performance翻译以上英文为中文
最新发布
08-05
嗯，用户这次的需求很明确：翻译一段关于计算机系统架构的英文章节内容，特别强调技术文档的格式规范。用户提供了详细的排版要求（LaTeX数学表达式格式、引用标注等），还附带了两个站内引用作为背景参考。...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值