Engineering Scalable Algorithms for the Basic Toolbox ScAlBox

Información del proyecto

ScAlBox

Identificador del acuerdo de subvención: 882500

DOI

10.3030/882500

Proyecto cerrado

Fecha de la firma de la CE 3 Julio 2020

Fecha de inicio 1 Septiembre 2020

Fecha de finalización 31 Agosto 2025

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 2 498 785,00

Aportación de la UE

€ 2 498 785,00

Coordinado por

KARLSRUHER INSTITUT FUER TECHNOLOGIE
Germany

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Peer reviewed articles (6)

Weighted Embeddings for Low-Dimensional Graph Representation

Autores: Thomas Bläsius, Jean-Pierre Von der Heydt, Maximilian Katzmann, Nikolai Maas
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, Edición 39, 2025, Página(s) 15587-15595, ISSN 2374-3468
Editor: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v39i15.33711

Lilotane : A Lifted SAT-based Approach to Hierarchical Planning

Autores: Schreiber, Dominik
Publicado en: Journal of Artificial Intelligence Research, Edición 70, 2021, Página(s) 1117–1181, ISSN 1076-9757
Editor: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12520

The 2023 International Planning Competition

Autores: Ayal Taitler, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fišer, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia‐Aguas, Jendrik Seipp
Publicado en: AI Magazine, Edición 45, 2024, Página(s) 280-296, ISSN 0738-4602
Editor: American Association for Artificial Intelligence (AAAI) Press
DOI: 10.1002/aaai.12169

MallobSat: Scalable SAT Solving by Clause Sharing

Autores: Dominik Schreiber, Peter Sanders
Publicado en: Journal of Artificial Intelligence Research, Edición 80, 2024, Página(s) 1437-1495, ISSN 1076-9757
Editor: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.15827

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling

Autores: Sanders, Peter; Schreiber, Dominik
Publicado en: Journal of Open Source Software, Edición 7(76), 2022, Página(s) 4591, ISSN 2475-9066
Editor: JOSS
DOI: 10.21105/joss.04591

More Recent Advances in (Hyper)Graph Partitioning

Autores: Çatalyürek, Ümit V.; Devine, Karen D.; Fonseca Faraj, Marcelo; Gottesbüren, Lars; Heuer, Tobias; Meyerhenke, Henning; Sanders, Peter; Schlag, Sebastian; Schulz, Christian; Seemaier, Daniel; Wagner, Dorothea
Publicado en: ACM Computing Surveys, Edición Volume 55, Edición 12, 2022, Página(s) 1--38, ISSN 0360-0300
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3571808

Conference proceedings (31)

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions

Autores: Bez, Dominik; Kurpicz, Florian; Lehmann, Hans-Peter; Sanders, Peter
Publicado en: 31st Annual European Symposium on Algorithms (ESA 2023), Edición 274, 2023, Página(s) 19:1-19:16, ISBN 978-3-95977-295-2
Editor: "Schloss Dagstuhl - Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2023.19

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI

Autores: Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl
Publicado en: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Página(s) 289-291
Editor: ACM
DOI: 10.1145/3626183.3660260

Linear-Time Multilevel Graph Partitioning

Autores: Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier
Publicado en: 2025
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2025.32

Faster Block Tree Construction

Autores: Köppl, Dominik; Kurpicz, Florian; Meyer, Daniel
Publicado en: 31st Annual European Symposium on Algorithms (ESA 2023), Edición 274, 2023, Página(s) 74:1-74:20, ISBN 978-3-95977-295-2
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.74

A Simple yet Exact Analysis of the MultiQueue

Autores: Stefan Walzer, Marvin Williams
Publicado en: 2025
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2025.85

A Sweep-Plane Algorithm for Calculating the Isolation of Mountains

Autores: Funke, Daniel; Hüning, Nicolai; Sanders, Peter
Publicado en: 31st Annual European Symposium on Algorithms (ESA 2023), Edición 274, 2023, Página(s) 51:1-51:17, ISBN 978-3-95977-295-2
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.51

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers

Autores: Michaelson, Dawn; Schreiber, Dominik; Heule, Marijn M.J.; Kiesl-Reiter, Benjamin; Whalen, Mike W.
Publicado en: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2023), Edición 13993, 2023, Página(s) 348-366, ISBN 978-3-031-30822-2
Editor: Springer
DOI: 10.1007/978-3-031-30823-9_18

Distributed Deep Multilevel Graph Partitioning

Autores: Sanders, Peter; Seemaier, Daniel
Publicado en: Euro-Par 2023: Parallel Processing, Edición 29, 2023, Página(s) 443-457
Editor: Springer
DOI: 10.1007/978-3-031-39698-4_30

Tera-Scale Multilevel Graph Partitioning

Autores: Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders
Publicado en: 2025 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2025, Página(s) 285-296
Editor: IEEE
DOI: 10.1109/ipdps64566.2025.00033

Engineering a Distributed-Memory Triangle Counting Algorithm

Autores: Sanders, Peter; Uhl, Tim Niklas
Publicado en: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Edición 5, 2023, Página(s) 702-712, ISBN 979-8-3503-3767-9
Editor: IEEE
DOI: 10.1109/ipdps54959.2023.00076

Scalable SAT Solving on Demand (Abstract)

Autores: Dominik Schreiber, Peter Sanders
Publicado en: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024, Página(s) 11-12
Editor: ACM
DOI: 10.1145/3670684.3673414

Engineering MultiQueues: Fast relaxed concurrent priority queues

Autores: Williams, Marvin; Sanders, Peter; Dementiev, Roman
Publicado en: 29th Annual European Symposium on Algorithms (ESA 2021), Edición 81, 2021, Página(s) 1-17, ISBN 978-3-95977-204-4
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI)
DOI: 10.4230/lipics.esa.2021.81

Scalable SAT Solving in the Cloud

Autores: Schreiber, Dominik; Sanders, Peter
Publicado en: Theory and Applications of Satisfiability Testing – SAT 2021, Edición 24, 2021, Página(s) 518-534, ISBN 978-3-030-80223-3
Editor: Springer
DOI: 10.1007/978-3-030-80223-3_35

Trusted Scalable SAT Solving with On-The-Fly LRAT Checking

Autores: Dominik Schreiber
Publicado en: 2024
Editor: Schloss Dagstuhl – Leibniz Zentrum für Informatik
DOI: 10.4230/lipics.sat.2024.25

PaCHash: Packed and Compressed Hash Tables

Autores: Kurpicz, Florian; Lehmann, Hans-Peter; Sanders, Peter
Publicado en: 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2023, Página(s) 162--175, ISBN 978-1-61197-756-1
Editor: SIAM: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977561.ch14

Deep multilevel graph partitioning

Autores: Gottesbüren, Lars; Heuer, Tobias; Sanders, Peter; Schulz, Christian; Seemaier, Daniel
Publicado en: 29th Annual European Symposium on Algorithms (ESA 2021), Edición 48, 2021, Página(s) 1-17, ISBN 978-3-95977-204-4
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI)
DOI: 10.5445/ir/1000138388

Mallob{32,64,1600} in the SAT Competition 2023

Autores: Schreiber, Dominik
Publicado en: Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions, 2023, Página(s) 46-47
Editor: University of Helsinki

Bit-Parallel (Compressed) Wavelet Tree

Autores: Dinklage, Patrick; Fischer, Johannes; Kurpicz, Florian; Tarnowski, Jan-Philipp
Publicado en: 2023 Data Compression Conference (DCC), 2023, Página(s) 81-90, ISBN 979-8-3503-4795-1
Editor: IEEE
DOI: 10.1109/dcc55655.2023.00016

Exploring Parallel MPI Fault Tolerance Mechanisms for Phylogenetic Inference with RAxML-NG.

Autores: Lukas Hübner; Alexey M. Kozlov; Demian Hespe; Peter Sanders; Alexandros Stamatakis; Alexandros Stamatakis
Publicado en: ISSN: 1367-4803, 1460-2059, Edición 1, 2021
Editor: Oxford University Press
DOI: 10.1093/bioinformatics/btab399

