Accelerating Value-at-Risk estimation on highly parallel architectures

SUMMARY Values of portfolios in modern financial markets may change precipitously with changing market conditions. The utility of financial risk management tools is dependent on whether they can estimate Value‐at‐Risk (VaR) of portfolios on‐demand when key decisions need to be made. However, VaR est...

Full description

Saved in:

Bibliographic Details
Published in:	Concurrency and computation Vol. 24; no. 8; pp. 895 - 907
Main Authors:	Dixon, M. F., Chong, J., Keutzer, K.
Format:	Journal Article
Language:	English
Published:	Chichester, UK John Wiley & Sons, Ltd 10.06.2012
Subjects:	D.1.3 concurrent programming [parallel programming] G.3 probability and statistics [probabilistic algorithms (including Monte Carlo)] J.4 social and behavioral sciences [economics]
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	SUMMARY Values of portfolios in modern financial markets may change precipitously with changing market conditions. The utility of financial risk management tools is dependent on whether they can estimate Value‐at‐Risk (VaR) of portfolios on‐demand when key decisions need to be made. However, VaR estimation of portfolios uses the Monte Carlo method, which is a computationally intensive method often run as an overnight batch job. With the proliferation of highly parallel computing platforms such as multicore CPUs and manycore graphics processing units (GPUs), teraFLOPS of computation capability is now available on a desktop computer, enabling the VaR of large portfolios with thousands of risk factors to be computed within only a fraction of a second. Achieving such performance in practice requires the assimilation of expertise in the following three areas: (i) application domain; (ii) statistical analytics; and (iii) parallel computing. This paper demonstrates that these areas of expertise inform optimization perspectives that, when combined, lead to 127×speedup on our CPU‐based implementation and 538×speedup on our GPU‐based implementation. Copyright © 2011 John Wiley & Sons, Ltd.
Bibliography:	ark:/67375/WNG-D11M7ZBT-B ArticleID:CPE1790 istex:68DB664EC10157180F0FA89094A5B26E4EEAA329
ISSN:	1532-0626 1532-0634
DOI:	10.1002/cpe.1790