André Brinkmann

André Brinkmann

Auto-generated profile, based on publicly available information

André Brinkmann

Saarland University, Saarbrücken, Germany

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2009
Verified
Conference Paper
Open access
PDF file
DMDirk Meister
Dirk Meister
ABAndré Brinkmann
André Brinkmann
Data deduplication systems detect redundancies between data blocks to either reduce storage needs or to reduce network traffic. A class of deduplication systems splits the data stream into data blocks (chunks) and then finds exact duplicates of these blocks. This paper compares the influence of different chunking approaches on multiple levels. On a macroscopic level, we compare the chunking approaches based on real-life user data in a weekly full backup scenario, both at a single point in time as well as over several weeks. In addition, we analyze how small changes affect the deduplication ratio for different file types on a microscopic level for chunking approaches and delta encoding. An intuitive assumption is that small semantic changes on documents cause only small modifications in the binary representation of files, which would imply a high ratio of deduplication. We will show that this assumption is not valid for many important file types and that application-specific chunking can help to further decrease storage capacity demands.

1 November 2012
Verified
Conference Paper
Closed access
DMDirk Meister
Dirk Meister
JKJurgen Kaiser
Jurgen Kaiser
ABAndre Brinkmann
Andre Brinkmann
TCToni Cortes
Toni Cortes
MKMichael Kuhn
Michael Kuhn
JKJulian Kunkel
Julian Kunkel
Deduplication is a storage saving technique that is highly successful in enterprise backup environments. On a file system, a single data block might be stored multiple times across different files, for example, multiple versions of a file might exist that are mostly identical. With deduplication, this data replication is localized and redundancy is removed -- by storing data just once, all files that use identical regions refer to the same unique data. The most common approach splits file data into chunks and calculates a cryptographic fingerprint for each chunk. By checking if the fingerprint has already been stored, a chunk is classified as redundant or unique. Only unique chunks are stored. This paper presents the first study on the potential of data deduplication in HPC centers, which belong to the most demanding storage producers. We have quantitatively assessed this potential for capacity reduction for 4 data centers (BSC, DKRZ, RENCI, RWTH). In contrast to previous deduplication studies focusing mostly on backup data, we have analyzed over one PB (1212 TB) of online file system data. The evaluation shows that typically 20% to 30% of this online data can be removed by applying data deduplication techniques, peaking up to 70% for some data sets. This reduction can only be achieved by a subfile deduplication approach, while approaches based on whole-file comparisons only lead to small capacity savings.

17 January 2020 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
MVMarc-André Vef
Marc-André Vef
NMNafiseh Moti
Nafiseh Moti
TSTim Süß
Tim Süß
MTMarkus Tacke
Markus Tacke
TTTommaso Tocci
Tommaso Tocci
ABAndré Brinkmann
André Brinkmann

8 November 2023 in Quantum
Verified
Journal Article
Open access
PDF file
FKFabian Kreppel
Fabian Kreppel
CMChristian Melzer
Christian Melzer
DMDiego Olvera Millán
Diego Olvera Millán
JWJanis Wagner
Janis Wagner
JHJanine Hilder
Janine Hilder
ABAndré Brinkmann
André Brinkmann
The increasing capabilities of quantum computing hardware and the challenge of realizing deep quantum circuits require fully automated and efficient tools for compiling quantum circuits. To express arbitrary circuits in a sequence of native gates specific to the quantum computer architecture, it is necessary to make algorithms portable across the landscape of quantum hardware providers. In this work, we present a compiler capable of transforming and optimizing a quantum circuit targeting a shuttling-based trapped-ion quantum processor. It consists of custom algorithms set on top of the quantum circuit framework Pytket. The performance was evaluated for a wide range of quantum circuits and the results show that the gate counts can be reduced by factors up to 5.1 compared to standard Pytket and up to 2.2 compared to standard Qiskit compilation.

19 May 2014 in Journal of Chemical Theory and Computation
Verified
Journal Article
Closed access
JKJens Krüger
Jens Krüger
RGRichard Grunzke
Richard Grunzke
SGSandra Gesing
Sandra Gesing
SBSebastian Breuers
Sebastian Breuers
ABAndré Brinkmann
André Brinkmann
SHSonja Herres-Pawlis
Sonja Herres-Pawlis

1 May 2010
Verified
Conference Paper
Closed access
DMDirk Meister
Dirk Meister
ABAndre Brinkmann
Andre Brinkmann
Data deduplication systems discover and remove redundancies between data blocks. The search for redundant data blocks is often based on hashing the content of a block and comparing the resulting hash value with already stored entries inside an index. The limited random IO performance of hard disks limits the overall throughput of such systems, if the index does not fit into main memory. This paper presents the architecture of the dedupv1 dedupli-cation system that uses solid-state drives (SSDs) to improve its throughput compared to disk-based systems. dedupv1 is designed to use the sweet spots of SSD technology (random reads and sequential operations), while avoiding random writes inside the data path. This is achieved by using a hybrid deduplication design. It is an inline deduplication system as it performs chunking and fingerprinting online and only stores new data, but it is able to delay much of the processing as well as IO operations.