Fast and Lightweight Distributed Suffix Array Construction

Autores: Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek
Publicado en: 2025
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2025.47

Scalable Distributed String Sorting

Autores: Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Publicado en: 2024
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.83

Brief Announcement: Scalable Distributed String Sorting

Autores: Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Publicado en: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Página(s) 375-377
Editor: ACM
DOI: 10.1145/3626183.3660256

Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines

Autores: Matthew Akram, Dominik Schreiber
Publicado en: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Página(s) 137-139
Editor: ACM
DOI: 10.1145/3626183.3660268

Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors

Autores: Kurpicz, Florian
Publicado en: Proceedings of the Twenty-Ninth International Symposium on String Processing and Information Retrieval (SPIRE), 2022, Página(s) 257–272, ISBN 978-3-031-20642-9
Editor: Springer
DOI: 10.1007/978-3-031-20643-6_19

Engineering Massively Parallel MST Algorithms

Autores: Sanders, Peter; Schimek, Matthias
Publicado en: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Edición 5, 2023, Página(s) 691-701, ISBN 979-8-3503-3767-9
Editor: IEEE
DOI: 10.1109/ipdps54959.2023.00075

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing

Autores: Lehmann, Hans-Peter; Sanders, Peter; Walzer, Stefan
Publicado en: 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2023, Página(s) 176-189, ISBN 978-1-61197-756-1
Editor: SIAM: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977561.ch15

KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI

Autores: Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders
Publicado en: SC24: International Conference for High Performance Computing, Networking, Storage and Analysis, 2024, Página(s) 1-21
Editor: IEEE
DOI: 10.1109/sc41406.2024.00050

Decentralized Online Scheduling of Malleable NP-hard Jobs

Autores: Sanders, Peter; Schreiber, Dominik
Publicado en: Euro-Par 2022: Parallel Processing, Edición 13440, 2022, Página(s) 119-135, ISBN 978-3-031-12596-6
Editor: Springer
DOI: 10.1007/978-3-031-12597-3_8

Buffered Streaming Edge Partitioning

Autores: Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier
Publicado en: 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sea.2024.5

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning

Autores: Peter Sanders, Daniel Seemaier
Publicado en: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Página(s) 443-445
Editor: ACM
DOI: 10.1145/3626183.3660257

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms

Autores: Hübner, Lukas; Hespe, Demian; Sanders, Peter; Stamatakis, Alexandros
Publicado en: 2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS), 2022, Página(s) 24-35, ISBN 978-1-6654-8848-8
Editor: IEEE
DOI: 10.1109/ftxs56515.2022.00008

Book chapters (4)

Concepts for Designing Modern C++ Interfaces for MPI

Autores: C. Nicole Avans, Alfredo A. Correa, Sayan Ghosh, Matthias Schimek, Joseph Schuchart, Anthony Skjellum, Evan D. Suggs, Tim Niklas Uhl
Publicado en: Lecture Notes in Computer Science, Recent Advances in the Message Passing Interface, 2025, Página(s) 165-183
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-032-07194-1_10

Parallel Unconstrained Local Search for Partitioning Irregular Graphs

Autores: Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
Publicado en: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2024, Página(s) 32-45
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977929.3

Deterministic Parallel High-Quality Hypergraph Partitioning

Autores: Robert Krause, Lars Gottesbüren, Nikolai Maas
Publicado en: 2025 Proceedings of the Conference on Applied and Computational Discrete Algorithms (ACDA), 2025, Página(s) 222-236
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978759.17

Engineering Optimal Parallel Task Scheduling

Autores: Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
Publicado en: 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2025, Página(s) 168-180
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978339.14

Other (1)

A Simple yet Exact Analysis of the MultiQueue

Autores: Stefan Walzer, Marvin Williams
Publicado en: 2024
Editor: ArXiv
DOI: 10.48550/arxiv.2410.08714