Search results for "Data_FILES"
showing 10 items of 197 documents
Deduplication Potential of HPC Applications’ Checkpoints
2016
HPC systems contain an increasing number of components, decreasing the mean time between failures. Checkpoint mechanisms help to overcome such failures for long-running applications. A viable solution to remove the resulting pressure from the I/O backends is to deduplicate the checkpoints. However, there is little knowledge about the potential to save I/Os for HPC applications by using deduplication within the checkpointing process. In this paper, we perform a broad study about the deduplication behavior of HPC application checkpointing and its impact on system design.
Additional file 2 of Acceptability, reach and implementation of a training to enhance teachers’ skills in physical activity promotion
2020
Additional file 2. Acceptability items.
Additional file 2 of Acceptability, reach and implementation of a training to enhance teachers’ skills in physical activity promotion
2020
Additional file 2. Acceptability items.
Dynamic 2- and 3-connectivity on planar graphs
1992
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).
FASTA/Q data compressors for MapReduce-Hadoop genomics: space and time savings made easy
2021
Abstract Background Storage of genomic data is a major cost for the Life Sciences, effectively addressed via specialized data compression methods. For the same reasons of abundance in data production, the use of Big Data technologies is seen as the future for genomic data storage and processing, with MapReduce-Hadoop as leaders. Somewhat surprisingly, none of the specialized FASTA/Q compressors is available within Hadoop. Indeed, their deployment there is not exactly immediate. Such a State of the Art is problematic. Results We provide major advances in two different directions. Methodologically, we propose two general methods, with the corresponding software, that make very easy to deploy …
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
MOESM1 of The influence of oxygen and methane on nitrogen fixation in subarctic Sphagnum mosses
2018
Additional file 1. Supplementary tables and figures.
Additional file 1 of Evolutionary history of two cryptic species of northern African jerboas
2020
Additional file 1: Microsatellite optimization. Supplementary Tables and Figures.
Additional file 2 of Diversity and distribution of marine heterotrophic bacteria from a large culture collection
2020
Additional file 2. Includes all Supplementary Tables.
Additional file 6 of Low awareness and common misconceptions about schistosomiasis in endemic lowland areas in Western Ethiopia: a mixed-methods study
2021
Additional file 6: Related file 1 Reference lists.pdf