358 citations · 371 across the 9 of their papers we have counts for
12 papers
Parallel Overhead LSD Radix Sort
Robert Clausecker, Florian Schintke
We present Radsort, a variant of LSD radix sort, sorting data with additional space. Radsort is stable, admits a simple implementation and is easy to parallel…
Demonstrating CBM Capabilities by Baryon Reconstruction in Ni+Ni Collisions with the mCBM Experiment at SIS18 of GSI/FAIR
CBM Collaboration, A. Agarwal, Z. Ahammed +338
The Compressed Baryonic Matter (CBM) experiment at the upcoming Facility for Antiproton and Ion Research (FAIR) is a high-rate fixed-target experiment designed to investigate nucle…
Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD
Robert Clausecker, Daniel Lemire, Florian Schintke
The positional population count operation pospopcnt() counts for an array of w-bit words how often each of the w bits was set. Various applications in bioinformatics, database engi…
Low-level I/O Monitoring for Scientific Workflows
Joel Witzke, Ansgar Lößer, Vasilis Bountris +2
While detailed resource usage monitoring is possible on the low-level using proper tools, associating such usage with higher-level abstractions in the application layer that actual…
CAWL: A Cache-aware Write Performance Model of Linux Systems
Masoud Gholami, Florian Schintke
The performance of data intensive applications is often dominated by their input/output (I/O) operations but the I/O stack of systems is complex and severely depends on system spec…
Validity Constraints for Data Analysis Workflows
Florian Schintke, Ninon De Mecquenem, David Frantz +9
Porting a scientific data analysis workflow (DAW) to a cluster infrastructure, a new software stack, or even only a new dataset with some notably different properties is often chal…
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…
Challenges in QCD matter physics - The Compressed Baryonic Matter experiment at FAIR
CBM Collaboration, T. Ablyazimov, A. Abuhoza +585
Substantial experimental and theoretical efforts worldwide are devoted to explore the phase diagram of strongly interacting matter. At LHC and top RHIC energies, QCD matter is stud…