Cargando…
Cache-Aware Matrix Polynomials
Efficient solvers for partial differential equations are among the most important areas of algorithmic research in high-performance computing. In this paper we present a new optimization for solving linear autonomous partial differential equations. Our approach is based on polynomial approximations...
Autores principales: | Huber, Dominik, Schreiber, Martin, Yang, Dai, Schulz, Martin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7302405/ http://dx.doi.org/10.1007/978-3-030-50371-0_10 |
Ejemplares similares
-
Caching for Analysis Workloads of the ATLAS LHC experiment: Size-Aware Caching Policies
por: Popescu, Sergiu-Bogdan
Publicado: (2022) -
PPCS: A Progressive Popularity-Aware Caching Scheme for Edge-Based Cache Redundancy Avoidance in Information-Centric Networks
por: Nguyen, Quang Ngoc, et al.
Publicado: (2019) -
Popularity-Aware Closeness Based Caching in NDN Edge Networks
por: Amadeo, Marica, et al.
Publicado: (2022) -
The q-Laguerre matrix polynomials
por: Salem, Ahmed
Publicado: (2016) -
Delay-aware distributed program caching for IoT-edge networks
por: Kim, Chang Kyung, et al.
Publicado: (2022)