Algorithmic Trading: A brief, computational finance case study on data centre FPGAs
Gordon Inggs

TL;DR
This paper explores the deployment of data centre FPGAs for computational finance workloads, demonstrating energy-efficient performance comparable to GPUs through a case study involving options pricing models.
Contribution
It introduces a method for optimizing workload distribution on data centre FPGAs and analyzes their performance benefits in computational finance tasks.
Findings
FPGAs achieve near-GPU latency performance
FPGAs consume significantly less energy
30% more floating point operations per Joule
Abstract
Increasingly FPGAs will be deployed at scale due to the need for increased need for power efficient computation and improved high level synthesis tool flows, creating a new category of device: data centre FPGAs. A method for using these FPGAs is to identify what proportion of a given workload would benefit from being implemented upon the available FPGAs while minimising communication off-chip. As part of the implementation of these tasks, care should be taken in identifying the parallel execution mode, task or pipeline parallelism that should be used. When considering a case study of computational finance tasks, a benchmark workload of Heston and Black-Scholes-based options implemented using OpenCL and OpenSPL, the benefit of this method of using data centre FPGAs is illustrated. These devices deliver latency performance close to that of workstation grade GPUs, while requiring…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Cloud Computing and Resource Management · Advanced Data Storage Technologies
