1 citations · 1 across the 2 of their papers we have counts for
5 papers
BottleMod: Modeling Data Flows and Tasks for Fast Bottleneck Analysis
Ansgar Lößer, Joel Witzke, Florian Schintke +1
In the recent years, scientific workflows gained more and more popularity. In scientific workflows, tasks are typically treated as black boxes. Dealing with their complex interrela…
Transactions on Red-black and AVL trees in NVRAM
Thorsten Schütt, Florian Schintke, Jan Skrzypczak
Byte-addressable non-volatile memory (NVRAM) supports persistent storage with low latency and high bandwidth. Complex data structures in it ought to be updated transactionally, so…
RMWPaxos: Fault-Tolerant In-Place Consensus Sequences
Jan Skrzypczak, Florian Schintke, Thorsten Schütt
Building consensus sequences based on distributed, fault-tolerant consensus, as used for replicated state machines, typically requires a separate distributed state for every new co…
Learned Clause Minimization in Parallel SAT Solvers
Marc Hartung, Florian Schintke
Learned clauses minimization (LCM) let to performance improvements of modern SAT solvers especially in solving hard SAT instances. Despite the success of LCM approaches in sequenti…
Linearizable State Machine Replication of State-Based CRDTs without Logs
Jan Skrzypczak, Florian Schintke, Thorsten Schütt
General solutions of state machine replication have to ensure that all replicas apply the same commands in the same order, even in the presence of failures. Such strict ordering in…