Exploiting Concurrency in Domain-Specific Data Structures: A Concurrent Order Book and Workload Generator for Online Trading

详细信息    查看全文

• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9944
• 期：1
• 页码：16-31
• 全文大小：611 KB
• 参考文献：1.Ende, B., Uhle, T., Weber, M.C.: The impact of a millisecond: measuring latency effects in securities trading. In: Wirtschaftsinformatik Proceedings, Paper 116 (2011)
  2.WIRED: Raging bulls: how wall street got addicted to light-speed trading (2012). http://​www.​wired.​com/​2012/​08/​ff_​wallstreet_​trading/​2/​
  3.Leber, C., Geib, B., Litz, H.: High frequency trading acceleration using FPGAs. In: International Conference on Field Programmable Logic and Applications, FPL (2011)
  4.Preis, T.: Ökonophysik - Die Physik des Finanzmarktes. Springer, Wiesbaden (2011)CrossRef
  5.Maslov, S.: Simple model of a limit order-driven market. Phys. A Stat. Mech. Appl. 278(3), 571–578 (2000)CrossRef
  6.Maslov, S., Mills, M.: Price fluctuations from the order book perspective - empirical facts and a simple model. Phys. A Stat. Mech. Appl. 299(1), 234–246 (2001)CrossRef MATH
  7.Lea, D.: Concurrent Programming in Java: Design Principles and Patterns. Addison-Wesley, Boston (1996)MATH
  8.Bartolozzi, M.: Price variations in a stock market with many agents. Eur. Phys. J. B 78(2), 265–273 (2010)MathSciNet CrossRef MATH
  9.Bak, P., Paczuski, M., Shubik, M.: Price variations in a stock market with many agents. Phys. A Stat. Mech. Appl. 246(3–4), 430–453 (1997)CrossRef
  10.Gabaix, X.: Power laws in economics and finance, Technical report. National Bureau of Economic Research (2008)
  11.Bouchaud, J.-P., Mézard, M., Potters, M.: Statistical properties of stock order books: empirical results and models. Quant. Finan. 2(4), 251–256 (2002)CrossRef
  12.Khanna, K., Smith, M., Wu, D., Zhang, T.: Reconstructing the order book, Technical report. Stanford University (2009)
  13.Singla, A., Chandrasekaran, B., Godfrey, P.B., Maggs, B.: The internet at the speed of light. In: 13th ACM Workshop on Hot Topics in Networks, HotNets (2014)
  14.Thompson, M., Farley, D., Barker, M., Gee, P., Stewart, A.: Disruptor: high performance alternative to bounded queues for exchanging data between concurrent threads. White paper (2011). http://​disruptor.​googlecode.​com/​files/​Disruptor-1.​0.​pdf
  15.Shetty, Y., Jayaswal, S.: The order-matching engine. In: Practical .NET for Financial Markets. Apress, pp. 41–103 (2006)
  16.Huang, W., Lehalle, C.-A., Rosenbaum, M.: Simulating, analyzing order book data: the queue-reactive model. J. Am. Stat. Assoc. 110(509), 107–122 (2013)MathSciNet CrossRef
  17.Cont, R., Stoikov, S., Talreja, R.: A stochastic model for order book dynamics. J. Am. Stat. Assoc. 58(3), 549–563 (2010)MathSciNet MATH
  18.Kercheval, A.N., Zhang, Y.: Modelling high-frequency limit order book dynamics with support vector machines. Quant. Financ. 15(8), 1315–1329 (2015)MathSciNet CrossRef
  
• 作者单位：Raphaël P. Barazzutti (15)
  Yaroslav Hayduk (15)
  Pascal Felber (15)
  Etienne Rivière (15)
  
  15. University of Neuchâtel, Neuchâtel, Switzerland
  
• 丛书名：Networked Systems
• ISBN：978-3-319-46140-3
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9944

文摘

Concurrent programming is essential to exploit parallel processing capabilities of modern multi-core CPUs. While there exist many languages and tools to simplify the development of concurrent programs, they are not always readily applicable to domain-specific problems that rely on complex shared data structures associated with various semantics (e.g., priorities or consistency). In this paper, we explore such a domain-specific application from the financial field, where a data structure—an order book—is used to store and match orders from buyers and sellers arriving at a high rate. This application has interesting characteristics as it exhibits some clear potential for parallelism, but at the same time it is relatively complex and must meet some strict guarantees, notably w.r.t. the ordering of operations. We first present an accurate yet slightly simplified description of the order book problem and describe the challenges in parallelizing it. We then introduce several approaches for introducing concurrency in the shared data structure, in increasing order of sophistication starting from lock-based techniques to partially lock-free designs. We propose a comprehensive workload generator for constructing histories of orders according to realistic models from the financial domain. We finally perform an evaluation and comparison of the different concurrent designs.