Univ.-Prof. Dipl.-Ing. Dr. Wilfried Gansterer, M.Sc.
1090 Wien
Raum : 6.33
Lehrveranstaltungen
Wintersemester 2026
-
051080 LP Softwarepraktikum mit Bachelorarbeit
-
051132 VO Einführung in Numerical Computing
-
052101 VU Numerical Algorithms
-
052112 VU Numerical High Performance Algorithms
-
053021 LP Praktikum Informatik 1
-
053031 LP Praktikum Informatik 2
-
053049 SE Masterseminar
-
500500 SE Doktoranden Forschungsseminar - Algorithms and Computing
-
500501 SE Doktoranden Forschungsseminar - Data and Knowledge
Sommersemester 2026
-
051080 LP Softwarepraktikum mit Bachelorarbeit
-
052101 VU Numerical Algorithms
-
053021 LP Praktikum Informatik 1
-
053031 LP Praktikum Informatik 2
-
053049 SE Masterseminar
-
500500 SE Doktoranden Forschungsseminar - Algorithms and Computing
-
500501 SE Doktoranden Forschungsseminar - Data and Knowledge
Wintersemester 2025
-
051080 LP Softwarepraktikum mit Bachelorarbeit
-
051132 VO Einführung in Numerical Computing
-
052101 VU Numerical Algorithms
-
053021 LP Praktikum Informatik 1
-
053031 LP Praktikum Informatik 2
-
500500 SE Doktoranden Forschungsseminar - Algorithms and Computing
-
500501 SE Doktoranden Forschungsseminar - Data and Knowledge
Publikationen
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. / Pachajoa, Carlos; Levonyak, Markus; Gansterer, Wilfried (Korresp. Autor*in) et al.
Proceedings of the 48th International Conference on Parallel Processing - ICPP 2019: Kyoto Japan August 5–8, 2019 . Association for Computing Machinery (ACM), 2019. S. 67:1-67:10 a67 (ACM International Conference Proceeding Series (ICPS), Band 2019).
Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed
Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. / Casas, Marc; Gansterer, Wilfried (Korresp. Autor*in); Wimmer, Elias.
in: International Journal of High Performance Computing Applications (S A H P C), Band 33, Nr. 2, 01.03.2019, S. 366-383.
Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed
Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes. / Pachajoa, Carlos; Pacher, Christina; Gansterer, Wilfried (Korresp. Autor*in).
Proceedings of FTXS 2019: Fault Tolerance for HPC at eXtreme Scale Workshop: held in conjunction with SC19: the International Conference for High Performance Computing, Networking, Storage and Analysis, Denver, Colorado, November 17-22, 2019. Piscataway, NJ: IEEE, 2019. S. 31-40.
Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed
Extending and Evaluating Fault-Tolerant Preconditioned Conjugate Gradient Methods. / Pachajoa, Carlos; Levonyak, Markus; Gansterer, Wilfried (Korresp. Autor*in).
PROCEEDINGS OF FTXS 2018: IEEE/ACM 8TH WORKSHOP ON FAULT TOLERANCE FOR HPC AT EXTREME SCALE (FTXS). 2018. S. 49-58.
Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed
On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures. / Pachajoa, Carlos; Gansterer, Wilfried (Korresp. Autor*in).
Euro-Par 2017: Parallel Processing Workshops - Euro-Par 2017 International Workshops. Hrsg. / DB Heras; L Bouge; G Mencagli; E Jeannot; R Sakellariou; RM Badia; JG Barbosa; L Ricci; SL Scott; S Lankes; J Weidendorfer. 2018. S. 569-580.
Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed
Fault tolerant communication-optimal 2.5D matrix multiplication. / Moldaschl, Michael; Prikopa, Karl; Gansterer, Wilfried (Korresp. Autor*in).
in: Journal of Parallel and Distributed Computing, Band 104, 06.2017, S. 179-190.
Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed
Parallel iterative refinement linear least squares solvers based on all-reduce operations. / Prikopa, Karl E.; Gansterer, Wilfried N. (Korresp. Autor*in); Wimmer, Elias.
in: Parallel Computing, Band 57, 09.2016, S. 167-184.
Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed
Understanding the information flow of ACO-accelerated gossip algorithms. / Janecek, Andreas; Gansterer, Wilfried (Korresp. Autor*in).
Advances in Swarm Intelligence : 7th International Conference, ICSI 2016, Bali, Indonesia, June 25-30, 2016, Proceedings, Part I. Hrsg. / Y Tan; Y Shi; B Niu. Springer, 2016. S. 426-433 (Lecture Notes in Computer Science, Band 9712).
Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed
Mining agile DNS traffic using graph analysis for cybercrime detection. / Berger, Andreas; D'Alconzo, Alessandro; Gansterer, Wilfried N. et al.
in: Computer Networks, Band 100, 08.05.2016, S. 28-44.
Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed
Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. / Sluciak, Ondrej; Straková, Hana; Rupp, Markus et al.
in: EURASIP Journal on Advances in Signal Processing, Band 2016, Nr. 1, 25, 24.02.2016, S. 1-13.
Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed
Projekte
Algorithmic Data Science for Computational Drug Discovery
Resilience versus Performance in Numerical Linear Algebra
Vorträge
Algorithm-based Resilience in Scalable Conjugate Gradient Methods
A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods
Algorithm-based checkpoint-recovery for the conjugate gradient method
Node-Failure-Resistant Preconditioned Conjugate Gradient Method
Resilience for Large-Scale Iterative Linear Solvers
Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods
Node-failure-resistant preconditioned conjugate gradient method without replacement nodes
Extending a Preconditioned Conjugate Gradient Method Endowed with Resilience to Multiple Node Failures
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures
Comparing Randomized and Deterministic Approaches for Computing Low-rank Approximations
Fast Recovery from Node Failures for the Parallel Preconditioned Conjugate Gradient Method
Some Notes on Divide-and-Conquer Eigensolvers
Silent Data Corruption in Reduction and Matrix Multiplication
Silent Data Corruption in BLAS Kernels
Resilience Properties of Gossip-Style Algorithms
Analysis and Comparison of Truly Distributed Solvers for Linear Least Squares Problems on Wireless Sensor Networks
A Truly Distributed Iterative Refinement Linear Least Squares Solver
Resiliency and Reliability in Distributed Aggregation: From Theory to Practice
Improving Fault Tolerance and Accuracy of Distributed Reduction Algorithms
Distributed Reduction and Matrix Computations
Randomized Distributed Matrix Computations based on Gossiping
New Developments for the Block Divide-and-Conquer Eigensolver
A Fast Solver for Modeling the Evolution of Virus Populations
Scalable and Fault Tolerant Orthogonalization Based on Randomized Aggregation
Towards Distributed Matrix Computations Across Wireless Networks
Distributed Linear Solvers for Field Reconstruction
On Modelling the Evolution of Virus Populations
The EU Data Retentrion Directive 2006/24/EC from a Technical Perspective : general assembly of the Internet Service Provicers Austria
Grid Application Projects in CPAMMS : Status and Perspectives COST D37 Multi Working Group Meeting
Ab initio photodynamics calculations on the Grid: approaches and applications
A Reliable Component-Based Architecture for E-Mail Filtering : Second International Conference on Availability
High Performance Computing Challenges in Drug Design : Computational Life Sciences Seminar
Grid Computing - Middleware and other Central Aspects : Working group meeting of COST D37/001/06 PHOTODYN: Computational photochemistry and photobiology
Self-Learning and Fully Transparent UCE Prevention
Project Spam Defense - Status and Directions : presentation invited by the Internet Service Providers Austria
Project Spam Defense - Status and Outlook : presentation invited by the Internet Service Providers Austria
Weiter zu: Leitung & Team | Personensuche | Home