Real-Time Analysis for High-Frequency Trading Your Data Needs to Be Faster, Not Just Bigger © 2015 Lee A Cole.

Slides:



Advertisements
Similar presentations
EISCambridge 2009MoN8 Exploring Markov models for gate-limited service and their application to network-based services Glenford Mapp and Dhawal Thakker.
Advertisements

OPERATING SYSTEMS PROCESSES
Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
CSE506: Operating Systems Disk Scheduling. CSE506: Operating Systems Key to Disk Performance Don’t access the disk – Whenever possible Cache contents.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 16 Scheduling II.
We make it easier for businesses of all sizes to safely accept checks transmodus offers clients automation utilizing our online processing platform for.
1 LAN Traffic Measurements Carey Williamson Department of Computer Science University of Calgary.
Dynamic Order Submission Strategies with Competition between a Dealer Market and a Crossing Network Discussion Frontiers of Finance, Bonaire 2005 Jennifer.
Investing in your future. What is INVESTORS OF TOMORROW? Investors of Tomorrow strives for excellence in fulfilling the mandate of providing financial.
IE 3265 Production & Operations Management Slide Series 2.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
1 CS 501 Spring 2005 CS 501: Software Engineering Lecture 22 Performance of Computer Systems.
IE 3265 Production & Operations Management Slide Series 2.
PROJECT REPORT ON E-BROKING AT RELIANCE MONEY. CONTENT OF PRESENTATION OVERVIEW OF ONLINE TRADING IN INDIA TYPE OF ONLINE STOCK TRADING WITH ITS PROS.
Disk and I/O Management
©2013 Software AG. All rights reserved. Dr John Bates CTO, Software AG 12 th November 2013 Turning Market Crisis into Competitive Advantage The Clue’s.
by Marc Comeau. About A Webmaster Developing a website goes far beyond understanding underlying technologies Determine your requirements.
Introduction Optimizing Application Performance with Pinpoint Accuracy What every IT Executive, Administrator & Developer Needs to Know.
Opening Keynote Presentation An Architecture for Intelligent Trading  Alessandro Petroni – Senior Principal Architect, Financial Services, TIBCO Software.
How Does High-Frequency Trading Affect Low- Frequency Trading? Presenter: Kun Li Wolfram Technology Conference, 2014.
Introduction and Overview Questions answered in this lecture: What is an operating system? How have operating systems evolved? Why study operating systems?
SOA based Business Solutions Krishna Prasad Sunil Kumar K.V.
Enterprise PI - How do I manage all of this? Robert Raesemann J Jacksonville, FL.
© Pearson Education Limited, Chapter 16 Physical Database Design – Step 7 (Monitor and Tune the Operational System) Transparencies.
$$$. Bank’s income portfolio Fee Based Income - Also called Interest Income A A Accepting Deposits and Lending Loans at Different Interest Rates B B Deposit.
©R. Schwartz Equity Markets: Trading and Structure Slide 1 Bob Schwartz Zicklin School of Business Baruch College, CUNY.
Test Loads Andy Wang CIS Computer Systems Performance Analysis.
Scheduling. Alternating Sequence of CPU And I/O Bursts.
1 Wenguang WangRichard B. Bunt Department of Computer Science University of Saskatchewan November 14, 2000 Simulating DB2 Buffer Pool Management.
Learningcomputer.com SQL Server 2008 – Profiling and Monitoring Tools.
By Phani Gowthami Tammineni. Overview This presentation is about the issues in real-time database systems and presents an overview of the state of the.
Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times.
Building a Real Workflow Thursday morning, 9:00 am Greg Thain University of Wisconsin - Madison.
Computer Performance Computer Engineering Department.
The act of Scheduling a process means changing the active PCB pointed to by the CPU. Also called a context switch. A context switch is essentially the.
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
Cpr E 308 Spring 2005 Process Scheduling Basic Question: Which process goes next? Personal Computers –Few processes, interactive, low response time Batch.
Chapter 5 Files and Exceptions I. "The Practice of Computing Using Python", Punch & Enbody, Copyright © 2013 Pearson Education, Inc. What is a file? A.
Futures Trading & your returns on Investments Futures contracts are financial assets just like stocks and bonds, but with some important differences.
How Much Memory Do I Need? Jack Opgenorth October, 2004.
Trade on the news? Information Trading Aswath Damodaran.
Operating Systems (CS 340 D) Princess Nora University Faculty of Computer & Information Systems Computer science Department.
Virtual Memory Various memory management techniques have been discussed. All these strategies have the same goal: to keep many processes in memory simultaneously.
What is a Microprocessor ? A microprocessor consists of an ALU to perform arithmetic and logic manipulations, registers, and a control unit Its has some.
Lecture 12 Page 1 CS 111 Online Using Devices and Their Drivers Practical use issues Achieving good performance in driver use.
Solving the straggler problem with bounded staleness Jim Cipar, Qirong Ho, Jin Kyu Kim, Seunghak Lee, Gregory R. Ganger, Garth Gibson, Kimberly Keeton*,
Purpose of Operating System Part 2 Monil Adhikari.
Credit and Collections optimization and decision support An example of the intersection of decision tool development and management consulting Includes.
CIS-NG CASREP Information System Next Generation Shawn Baugh Amy Ramirez Amy Lee Alex Sanin Sam Avanessians.
Test Loads Andy Wang CIS Computer Systems Performance Analysis.
CPU Scheduling G.Anuradha Reference : Galvin. CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time.
1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.
Performance Tuning Renegade
Nagios Performance Tuning Nick Scott
27 Jul 2006CSE403, Summer'06, Lecture 15 Midterm Exam Statistics Other statistics: Average: 40.6 Median: 42.3 Std Dev: 6.2 Max: 46.5 Min: 28 Easiest Problems:
Optimizing your windows system. Windows updates Updates Security updates Feature updates Driver updates Service pack A group of features & Security updates.
TF: Christine Bassem CS 350 Discussion 2 TF: Christine Bassem
Query Performance Tuning: Start to Finish
Process Virtualization. Process Process is a program that has initiated its execution. A program is a passive entity; whereas a process is an active entity.
Process management Information maintained by OS for process management
CPU Scheduling G.Anuradha
High frequency market microstructure
Lecture 18 Syed Mansoor Sarwar
CPU SCHEDULING CPU SCHEDULING.
CSE 332: Data Abstractions Memory Hierarchy
CPU Scheduling: Basic Concepts
Presentation transcript:

