Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Techniques for finite element methods on modern processors
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
2015 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis, methods for efficient utilization of modern computer hardware for numerical simulation are considered. In particular, we study techniques for speeding up the execution of finite-element methods.

One of the greatest challenges in finite-element computation is how to efficiently perform the the system matrix assembly efficiently in parallel, due to its complicated memory access pattern. The main difficulty lies in the fact that many entries of the matrix are being updated concurrently by several parallel threads. We consider transactional memory, an exotic hardware feature for concurrent update of shared variables, and conduct benchmarks on a prototype processor supporting it. Our experiments show that transactions can both simplify programming and provide good performance for concurrent updates of floating point data.

Furthermore, we study a matrix-free approach to finite-element computation which avoids the matrix assembly. Motivated by its computational properties, we implement the matrix-free method for execution on graphics processors, using either atomic updates or a mesh coloring approach to handle the concurrent updates. A performance study shows that on the GPU, the matrix-free method is faster than a matrix-based implementation for many element types, and allows for solution of considerably larger problems. This suggests that the matrix-free method can speed up execution of large realistic simulations.

Place, publisher, year, edition, pages
Uppsala University, 2015.
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2015-001
National Category
Computer Science Computational Mathematics
Research subject
Scientific Computing
Identifiers
URN: urn:nbn:se:uu:diva-242186OAI: oai:DiVA.org:uu-242186DiVA: diva2:782743
Supervisors
Projects
UPMARCeSSENCE
Available from: 2015-01-18 Created: 2015-01-22 Last updated: 2017-08-31Bibliographically approved
List of papers
1. Using hardware transactional memory for high-performance computing
Open this publication in new window or tab >>Using hardware transactional memory for high-performance computing
Show others...
2011 (English)In: Proc. 25th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, Piscataway, NJ: IEEE , 2011, 1660-1667 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Piscataway, NJ: IEEE, 2011
National Category
Computer Science
Identifiers
urn:nbn:se:uu:diva-158551 (URN)10.1109/IPDPS.2011.322 (DOI)978-1-61284-425-1 (ISBN)
Conference
IPDPS Workshop on Multi-Threaded Architectures and Applications
Projects
eSSENCEUPMARC
Available from: 2011-09-01 Created: 2011-09-10 Last updated: 2017-04-17Bibliographically approved
2. Matrix-free finite-element operator application on graphics processing units
Open this publication in new window or tab >>Matrix-free finite-element operator application on graphics processing units
2014 (English)In: Euro-Par 2014: Parallel Processing Workshops, Part II, Springer, 2014, 450-461 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2014
Series
Lecture Notes in Computer Science, 8806
National Category
Computer Science Computational Mathematics
Identifiers
urn:nbn:se:uu:diva-238380 (URN)10.1007/978-3-319-14313-2_38 (DOI)000354785000038 ()978-3-319-14312-5 (ISBN)
Conference
7th Workshop on Unconventional High-Performance Computing
Projects
UPMARCeSSENCE
Available from: 2014-12-11 Created: 2014-12-11 Last updated: 2017-04-17Bibliographically approved

Open Access in DiVA

fulltext(1418 kB)309 downloads
File information
File name FULLTEXT01.pdfFile size 1418 kBChecksum SHA-512
143e9b56c442d9b99cb686f163239105f1d9b251dae9fd9499d816116a2fc7a839a0bfc16577a8e418104c2205d4bb1e0694e61f5920fdbc680566211b0847fa
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Ljungkvist, Karl
By organisation
Division of Scientific ComputingComputational Science
Computer ScienceComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 309 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1279 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf