Admin message

Attention: i10git will shutdown soon!

This i10git GitLab server was migrated to gitos.rrze.fau.de due to hardware issues with the current host. This affects all production repositories, including waLBerla, lbmpy, pystencils and HyTeG.

Login: Gitos supports DFN-AAI and eduGAIN. If your institution does not support either, please use our GitHub mirrors.

Onboarding: All repositories belonging to groups were migrated. To regain access, first log in to gitos.rrze.fau.de once to activate your account. Then email cs10-admin@fau.de with your old i10git and your new gitos.rrze username (the @) as shown on your respective user profiles. We will reassign your accordingly. Note: Repositories from former courses (e.g. advpt) were not migrated.

Personal repositories in individual user namespaces were not migrated. Please export these yourself before the old server is shut down.

Expected shutdown by the end of 2026. Until then, the old i10git server will still be reachable with all repositories archived (read only). However, due to the ongoing hardware issues, it may remain unreliable and will receive no further maintenance.

The parent group is archived. This project and its data are read-only.
Feature Request
Planned Features ----------------- - Edge/Faces values for FVM - Loop transformations blocking, tilling for Phase-Field values - Loop reduction for LBM evaluation/debugging/output (i.e. max, sum ...) - LLVM?, PACXXX?? - LBM list kernel+++ - Vectorisierung - LROP (Sparse Phases) - Boundaries - CSE??? - Communication code for LBM - Layouts for LBM Planned Architecture --------------------- - Stage 1: ordered list of sympy equations, - this stage should remain unchanged (interface stability) - contains `Field.Access` objects - contains `sp.Piecewise` functions to represent ifs - in the future it might also contain reduction markers to do reductions in the same step as the computation. for example: a lattice boltzmann kernel somewhere computes velocity: a reduction can be defined to compute the maximal velocity over all cells - may also contain TypedSymbols i.e. sympy symbols that are annotated with their type - Stage 2: - Type untyped Symbols - Stage 3: AST with as few transformation done as possible - loops are written around equations - loop over all cells - indexed kernels: (x,y,z) is loaded from an index fields (struct support!) - KernelFunction node (which should be fully functional already, knows parameters etc) is the outermost node - field accesses are not yet resolved, however the loop counters are introduced to make relative to absolute indices ``f[1,-1]`` gets ``f[ctr0 + 1, ctr1 - 1]`` - Stage 4: Field accesses are resolved to pointer arithmetic - can be splitted into ``resolveArrayAccesses`` and ``resolveStructAccesses`` - no information should be lost in this stage, i.e. the Indexed nodes should still know their field - Stage 5: Typing of all expressions with a dict and insertion of cast nodes Transformations --------------- - move constants before loop (after stage 5) - cache blocking of loops (after stage 5) - loop peeling to make main loop pointer access aligned (after stage 5) - loop splitting for LBM split kernels (currently done after Stage 3, can this also be moved after stage 5?)
issue