Affiliation:
1. Univ. of California, Berkeley, IBM Almaden Research Center, San Jose, CA
2. IBM Almaden Research Center, San Jose, CA
Abstract
As improvements in processor performance continue to far outpace improvements in storage performance, I/O is increasingly the bottleneck in computer systems, especially in large database systems that manage huge amoungs of data. The key to achieving good I/O performance is to thoroughly understand its characteristics. In this article we present a comprehensive analysis of the logical I/O reference behavior of the peak productiondatabase workloads from ten of the world's largest corporations. In particular, we focus on how these workloads respond to different techniques for caching, prefetching, and write buffering. Our findings include several broadly applicable rules of thumb that describe how effective the various I/O optimization techniques are for the production workloads. For instance, our results indicate that the buffer pool miss ratio tends to be related to the ratio of buffer pool size to data size by an inverse square root rule. A similar fourth root rule relates the write miss ratio and the ration of buffer pool size to data size.
In addition, we characterize the reference characteristics of workloads similar to the Transaction Processing Performance Council (TPC) benchmarks C (TPC-C) and D(TPC-D), which are
de facto
standard performance measures for online transaction processing (OLTP) systems and decision support systems (DSS), respectively. Since benchmarks such as TPC-C and TPC-D can only be used effectively if their strengths and limitations are understood, a major focus of our analysis is to identify aspects of the benchmarks that stress the system differently than the production workloads. We discover that for the most part, the reference behavior of TPC-C and TPC-D fall within the range of behavior exhibited by the production workloads. However, there are some noteworthy exceptions that affect well-known I/O optimization techniques such as caching (LRU is further from the optimal for TPC-C, while there is little sharing of pages between transactions for TPC-D), prefetching (TPC-C exhibits no significant sequentiality), and write buffering (write buffering is lees effective for the TPC benchmarks). While the two TPC benchmarks generally complement one another in reflecting the characteristics of the production workloads, there remain aspects of the real workloads that are not represented by either of the benchmarks.
Publisher
Association for Computing Machinery (ACM)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Revisiting Swapping in User-Space With Lightweight Threading;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-11
2. Rethinking TPC-C Characteristic: At Logical Write Perspective;2023 IEEE International Conference on Big Data and Smart Computing (BigComp);2023-02
3. Understanding HPC Application I/O Behavior Using System Level Statistics;2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC);2020-12
4. VM-Aware Adaptive Storage Cache Prefetching;2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom);2017-12
5. KCGS-Store: A Columnar Storage Based On Group Sorting Of Key Columns;IEEE INT CONF CLOUD;2016