Funding: SFB 901, TP A1 und C1, 2011-2019
Here we investigate methods to design and develop distributed algorithms and data structures that are highly scalable. One major requirement towards these methods is an applicability in completely decentralized and highly dynamic systems, i.e., an ability to react to system changes with little effort. Additionally, we want to emphasize the robustness of our methods, i.e., they are able to recover from an illegal state to a legal state of that algorithm/ data structure even when parts of the system behave erroneous or adversarial during the recovery phase.
Further informations here.