Tag: Parallel Programming Languages
-
Programming complex workflows with PyCOMPSs
—
by
Programming large-scale systems poses several challenges to scientific application developers. Join us for a webinar on PyCOMPSs, a pioneering approach to task-based programming in Python that enables codes to be executed in distributed computing platforms. This webinar will give an overview of PyCOMPSs illustrated with examples in development at BSC that include CFD simulations with…
-
Introduction to the DLB Library
—
by
The Dynamic Load Balancing library is a runtime library that offers different capabilities to HPC users. It consists of three different modules that work collaboratively and independently: • Lend When Idle (LeWI) • Tracking Application Life Performance (TALP) • Dynamic Resource Ownership Management we will provide an overview of the DLB library and each one…
-
CEEC and the European Processor Initiative: An Explainer Podcast Episode
Check out the latest in our explainer series, this time in the form of a podcast episode from the newly rleased Supercomputing in Europe series!
-
Introduction to Computational Fluid Dynamics
—
by
Join our Anna Schwarz as one of the instructors for the reoccuring “Introduction to Computational Fluid Dynamics” course organized by HLRS, IAG (University of Stuttgart) and the Institute of Software Methods for Product Virtualisation (DLR).
-
What is CFD Part II
Check out the second part of the “What is CFD” explainer series, this time focusing on the computers in computational fluid dynamics!
-
Neko – a European code development effort shortlisted for the 2023 ACM Gordon Bell Prize
—
by
Come listen to our own Niclas Jansson talk about his work on NEKO, which has been shortlisted for the 2023 ACM Gordon Bell Prize. We have the great fortune of being able to build on this work during the cEEC project. Learn more in his interview at the LUMI stand (booth 206)!
-
Reliable and sustainable computations: An application-driven approach
—
by
In this talk, Roman Iakymchuk presents his work on accuracy and reproducibility assuring strategies for parallel iterative solvers that may not hold due to the non-associativity of floating-point operations. These strategies primarily rely on guarding every bit of result until final rounding, hence they can be costly. The energy consumption constraint for large-scale computing encourages…