Uploaded January 2026 | Updated November 2026, 2 days ago
From FerriteCon 2025, the Ferrite.jl user & developer conference held on August 28, 2025 at the Technical University of Denmark (DTU). In this talk, Dennis Ogiermann (Ruhr-Universität Bochum) explores how element ordering and graph-based sorting techniques can significantly improve the performance of finite element simulations, especially on modern memory-bound computing architectures.
Finite element simulations often involve traversing mesh elements in an order determined by general-purpose mesh generators such as Gmsh. These orders can appear nearly random, which leads to poor cache reuse when accessing nodal data repeatedly. By reordering elements so that neighboring elements are visited consecutively — effectively solving a linear arrangement problem on the mesh’s connectivity graph — it becomes possible to improve data locality and reduce memory traffic.
In this session, Dennis demonstrates how the Gecko.jl package can be used to compute such optimized orderings and shows benchmark results indicating how graph sorting speeds up simulation runs. The core idea is to minimize a functional that reflects neighborhood relationships in the mesh, thus maximizing reuse of nodal information during assembly and solve loops.
This presentation is relevant for scientific computing practitioners, numerical analysts, and developers interested in performance optimization, mesh data structures, and leveraging the Julia ecosystem to build more efficient finite element workflows. Be sure to like, subscribe, and watch other presentations from FerriteCon 2025 for the latest in Julia-based FEM research and tools.
#FerriteCon2025 #Ferritejl #JuliaLang #FiniteElementMethod #PerformanceEngineering #GraphAlgorithms #SimulationSpeed
Join the channel to support the Julia Language project and access awesome perks!
youtube.com/channel/UC9IuUwwE2xdjQUT_LMLONoA/join
For more info on the Julia Programming Language, follow us on Twitter: twitter.com/JuliaLanguage and consider sponsoring us on GitHub: github.com/sponsors/JuliaLang
00:00 Welcome!
00:10 Help us add time stamps or captions to this video! See the description for details.
Want to help add timestamps to our YouTube videos to help with discoverability? Find out more here: github.com/JuliaCommunity/YouTubeVideoTimestamps
Interested in improving the auto generated captions? Get involved here: github.com/JuliaCommunity/YouTubeVideoSubtitles
From FerriteCon 2025, the Ferrite.jl user & developer conference held on August 28, 2025 at the Technical University of Denmark (DTU). In this talk, Dennis Ogiermann (Ruhr-Universität Bochum) explores how element ordering and graph-based sorting techniques can significantly improve the performance of finite element simulations, especially on modern memory-bound computing architectures.
Finite element simulations often involve traversing mesh elements in an order determined by general-purpose mesh generators such as Gmsh. These orders can appear nearly random, which leads to poor cache reuse when accessing nodal data repeatedly. By reordering elements so that neighboring elements are visited consecutively — effectively solving a linear arrangement problem on the mesh’s connectivity graph — it becomes possible to improve data locality and reduce memory traffic.
In this session, Dennis demonstrates how the Gecko.jl package can be used to compute such optimized orderings and shows benchmark results indicating how graph sorting speeds up simulation runs. The core idea is to minimize a functional that reflects neighborhood relationships in the mesh, thus maximizing reuse of nodal information during assembly and solve loops.
This presentation is relevant for scientific computing practitioners, numerical analysts, and developers interested in performance optimization, mesh data structures, and leveraging the Julia ecosystem to build more efficient finite element workflows. Be sure to like, subscribe, and watch other presentations from FerriteCon 2025 for the latest in Julia-based FEM research and tools.
#FerriteCon2025 #Ferritejl #JuliaLang #FiniteElementMethod #PerformanceEngineering #GraphAlgorithms #SimulationSpeed
Join the channel to support the Julia Language project and access awesome perks!
youtube.com/channel/UC9IuUwwE2xdjQUT_LMLONoA/join
For more info on the Julia Programming Language, follow us on Twitter: twitter.com/JuliaLanguage and consider sponsoring us on GitHub: github.com/sponsors/JuliaLang
00:00 Welcome!
00:10 Help us add time stamps or captions to this video! See the description for details.
Want to help add timestamps to our YouTube videos to help with discoverability? Find out more here: github.com/JuliaCommunity/YouTubeVideoTimestamps
Interested in improving the auto generated captions? Get involved here: github.com/JuliaCommunity/YouTubeVideoSubtitles






, built on byte-precise lowering and abstract interpretation. This year, we focus on the core design behind it: loading parts of user code to reuse Julias macro handling and compiler type inference. We compare this runtime-integrated approach with the overhauled LanguageServer.jl/JuliaWorkspaces.jl stack and demo its progress on real-world code.
At JuliaCon 2025, we introduced [JETLS.jl](https://github.com/aviatesk/JETLS.jl), then an early-alpha Julia language server built on [JET.jl](https://github.com/aviatesk/JET.jl)s abstract interpretation and [JuliaLowering.jl](https://github.com/JuliaLang/julia/tree/master/JuliaLowering)s byte-precise, provenance-tracking lowering. One year later, this talk goes beyond a progress report to examine the core design that makes this compiler-grounded analysis possible.
JETLS selectively loads parts of the target program into its analysis process. This runtime integration enables JuliaLowering to execute the program’s actual macros while preserving byte-precise source provenance, and JET to reuse Julia’s compiler inference to derive type information for source-level developer tooling.
We compare this design in depth with the [LanguageServer.jl](https://github.com/julia-vscode/LanguageServer.jl)/[JuliaWorkspaces.jl](https://github.com/julia-vscode/JuliaWorkspaces.jl) stack, which has undergone a major overhaul over the past year. Rather than presenting JETLS simply as a replacement, we place the two approaches on a spectrum of runtime integration: JETLS aims to provide precise information about macro expansion and lowering, together with compiler-inferred types, while the largely static approach prioritizes responsiveness and safety and benefits from greater production maturity.
These architectural differences become concrete in a live demo using real-world code from CSV.jl and JuliaFormatter.jl. We show how JETLSs runtime-integrated design translates into practical editor features, most of which were either early prototypes at last years talk or did not yet exist.
Finally, we summarize JETLSs current feature coverage, installation and environment isolation, and editor setup. We also briefly show how the same analysis is exposed through a CLI for CI and AI-agent workflows, showcasing agentic bugfixes drawn from a [Julia Base audit with JETLS](https://github.com/JuliaLang/julia/issues/62526).
Time permitting, we share performance measurements before outlining future work. JETLS: Bringing Julia’s runtime into language-server analysis | Kadowaki, Pfitzner](https://i.ytimg.com/vi/m-K5Wij8Q38/mqdefault.jpg)



