Abstract
In the past year, the project “Scalable Discrete Algorithms for Big Data Applications” dealt with High-Performance SAT Solving, Malleable Job Scheduling and Load Balancing, and Fault-Tolerant Algorithms. We used the massively parallel nature of ForHLR II to obtain novel results in the areas of SAT solving and faulttolerant algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Hespe, D., Hübner, L., Hübschle-Schneider, L., Sanders, P., Schreiber, D. (2023). Scalable discrete algorithms for big data applications. In: Nagel, W.E., Kröner, D.H., Resch, M.M. (eds) High Performance Computing in Science and Engineering '21. HPCSE 2021. Springer, Cham. https://doi.org/10.1007/978-3-031-17937-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-17937-2_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-17936-5
Online ISBN: 978-3-031-17937-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)