Improving instruction cache performance in OLTP

Author:

Harizopoulos Stavros1,Ailamaki Anastassia2

Affiliation:

1. MIT CSAIL, Cambridge, MA

2. Carnegie Mellon University, Pittsburgh, PA

Abstract

Instruction-cache misses account for up to 40% of execution time in online transaction processing (OLTP) database workloads. In contrast to data cache misses, instruction misses cannot be overlapped with out-of-order execution. Chip design limitations do not allow increases in the size or associativity of instruction caches that would help reduce misses. On the contrary, the effective instruction cache size is expected to further decrease with the adoption of multicore and multithreading chip designs (multiple on-chip processor cores and multiple simultaneous threads per core). Different concurrent database threads, however, execute similar instruction sequences over their lifetime, too long to be captured and exploited in hardware. The challenge, from a software designer's point of view, is to identify and exploit common code paths across threads executing arbitrary operations, thereby eliminating extraneous instruction misses.In this article, we describe Synchronized Threads through Explicit Processor Scheduling (STEPS), a methodology and tool to increase instruction locality in database servers executing transaction processing workloads. STEPS works at two levels to increase reusability of instructions brought in the cache. At a higher level, synchronization barriers form teams of threads that execute the same system component. Within a team, STEPS schedules special fast context-switches at very fine granularity to reuse sets of instructions across team members. To find points in the code where context-switches should occur, we develop autoSTEPS , a code profiling tool that runs directly on the DBMS binary. STEPS can minimize both capacity and conflict instruction cache misses for arbitrarily long code paths.We demonstrate the effectiveness of our approach on Shore , a research prototype database system shown to be governed by similar bottlenecks as commercial systems. Using microbenchmarks on real and simulated processors, we observe that STEPS eliminates up to 96% of instruction-cache misses for each additional team thread and at the same time eliminates up to 64% of mispredicted branches by providing a repetitive execution pattern to the processor. When performing a full-system evaluation on real hardware using TPC-C, the industry-standard transactional benchmark, STEPS eliminates two-thirds of instruction-cache misses and provides up to 1.4 overall speedup.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Reference30 articles.

1. Ailamaki A. DeWitt D. J. Hill M. D. and Skounakis M. 2001a. Weaving relations for cache performance. In VLDB ‘01: Proceedings of the 27th International Conference on Very Large Data Bases. Morgan Kaufmann San Francisco CA 169--180. Ailamaki A. DeWitt D. J. Hill M. D. and Skounakis M. 2001a. Weaving relations for cache performance. In VLDB ‘01: Proceedings of the 27th International Conference on Very Large Data Bases. Morgan Kaufmann San Francisco CA 169--180.

2. Call graph prefetching for database applications

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. BriskStream;Proceedings of the 2019 International Conference on Management of Data;2019-06-25

2. Characterizing Resource Sensitivity of Database Workloads;2018 IEEE International Symposium on High Performance Computer Architecture (HPCA);2018-02

3. Characterizing OS Behaviors of Datacenter and Big Data Workloads;2016

4. STREX;ACM SIGARCH Computer Architecture News;2013-06-26

5. STREX;Proceedings of the 40th Annual International Symposium on Computer Architecture;2013-06-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3