Project description
Scalable algorithms for parallel computing
The digital revolution has profoundly changed science, engineering and everyday life. Computer applications process continuously increasing data volumes with ever more complex algorithms. Progress is in danger of reaching its limits: scalability of the programmes – their capacity to grow with their tasks – represents a major challenge. To solve bigger problems, many processors have to be used in parallel. The EU-funded ScAlBox project will work on algorithms and software libraries for basic software components that can be used in various ways and scaled to datasets of any size and millions of processors operating in parallel. Such components include searching, sorting, queueing administration, work distribution to parallel processors and communication between processes. This will also include processing complex relations between a large numbers of objects (graphs).
Objective
ScAlBox aims at basic algorithmic tools that can be used in a wide spectrum of applications and that scale orders of magnitude better than the state of the art with respect to input size or number of processors.
In the last decades, we witness the transition into the information age with profound effects on science, technology, and our daily life. This transition is driven by a growing spectrum of computer applications that process larger and larger data sets using increasingly complex algorithms. However, the scalability challenge has emerged as a major road block to this progress:
An explosion of the amount of data to be processed (big data) coincides with stagnating performance of a single processor core. This widening performance gap can only be closed using many parallel processors. However, parallel algorithms have long been neglected by algorithm theory while heuristic software development optimizes for existing machines and inputs but fails to give predictable scalability for future, larger data sets and more processors.
We want to overcome this roadblock by developing scalable solutions for the basic toolbox of algorithms and data structures that are needed in many applications (e.g. sorting, searching, queues, basic graph algorithms, collective communication, and load balancing). My goal is to provide algorithms and software libraries that scale to millions of processors and give hard performance guarantees for arbitrary inputs. This is challenging due to large gaps between theory and practice and because such algorithms have to integrate scalable fault tolerance and dynamic load balancing to an unprecedented extent. I am the right person to achieve this due to my extensive experience in parallel algorithms for irregular problems and my leading role in algorithm engineering that integrates modeling, design, theoretical analysis, implementation, and experimental evaluation.
Fields of science (EuroSciVoc)
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
You need to log in or register to use this function
We are sorry... an unexpected error occurred during execution.
You need to be authenticated. Your session might have expired.
Thank you for your feedback. You will soon receive an email to confirm the submission. If you have selected to be notified about the reporting status, you will also be contacted when the reporting status will change.
Keywords
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Programme(s)
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
-
H2020-EU.1.1. - EXCELLENT SCIENCE - European Research Council (ERC)
MAIN PROGRAMME
See all projects funded under this programme
Topic(s)
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Funding Scheme
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
ERC-ADG - Advanced Grant
See all projects funded under this funding scheme
Call for proposal
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
(opens in new window) ERC-2019-ADG
See all projects funded under this callHost institution
Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.
76131 Karlsruhe
Germany
The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.