DistMaP SIGNED
Distributed and Massively Parallel Graph Algorithms
Total Cost €
0EC-Contrib. €
0Partnership
0Views
0DistMaP project word cloud
Explore the words cloud of the DistMaP project. It provides you a very rough idea of what is the project "DistMaP" about.
Project "DistMaP" data sheet
The following table provides information about the project.
| Coordinator |
EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Organization address contact info |
| Coordinator Country | Switzerland [CH] |
| Total cost | 1˙498˙250 € |
| EC max contribution | 1˙498˙250 € (100%) |
| Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
| Code Call | ERC-2019-STG |
| Funding Scheme | ERC-STG |
| Starting year | 2019 |
| Duration (year-month-day) | from 2019-11-01 to 2024-10-31 |
Partnership
Take a look of project's partnership.
| # | ||||
|---|---|---|---|---|
| 1 | EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH | CH (ZUERICH) | coordinator | 1˙498˙250.00 |
Map
Project objective
With the rapidly growing size of the data and the pervasiveness of distributed systems and networks, it is a certainty that distributed and parallel computations will play a vital role in the computations of the future. This project aims to advance our understanding of the foundational aspects of these areas. We tackle some of the central questions in distributed algorithms and massively parallel algorithms for graph problems, which require us to go well-beyond the current state of the art. Our research plan involves three directions:
- Developing efficient and particularly polylogarithmic-time deterministic distributed algorithms for some of the central graph problems of the area. Our hope is to do this through a general derandomization method that removes the randomness from efficient randomized algorithms. This question underlies some of the well-known open problems of the area.
- Developing improved and particularly sublogarithmic-time randomized distributed algorithms for some of the central local graph problems of the area, thus hopefully narrowing or ideally closing this decade old gap to the respective lower bounds.
- Developing improved massively parallel algorithms for some of the fundamental graph problems, with a special focus on the challenging regime of lower memory machines, which remains widely open.
Given the high risk nature of these questions, in each direction, besides our plan of attack on the bigger and more ambitious objectives, we also explain a number of smaller problems, which should be more feasible, and which would serve as stepping stones toward the bigger goal. Moreover, we are hopeful that the simultaneous study of distributed algorithms and massively parallel will lead to a strengthening of the connections between these two areas and would also bring the related scientific communities closer to each other.
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "DISTMAP" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "DISTMAP" are provided by the European Opendata Portal: CORDIS opendata.