default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Korch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Silas Bartel
, Matthias Korch:
Generation of logic designs for efficiently solving ordinary differential equations on field programmable gate arrays. Softw. Pract. Exp. 53(1): 27-52 (2023)- 2022
- [c31]Oliver Hacker, Matthias Korch, Johannes Seiferth:
A Motivating Case Study on Code Variant Selection by Reinforcement Learning. ISC 2022: 293-312 - 2021
- [j10]Matthias Korch, Tim Werner:
An in-depth introduction of multi-workgroup tiling for improving the locality of explicit one-step methods for ODE systems with limited access distance on GPUs. Concurr. Comput. Pract. Exp. 33(11) (2021) - [c30]Christie L. Alappat, Johannes Seiferth, Georg Hager, Matthias Korch, Thomas Rauber, Gerhard Wellein:
YaskSite: Stencil Optimization Techniques Applied to Explicit ODE Methods on Modern Architectures. CGO 2021: 174-186 - 2020
- [j9]Matthias Korch, Tim Werner:
Improving locality of explicit one-step methods on GPUs by tiling across stages and time steps. Future Gener. Comput. Syst. 102: 889-901 (2020) - [c29]Matthias Korch, Philipp Raithel, Tim Werner:
Implementation and Optimization of a 1D2V PIC Method for Nonlinear Kinetic Models on GPUs. PDP 2020: 30-37 - [c28]Johannes Seiferth, Matthias Korch, Thomas Rauber:
Offsite Autotuning Approach - Performance Model Driven Autotuning Applied to Parallel Explicit ODE Methods. ISC 2020: 370-390 - [i1]Johannes Seiferth, Matthias Korch, Thomas Rauber:
Offsite Autotuning Approach - Performance Model Driven Autotuning Applied to Parallel Explicit ODE Methods. CoRR abs/2004.03695 (2020)
2010 – 2019
- 2019
- [c27]Matthias Korch, Tim Werner:
Multi-workgroup Tiling to Improve the Locality of Explicit One-Step Methods for ODE Systems with Limited Access Distance on GPUs. PPAM (1) 2019: 3-12 - [c26]Markus Scherg, Johannes Seiferth, Matthias Korch, Thomas Rauber:
Performance Prediction of Explicit ODE Methods on Multi-Core Cluster Systems. ICPE 2019: 139-150 - 2018
- [j8]Matthias Korch, Tim Werner:
Accelerating explicit ODE methods on GPUs by kernel fusion. Concurr. Comput. Pract. Exp. 30(18) (2018) - [c25]Matthias Korch, Tim Werner:
Exploiting Limited Access Distance for Kernel Fusion Across the Stages of Explicit One-Step Methods on GPUs. SBAC-PAD 2018: 148-157 - [c24]Johannes Seiferth, Christie L. Alappat, Matthias Korch, Thomas Rauber:
Applicability of the ECM Performance Model to Explicit ODE Methods on Current Multi-core Processors. ISC 2018: 163-183 - 2016
- [c23]Matthias Korch, Thomas Rauber, Matthias Stachowski, Tim Werner:
Influence of Locality on the Scalability of Method-and System-Parallel Explicit Peer Methods. FedCSIS 2016: 685-694 - 2014
- [j7]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Online auto-tuning for the time-step-based parallel solution of ODEs on shared-memory systems. J. Parallel Distributed Comput. 74(8): 2722-2744 (2014) - 2013
- [c22]Marvin Ferber, Natalia Kalinnik, Matthias Korch, Andreas Prell, Thomas Rauber, Matthias Witzgall:
MAP: Mobile Assistance Platform with a VM Type Selection Ability. ICPADS 2013: 448-449 - [c21]Matthias Korch, Tobias Ramming, Gerhard Rein:
Parallelization of Particle-in-Cell Codes for Nonlinear Kinetic Models from Mathematical Physics. ICPP 2013: 523-529 - 2012
- [c20]Matthias Korch:
Locality Improvement of Data-Parallel Adams-Bashforth Methods through Block-Based Pipelining of Time Steps. Euro-Par 2012: 563-574 - [c19]Matthias Korch, Julien Kulbe, Carsten Scholtes:
Diamond-Like Tiling Schemes for Efficient Explicit Euler on GPUs. ISPDC 2012: 259-266 - 2011
- [j6]Matthias Korch, Thomas Rauber, Carsten Scholtes:
Scalability and locality of extrapolation methods on large parallel systems. Concurr. Comput. Pract. Exp. 23(15): 1789-1815 (2011) - [j5]Matthias Korch, Thomas Rauber:
Parallel Low-Storage Runge - Kutta Solvers for ODE Systems with Limited Access Distance. Int. J. High Perform. Comput. Appl. 25(2): 236-255 (2011) - [j4]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type. J. Comput. Appl. Math. 236(3): 394-410 (2011) - [j3]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Dynamic selection of implementation variants of sequential iterated runge-kutta methods with tile size sampling (abstracts only). SIGMETRICS Perform. Evaluation Rev. 39(3): 15 (2011) - [c18]Matthias Korch, Thomas Rauber, Carsten Scholtes:
Memory-Intensive Applications on a Many-Core Processor. HPCC 2011: 126-134 - [c17]Natalia Kalinnik, Matthias Korch, Thomas Rauber:
Dynamic selection of implementation variants of sequential iterated runge-kutta methods with tile size sampling. ICPE 2011: 189-200 - 2010
- [c16]Matthias Korch, Thomas Rauber, Carsten Scholtes:
Scalability and Locality of Extrapolation Methods for Distributed-Memory Architectures. Euro-Par (2) 2010: 65-76 - [c15]Matthias Korch, Thomas Rauber, Carsten Scholtes:
Mixed-Parallel Implementations of Extrapolation Methods with Reduced Synchronization Overhead for Large Shared-Memory Computers. ICPADS 2010: 131-138 - [c14]Matthias Korch, Thomas Rauber:
Storage space reduction for the solution of systems of ordinary differential equations by pipelining and overlapping of vectors. IPDPS Workshops 2010: 1-8
2000 – 2009
- 2009
- [c13]Matthias Korch, Thomas Rauber:
Parallel Implementation of Runge-Kutta Integrators with Low Storage Requirements. Euro-Par 2009: 785-796 - [c12]Matthias Korch, Thomas Rauber:
Scalability of Time- and Space-Efficient Embedded Runge-Kutta Solvers for Distributed Address Space. ICPP 2009: 404-411 - 2008
- [b2]Matthias Korch:
Eingebettete Runge-Kutta-Verfahren für parallele Rechnersysteme: effiziente Implementierung durch Ausnutzung der Speicherzugriffslokalität. VDM Verlag Dr. Müller, Saarbrücken, Germany 2008, ISBN 978-3-8364-9140-2, pp. 1-272 - [c11]Sascha Hunold, Matthias Korch, Björn Krellner, Thomas Rauber, Thomas Reichel, Gudula Rünger:
Transformation of Legacy Software into Client/Server Applications through Pattern-Based Rearchitecturing. COMPSAC 2008: 303-310 - [c10]Sascha Hunold, Matthias Korch, Björn Krellner, Thomas Rauber, Thomas Reichel, Gudula Rünger:
Inkrementelle Transformation einer monolithischen Geschäftssoftware. Software Engineering (Workshops) 2008: 226-231 - 2007
- [c9]Matthias Korch, Thomas Rauber:
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods. Euro-Par 2007: 737-747 - 2006
- [b1]Matthias Korch:
Effiziente Implementierung eingebetteter Runge-Kutta-Verfahren durch Ausnutzung der Speicherzugriffslokalität. University of Bayreuth, Germany, 2006, pp. 1-270 - [j2]Matthias Korch, Thomas Rauber:
Optimizing locality and scalability of embedded Runge-Kutta solvers using block-based pipelining. J. Parallel Distributed Comput. 66(3): 444-468 (2006) - [c8]Matthias Korch, Thomas Rauber:
Applicability of Load Balancing Strategies to Data-Parallel Embedded Runge-Kutta Integrators. Euro-Par 2006: 720-729 - 2004
- [j1]Matthias Korch, Thomas Rauber:
A comparison of task pools for dynamic load balancing of irregular algorithms. Concurr. Comput. Pract. Exp. 16(1): 1-47 (2004) - [c7]Ralf Hoffmann, Matthias Korch, Thomas Rauber:
Using Hardware Operations to Reduce the Synchronization Overhead of Task Pools. ICPP 2004: 241-249 - [c6]Matthias Korch, Thomas Rauber:
Simulation-Based Analysis of Parallel Runge-Kutta Solvers. PARA 2004: 1105-1114 - [c5]Ralf Hoffmann, Matthias Korch, Thomas Rauber:
Performance Evaluation of Task Pools Based on Hardware Synchronization. SC 2004: 44 - 2003
- [c4]Matthias Korch, Thomas Rauber:
Scalable Parallel RK Solvers for ODEs Derived by the Method of Lines. Euro-Par 2003: 830-839 - [c3]Matthias Korch, Thomas Rauber:
Comparison of Parallel Implementations of Runge-Kutta Solvers: Message Passing vs. Threads. PARCO 2003: 209-216 - 2002
- [c2]Matthias Korch, Thomas Rauber, Gudula Rünger:
Pipelining for Locality Improvement in RK Methods. Euro-Par 2002: 724-734 - [c1]Matthias Korch, Thomas Rauber:
Evaluation of Task Pools for the Implementation of Parallel Irregular Algorithms. ICPP Workshops 2002: 597-606
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
