<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06097590</id>
  <dt>j</dt>
  <an>06097590</an>
  <augroup>
    <au>Dixon, M.F.</au>
    <au>Chong, J.</au>
    <au>Keutzer, K.</au>
  </augroup>
  <ti>Accelerating value-at-risk estimation on highly parallel architectures.</ti>
  <so>Concurrency Comput. Pract. Exp. 24, No. 8, 895-907 (2012).</so>
  <py>2012</py>
  <pu>John Wiley \& Sons, Ltd., Chichester</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>D.1.3 concurrent programming [parallel programming]</ut>
    <ut>G.3 probability and statistics [probabilistic algorithms (including Monte Carlo)]</ut>
    <ut>J.4 social and behavioral sciences [economics]</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1002/cpe.1790</li>
  </ligroup>
  <abgroup>
    <ab>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\times $speedup on our CPU-based implementation and $538\times $speedup on our GPU-based implementation.</ab>
    <rv></rv>
  </abgroup>
</item>