TY - GEN
T1 - Reordering transaction execution to boost high frequency trading applications
AU - Zhou, Ningnan
AU - Zhou, Xuan
AU - Zhang, Xiao
AU - Du, Xiaoyong
AU - Wang, Shan
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - High frequency trading (HFT) has always been welcomed because it benefits not only personal interests but also the whole social welfare. While the recent advance of portfolio selection in HFT market generates more profit, it yields much contended OLTP workloads. Featuring in 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 find-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. Experiment results show that PARE can improve transaction throughput and reduce transaction latency on HFT applications by upto an order of magnitude than the state-of-the-art CC mechanism.
AB - High frequency trading (HFT) has always been welcomed because it benefits not only personal interests but also the whole social welfare. While the recent advance of portfolio selection in HFT market generates more profit, it yields much contended OLTP workloads. Featuring in 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 find-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. Experiment results show that PARE can improve transaction throughput and reduce transaction latency on HFT applications by upto an order of magnitude than the state-of-the-art CC mechanism.
UR - https://www.scopus.com/pages/publications/85028457759
U2 - 10.1007/978-3-319-63564-4_14
DO - 10.1007/978-3-319-63564-4_14
M3 - 会议稿件
AN - SCOPUS:85028457759
SN - 9783319635637
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 169
EP - 184
BT - Web and Big Data - 1st International Joint Conference, APWeb-WAIM 2017, Proceedings
A2 - Jensen, Christian S.
A2 - Lian, Xiang
A2 - Chen, Lei
A2 - Shahabi, Cyrus
A2 - Yang, Xiaochun
PB - Springer Verlag
T2 - 1st Asia-Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2017
Y2 - 7 July 2017 through 9 July 2017
ER -