{"title":"基于倒向随机微分方程的GPU期权定价","authors":"Ying Peng, Bin Gong, Hui Liu, Bin Dai","doi":"10.1109/PAAP.2011.12","DOIUrl":null,"url":null,"abstract":"In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each time step. Furthermore, for evaluating the affect of load balance to the performance, we provide two different acceleration strategies and compare them with running time experiments. The acceleration algorithms exhibit tremendous speedup over the sequential CPU implementation and therefore suitable for real-time application.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Option Pricing on the GPU with Backward Stochastic Differential Equation\",\"authors\":\"Ying Peng, Bin Gong, Hui Liu, Bin Dai\",\"doi\":\"10.1109/PAAP.2011.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each time step. Furthermore, for evaluating the affect of load balance to the performance, we provide two different acceleration strategies and compare them with running time experiments. The acceleration algorithms exhibit tremendous speedup over the sequential CPU implementation and therefore suitable for real-time application.\",\"PeriodicalId\":213010,\"journal\":{\"name\":\"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PAAP.2011.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PAAP.2011.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Option Pricing on the GPU with Backward Stochastic Differential Equation
In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each time step. Furthermore, for evaluating the affect of load balance to the performance, we provide two different acceleration strategies and compare them with running time experiments. The acceleration algorithms exhibit tremendous speedup over the sequential CPU implementation and therefore suitable for real-time application.