Pagès et al., 2012 - Google Patents
GPGPUs in computational finance: massive parallel computing for American style optionsPagès et al., 2012
View PDF- Document ID
- 15931685348689294135
- Author
- Pagès G
- Wilbertz B
- Publication year
- Publication venue
- Concurrency and Computation: Practice and Experience
External Links
Snippet
The pricing of American style and multiple exercise options is a very challenging problem in mathematical finance. One usually employs a least squares Monte Carlo approach (Longstaff–Schwartz method) for the evaluation of conditional expectations, which arise in …
- 238000000034 method 0 abstract description 9
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/30076—Arrangements for executing specific machine instructions to perform miscellaneous control operations, e.g. NOP
- G06F9/30087—Synchronisation or serialisation instructions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
- G06F9/3836—Instruction issuing, e.g. dynamic instruction scheduling, out of order instruction execution
- G06F9/3842—Speculative instruction execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/04—Architectures, e.g. interconnection topology
- G06N3/0472—Architectures, e.g. interconnection topology using probabilistic elements, e.g. p-rams, stochastic processors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Pagès et al. | GPGPUs in computational finance: massive parallel computing for American style options | |
Maas et al. | Phantom: Practical oblivious computation in a secure processor | |
Abbas‐Turki et al. | Pricing derivatives on graphics processing units using Monte Carlo simulation | |
Hill et al. | Distribution of random streams for simulation practitioners | |
Valero‐Lara et al. | cuThomasBatch and cuThomasVBatch, CUDA routines to compute batch of tridiagonal systems on NVIDIA GPUs | |
Arunarani et al. | FFBAT: A security and cost‐aware workflow scheduling approach combining firefly and bat algorithms | |
Kan et al. | Accelerating the SCE‐UA Global Optimization Method Based on Multi‐Core CPU and Many‐Core GPU | |
El Zein et al. | Generating optimal CUDA sparse matrix–vector product implementations for evolving GPU hardware | |
Matthews et al. | MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees | |
Chow et al. | Scaling up hartree–fock calculations on tianhe-2 | |
Heinecke et al. | A highly parallel black–scholes solver based on adaptive sparse grids | |
Hu et al. | Parallel simulation of high‐dimensional American option pricing based on CPU versus MIC | |
Pop | High performance numerical computing for high energy physics: a new challenge for big data science | |
Maroosi et al. | Accelerated execution of P systems with active membranes to solve the N-queens problem | |
Melab et al. | Graphics processing unit‐accelerated bounding for branch‐and‐bound applied to a permutation problem using data access optimization | |
Szałkowski et al. | Using distributed memory parallel computers and GPU clusters for multidimensional Monte Carlo integration | |
Lacson et al. | Biomedical blockchain with practical implementations and quantitative evaluations: a systematic review | |
Sundfeld et al. | Using GPU to accelerate the pairwise structural RNA alignment with base pair probabilities | |
RADMANOVIĆ et al. | Efficient computation of Galois field expressions on hybrid CPU-GPU platforms. | |
Gamaarachchi et al. | Accelerating correlation power analysis using graphics processing units (gpus) | |
Misra et al. | Parallel mutual information based construction of genome-scale networks on the Intel® Xeon Phi™ Coprocessor | |
de Avila et al. | Quantum computing simulation through reduction and decomposition optimizations with a case study of shor's algorithm | |
US20210003398A1 (en) | Scalable Graph SLAM for HD Maps | |
Aliaga et al. | Communication in task‐parallel ILU‐preconditioned CG solvers using MPI+ OmpSs | |
Aparecida Silva Camacho et al. | PB3Opt: Profile‐based biased Bayesian optimization to select computing clusters on the cloud |