{"title":"分布式蒙特卡罗期权定价仿真:首次完成了分布式蒙特卡罗仿真模型在高性能计算架构上的基准测试及应用","authors":"F. Wang","doi":"10.1109/CYBERC.2009.5342201","DOIUrl":null,"url":null,"abstract":"As financial institution computing requirements grow exponentially, we have explored the potential for the ClearSpeed Accelerator, the Cell processor and the FPGA (A field-programmable gate array) to run risk analytics applications. We also invented the Smoothed Alias Method based generator for FPGA in order to achieve the fast result. We have taken Monte Carlo algorithm from my C++ Quantitative Library and rewrite it for this benchmark purpose and test the algorithm with some clever numerical adaptation with the Bulk Synchronous Parallel (BSP) computing model in order to leverage the distributed computing architecture. Following the initial benchmark, we have chosen to use the ClearSpeed Accelerator. With some smart quant re-engineering, we have further optimized the Distributed MC algorithm for pricing Bermudan Swaption to exploit the potential of distributed-based architecture. We will show the comparative benchmark results of the MC algorithm on ClearSpeed Accelerator, Cell and FPGA platform for the first time within our industry based on my working notes from my time in Barclays Capital London.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed Monte Carlo simulation for option pricing: The first completed benchmark and applications of distributed Monte Carlo simulation model on high-performance computing architecture\",\"authors\":\"F. Wang\",\"doi\":\"10.1109/CYBERC.2009.5342201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As financial institution computing requirements grow exponentially, we have explored the potential for the ClearSpeed Accelerator, the Cell processor and the FPGA (A field-programmable gate array) to run risk analytics applications. We also invented the Smoothed Alias Method based generator for FPGA in order to achieve the fast result. We have taken Monte Carlo algorithm from my C++ Quantitative Library and rewrite it for this benchmark purpose and test the algorithm with some clever numerical adaptation with the Bulk Synchronous Parallel (BSP) computing model in order to leverage the distributed computing architecture. Following the initial benchmark, we have chosen to use the ClearSpeed Accelerator. With some smart quant re-engineering, we have further optimized the Distributed MC algorithm for pricing Bermudan Swaption to exploit the potential of distributed-based architecture. We will show the comparative benchmark results of the MC algorithm on ClearSpeed Accelerator, Cell and FPGA platform for the first time within our industry based on my working notes from my time in Barclays Capital London.\",\"PeriodicalId\":222874,\"journal\":{\"name\":\"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERC.2009.5342201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2009.5342201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Monte Carlo simulation for option pricing: The first completed benchmark and applications of distributed Monte Carlo simulation model on high-performance computing architecture
As financial institution computing requirements grow exponentially, we have explored the potential for the ClearSpeed Accelerator, the Cell processor and the FPGA (A field-programmable gate array) to run risk analytics applications. We also invented the Smoothed Alias Method based generator for FPGA in order to achieve the fast result. We have taken Monte Carlo algorithm from my C++ Quantitative Library and rewrite it for this benchmark purpose and test the algorithm with some clever numerical adaptation with the Bulk Synchronous Parallel (BSP) computing model in order to leverage the distributed computing architecture. Following the initial benchmark, we have chosen to use the ClearSpeed Accelerator. With some smart quant re-engineering, we have further optimized the Distributed MC algorithm for pricing Bermudan Swaption to exploit the potential of distributed-based architecture. We will show the comparative benchmark results of the MC algorithm on ClearSpeed Accelerator, Cell and FPGA platform for the first time within our industry based on my working notes from my time in Barclays Capital London.