Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lukasz Kondraciuk

dblp:293/1214 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-7332-6533ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% Parallel and multicore computing · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
performance optimization at scale
0.512021
Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From University of Warsaw · IEEE Trans. Parallel Distributed Syst. 2021
Parallel and multicore computing › parallel computing
parallel scientific computing
0.112021
Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From University of Warsaw · IEEE Trans. Parallel Distributed Syst. 2021

Methods — techniques the papers use, named apart from their topics

polynomial filtering eigensolver · 0.5mixed finite element method · 0.5MPI · 0.5
YearPublicationVenuePosition
2023 String Covers of a Tree Revisited
Lukasz Kondraciuk
SPIRE1
2021 Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From University of Warsaw
abstract
The Supercomputing conference holds a student cluster competition - A competition that aims to introduce undergraduate students to the world of High Performance Computing. One of the tasks at the SC19 conference was to reproduce the scaling results obtained in the article titled Computing Planetary Interior Normal Modes with a Highly Parallel Polynomial Filtering Eigensolver by Jia Shi et al. They introduced a new approach to the problem of calculating planetary normal modes. The developed method is a highly parallel algorithm that approximates the results via the mixed finite element method on unstructured tetrahedral meshes. The cluster used consisted of five 40-core Intel Xeon Cascade Lake nodes, equipped with 384 GB of RAM each. The original study was demonstrated on Stampede2 system on partitions ranging from 2 to 256 nodes with 48-core Intel Xeon Skylake and 192 GB of RAM each. Our cluster was equipped with Infiniband interconnect while Stampede2 used Intel Omni-Path network. We decided to work with HPC-X MPI library in place of Intel MPI used the reference study. The design - sizes and schedule - of experimental runs was the most challenging part of our study. We run both strong and weak scalability experiments in a one set of runs in order to fit in limited computing capacity and very tight time schedule. Due to limitations of our hardware, we had to split the weak scaling study into two separate smaller studies. We didn't manage to reproduce the exact results, however, we achieved similar scalability trend.
Marek Masiak, Iwona Kotlarska, Lukasz Kondraciuk, Maciej Szpindler
IEEE Trans. Parallel Distributed Syst.3