Fast Poisson solvers for graphics processing units
Myllykoski, M., Rossi, T., & Toivanen, J. (2013). Fast Poisson solvers for graphics processing units. In P. Manninen, & P. Öster (Eds.), Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers (pp. 265-279). Springer. Lecture Notes in Computer Science, 7782. https://doi.org/10.1007/978-3-642-36803-5_19
Published in
Lecture Notes in Computer ScienceDate
2013Copyright
© Springer-Verlag Berlin Heidelberg 2013. This is a final draft version of an article whose final and definitive form has been published by Springer. Published in this repository with the kind permission of the publisher.
Two block cyclic reduction linear system solvers are considered
and implemented using the OpenCL framework. The topics of
interest include a simplified scalar cyclic reduction tridiagonal system
solver and the impact of increasing the radix-number of the algorithm.
Both implementations are tested for the Poisson problem in two and
three dimensions, using a Nvidia GTX 580 series GPU and double precision
floating-point arithmetic. The numerical results indicate up to 6-fold
speed increase in the case of the two-dimensional problems and up to 3-
fold speed increase in the case of the three-dimensional problems when
compared to equivalent CPU implementations run on a Intel Core i7
quad-core CPU.
Publisher
SpringerISBN
978-3-642-36803-5Parent publication ISBN
Conference
International Conference on Applied Parallel and Scientific ComputingIs part of publication
Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected PapersISSN Search the Publication Forum
0302-9743Keywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/22166912
Metadata
Show full item recordCollections
Related items
Showing items with similar title or keywords.
-
A parallel radix-4 block cyclic reduction algorithm
Myllykoski, Mirko; Rossi, Tuomo (John Wiley & Sons Ltd., 2014)A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction ... -
On GPU-accelerated fast direct solvers and their applications in image denoising
Myllykoski, Mirko (University of Jyväskylä, 2015) -
Designing a graphics processing unit accelerated petaflop capable lattice Boltzmann solver: Read aligned data layouts and asynchronous communication
Robertsén, Fredrik; Westerholm, Jan; Mattila, Keijo (Sage, 2017)The lattice Boltzmann method is a well-established numerical approach for complex fluid flow simulations. Recently, general-purpose graphics processing units (GPUs) have become available as high-performance computing ... -
Poissonin yhtälön nopeat ratkaisijat
Jauhiainen, Susanne (2016)Tutkielmassa esitellään Poissonin yhtälö sekä sen diskretointi. Lisäksi käydään läpi kaksi nopeaa numeerista menetelmää yhtälön ratkaisemiseksi. Yksinkertaisuuden vuoksi rajoitutaan kaksiulotteisiin tehtäviin, joissa on ... -
DNA computing
Lappalainen, Panu (2019)Tässä kirjallisuuskatsauksessa käsitellään DNA:n mahdollisuuksia tietokonelaskennassa. DNA on erinomainen rinnakkaislaskennassa laskentanopeutensa ja energiatehokkuutensa puolesta, mutta sen hitaan valmisteluajan ja yleisen ...