Financial Instrument Pricing: Libor Swaption Portfolio (Monte-Carlo)

Select Processor

Benchmark Description

This application prices a portfolio of LIBOR swaptions on a LIBOR Market Model using a Monte-Carlo simulation. It simultaneously calculates first order sensitivities to the initial forward rates (the delta Greeks) using path-wise Adjoint Algorithmic Differentiation (AD).

In each Monte-Carlo path, the LIBOR forward rates are generated randomly at all required maturities following the LIBOR Market Model, starting from the initial LIBOR rates. The swaption portfolio payoff is then computed and discounted to the pricing date. Averaging the per-path prices gives the final net present value of the portfolio.

The full algorithm is illustrated in the processing graph below:


More details can be found in Prof. Mike Giles’ notes [1].

This benchmark uses a portfolio of 15 swaptions with maturities between 4 and 40 years and 80 forward rates (and hence 80 delta Greeks). The performance is measured with varying numbers of Monte-Carlo paths (from 256K to 2,048K).

[1] M. Giles, "Monte Carlo evaluation of sensitivities in computational finance," HERCMA Conference, Athens, Sep. 2007.

  • Application Class: Pricer
  • Model: Libor Market Model
  • Instrument Type: Swaption Portfolio
  • Numerical Method: Monte-Carlo
  • Portfolio Size: 15 swaptions
  • Maturities: 4 to 40 years
  • Number of Forward Rates: 80
  • Sensitivities: first order (delta)
  • Number of Sensitivities: 80
  • Monte-Carlo Paths: 256K-2,048K
SystemOperating SystemImplementationMemory (RAM)CompilerECCPrecision ModeOther
Nvidia GPURedHat EL 6.6 (64bit)C++ / Xcelerit SDK 3.164GB (host)GCC 4.8ondoublemax. clock boost, CUDA 7.5
The application is executed 100 times and the average wall-clock time is reported. The first cold run is dropped. The full algorithm execution time from inputs to outputs is measured. This includes setup of accelerators and data transfers if applicable. The speedup vs. a sequential implementation on a single core is reported.

Hardware Specification

ProcessorCoresLogical CoresFrequencyGFLOPs (double)Max. MemoryMax. Memory B/W
NVIDIA Tesla K40 GPU (Kepler)15 (SMX)2,880 (CUDA cores)745 MHz1,43012 GB288 GB/s
NVIDIA Tesla K80 GPU (Kepler)2 x 13 (SMX)2 x 2,496 (CUDA cores)562 MHz2 x 1,4552 x 12 GB2 x 240 GB/s

Speedup vs. Sequential*

*the sequential version runs on a single core of an Intel Xeon E5-2697 v3 CPU

Whitepaper: A Guide to Choosing HPC Processors

While benchmarking a given application provides a comparative measure of hardware performance, the ease of developing and tuning the software is equally important. This white paper gives an overview of available processors and their suitability for various algorithms classes. In addition, it assesses the required development effort and expertise when tuning a given application for these processors.

  • HPC processors landscape: CPU, GPU, Intel Xeon Phi, IBM Power
  • Suitability for algorithms classes and applications
  • Typical implementation workflow
  • Cost-benefit tradeoff
  • Guidelines for choosing a processor
Ask A Question