skip to main content
10.1145/2616498.2616501acmotherconferencesArticle/Chapter ViewAbstractPublication PagesxsedeConference Proceedingsconference-collections
research-article

Fast, Low-Memory Algorithm for Construction of Nanosecond Level Snapshots of Financial Markets

Authors Info & Claims
Published:13 July 2014Publication History

ABSTRACT

We present a fast, low-memory algorithm for constructing an order-by-order level snapshot of financial markets with nanosecond resolution. This new implementation is 20-30x faster than an earlier version of the code. In addition, since message data are retained only for as long as it they are needed, the memory footprint is greatly reduced. We find that even the heaviest days of trading spanning the NASDAQ, NYSE and BATS exchanges can now easily be handled using compute nodes with very modest memory (~ 4 GB). A tradeoff of this new approach is that the ability to efficiently manage large numbers of small files is more critical. We demonstrate how we can accommodate these new I/O requirements using the solid-state storage devices (SSDs) on SDSC's Gordon system.

References

  1. Conway, B. Wall Street's Need for Trading Speed: The Nanosecond Age, 2011.Google ScholarGoogle Scholar
  2. Cochrane, J. Weird stuff in high frequency markets.. The Grumpy Economist, 2012.Google ScholarGoogle Scholar
  3. Kirilenko, A., Kyle, A. S., Samadi, M. and Tuzun, T. The flash crash: The impact of high frequency trading on an electronic market. Manuscript, U of Maryland (2011).Google ScholarGoogle Scholar
  4. Biais, B. and Woolley, P. High frequency trading. Manuscript, Toulouse University, IDEI (2011).Google ScholarGoogle Scholar
  5. NANEX, LLC Nanex Flash Crash Summary Report, http://www.nanex.net/FlashCrashFinal/FlashCrashSummary.html, 2010.Google ScholarGoogle Scholar
  6. Hasbrouck, J. and Saar, G. Low-latency trading. Journal of Financial Markets, 16, 4 (2013), 646--679.Google ScholarGoogle ScholarCross RefCross Ref
  7. Lo, A. W. and MacKinlay, A. C. Stock market prices do not follow random walks: Evidence from a simple specification test. Review of financial studies, 1, 1 (1988), 41--66.Google ScholarGoogle Scholar
  8. Gai, J., Choi, D. J., O'Neal, D., Ye, M. and Sinkovits, R. S. Fast construction of nanosecond level snapshots of financial markets. ACM, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. NASDAQ Reference Manual for TotalView-ITCH 2.0, 2006.Google ScholarGoogle Scholar
  10. NASDAQ Reference Manual for TotalView-ITCH 3.0, 2008.Google ScholarGoogle Scholar
  11. NASDAQ Reference Manual for TotalView-ITCH 4.0f, 2009.Google ScholarGoogle Scholar
  12. NASDAQ Reference Manual for TotalView-ITCH 4.0, 2010.Google ScholarGoogle Scholar
  13. NASDAQ Reference Manual for TotalView-ITCH 4.1, 2011.Google ScholarGoogle Scholar
  14. Szabó, B. Parallel::ForkManager - A simple parallel processing fork manager.Google ScholarGoogle Scholar

Index Terms

  1. Fast, Low-Memory Algorithm for Construction of Nanosecond Level Snapshots of Financial Markets

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Other conferences
              XSEDE '14: Proceedings of the 2014 Annual Conference on Extreme Science and Engineering Discovery Environment
              July 2014
              445 pages
              ISBN:9781450328937
              DOI:10.1145/2616498
              • General Chair:
              • Scott Lathrop,
              • Program Chair:
              • Jay Alameda

              Copyright © 2014 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 13 July 2014

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article
              • Research
              • Refereed limited

              Acceptance Rates

              XSEDE '14 Paper Acceptance Rate80of120submissions,67%Overall Acceptance Rate129of190submissions,68%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader