DOI: 10.1007/978-3-540-78610-8_24
|View full text |Cite
|
Sign up to set email alerts
|

Exploring Reconfigurable Architectures for Binomial-Tree Pricing Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Publication Types

Select...
5
2
2

Relationship

4
5

Authors

Journals

citations
Cited by 17 publications
(20 citation statements)
references
References 5 publications
0
20
0
Order By: Relevance
“…Still, the work of Jin, et al [9] can be mentioned, as well as [10] (both on reconfigurable targets), and [11] for an architecture based on a GPU, closer to the industry standards of CPU and GPU clusters. Although not explicited in those papers, one benefit of using FPGAs for acceleration is their low consumption, when compared with GPUs and CPUs.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Still, the work of Jin, et al [9] can be mentioned, as well as [10] (both on reconfigurable targets), and [11] for an architecture based on a GPU, closer to the industry standards of CPU and GPU clusters. Although not explicited in those papers, one benefit of using FPGAs for acceleration is their low consumption, when compared with GPUs and CPUs.…”
Section: Related Workmentioning
confidence: 99%
“…Still, the FPGA chip is responsible for most of the power consumption on the board, and those results represent a good approximation of the total power consumption of the DE4 board. Table II illustrates the performances for each kernel on GPU and FPGA, along with software reference results, and published results for comparison [9], [10]. All the presented results were sampled after device saturation (best use case possible).…”
Section: B Hardware Resources Management and Utilizationmentioning
confidence: 99%
“…Lattice methods targeting FPGAs include binomial trees [3], finite-difference methods [2], and Quadrature pricing [ll]. Such algorithms are generally more efficient than Monte-Carlo methods.…”
Section: Related Workmentioning
confidence: 99%
“…For instance, a platform independent domain specific language has been invented to produce optimised pipelined designs with thread level parallelism for Monte Carlo simulations from a high level abstraction [5]; an FPGA-based stream accelerator with higher performance than GPUs and Cell processors has been proposed for evaluating European options [6]; and an architecture with a pipelined datapath and an on-chip instruction processor has been reported for speeding up the Brace, Gatarek and Musiela (BGM) interest rate model for pricing derivatives [7]. Some recent studies have focused on pipelined tree based methods [8] and quadrature methods [9]. Tree based methods are efficient, and can handle certain types of options such as American options that cannot be handled easily by Application Implementation The Heat Equation [10] 24 bit Fixed Point Maxwell's Equation [11] 16 bit Fixed Point Poisson Problem (Iterative Refinement) [12] Mixed 32/64 bit Floating Point Monte Carlo methods, while quadrature methods provide more accurate result over tree based methods.…”
Section: Motivationmentioning
confidence: 99%