Real-Time Analysis for High-Frequency Trading Your Data Needs to Be Faster, Not Just Bigger © 2015 Lee A Cole

Harvard Business Review Feb 2015 © 2015 Lee A. Cole

Real-Time Analysis Overview Specific Example being securities trading Three Points You need to be faster Faster is probably faster than you think Have a(n automated) strategy for missing or bad data. © 2015 Lee A Cole

Real-Time Analysis What is High-Frequency Trading? Trading, not investing Start holding no positions – Finish holding no positions – Buy/Sell millions of shares during the day Move into and out of a position in minutes, seconds, even milliseconds – Microseconds soon – NASDAQ will respond in ~100 nanoseconds after an order hits its machines © 2015 Lee A Cole

Real-Time Analysis Data Volumes Market Data Volumes & Rates US Listed Equities ~5 Billion messages/day US Options changes per equity change FOREX higher still Futures, commodities, OTC, pink sheet, overseas… Other data sources: – SEC filings – News – Social media © 2015 Lee A Cole

Real-Time Analysis Data Volumes Trading Message Volumes ~20 orders placed per order executed – 95% cancel rates Have seen one trader place 20+ million orders / day Each order may have 5 or more messages involved – Trade messages are far more variable (format) than market data © 2015 Lee A Cole

Real-Time Analysis Implications Short decision timeframes – milliseconds at most, microseconds common Mistakes can be expensive OTS tools generally too slow – Custom code, hand tuned – FPGAs (trading, not analysis) – Custom ASICs (market data servers) © 2015 Lee A Cole

Real-Time Analysis Implications (cont.) Competitive pressures Preplanned, automated strategies – missing, noisy, or misleading data missing data, if resent, will be stale and of little use Network noise, garbage collection times, page swapping delays can be killers Databases are slow © 2015 Lee A Cole

Real-Time Analysis You must be faster than you think Queues – Arrival times vary – And are outside of your control Utilization p =average time to process a message/ average time between messages Rule of thumb: – Average queue depth = p/(1-p) © 2015 Lee A Cole

Real-Time Analysis © 2015 Lee A Cole

Real-Time Analysis © 2015 Lee A Cole

Real-Time Analysis Keep utilization low (<20-25%) A bored cpu can respond quickly Applies to network and disk i/o as well How? Algorithms Simple design (simple usually runs faster) Tight coding – Buffers not objects Measure/monitor constantly – Things always change. Know how, and how it impacts the analysis © 2015 Lee A Cole

Real-Time Analysis Wrap Up Your data should be faster, not just bigger – Competitive pressures will force it – IOT => more real-time data Utilization rates should be ~20-25% or less Automated strategies for data cleaning – As part of your normal processing time – You won’t have time otherwise © 2015 Lee A Cole

Real-Time Analysis Real-Time Analysis for High-Frequency Trading Your Data Should Be Faster, Not Just Bigger Lee A Cole, PhD © 2015 Lee A Cole