Abstract

High-frequency trading (HFT) has always been welcomed because it benefits not only personal benefits but also the whole social welfare. While the recent advance of portfolio selection in HFT market enables to bring about more profit, it yields much contended OLTP workloads. Featuring exploiting the abundant parallelism, transaction pipeline, the state-of-the-art concurrency control (CC) mechanism, however, suffers from limited concurrency confronted with HFT workloads. Its variants that enable more parallel execution by leveraging fine-grained contention information also take little effect. To solve this problem, we for the first time observe and formulate the source of restricted concurrency as harmful ordering of transaction statements. To resolve harmful ordering, we propose PARE, a pipeline-aware reordered execution, to improve application performance by rearranging statements in order of their degrees of contention. In concrete, two mechanisms are devised to ensure the correctness of statement rearrangement and identify the degrees of contention of statements, respectively. We also study the off-line reordering problem. We prove that this problem is NP-hard and present an off-line reordering approach to approximate the optimal reordering strategy. Experiment results show that PARE can improve transaction throughput and reduce transaction latency on HFT applications by up to an order of magnitude than the state-of-the-art CC mechanism.

Highlights

  • The ever-increasing CPU core counts and memory volume are witnessing a renaissance of concurrency control (CC) mechanisms in exploiting the abundant parallelism [24]

  • We prove that this problem is NP-hard and present an off-line reordering approach to approximate the optimal reordering strategy

  • When transaction requests are available in advance, we propose an off-line reordering approach to optimize the scheduling of transactions

Read more

Summary

Introduction

The ever-increasing CPU core counts and memory volume are witnessing a renaissance of concurrency control (CC) mechanisms in exploiting the abundant parallelism [24]. Transaction pipeline, the state-of-the-art CC mechanism, takes advantage over prior CC mechanisms, including twophase locking (2PL), optimistic concurrency control (OCC) and multi-version concurrency control (MVCC), by allowing more parallel execution among conflicting operations [16, 36]. It suffers from long-time delays confronted with high-frequency trading (HFT) applications. We observe and formulate harmful ordering of statements in transaction code and propose to eliminate harmful ordering by rearranging statements in decreasing order of the degree of contention To this end, we devise two mechanisms. We show the importance of reordering transaction execution for the state-of-the-art CC mechanism transaction pipeline under HFT applications. We conduct experiments to demonstrate the effectiveness and practicality of PARE

Transaction Pipeline
Related Works
Reordering Strategy
Reordering Block Extraction
Contention Estimation
Problem Formulation
GA-Based Approach
SA-Based Approach
Experimental Setting
Performance Comparison
Detailed Performance
Findings
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.