Local Checking, Solving, and Mending—New Perspectives of Distributed Computing (LocalMend)

Project Details

Description

Modern large-scale communication networks consist of a large number of computers that are connected to each other through communication channels. The computers can solve challenging tasks in collaboration so that the devices exchange messages with each other and each computer solves its own part of the task. A program that controls such a network is called a distributed algorithm. In this project we study which computational tasks can be solved rapidly with distributed algorithms, and which computational tasks are such that solving them with any distributed algorithm will necessarily take a long time. A central question is whether it is sufficient that the computers exchange information only with other computers in their vicinity, or if it is necessary to transmit data over a long distance from one end of the network to another. A theory of such systems will help us to understand not only man-made communication networks but also systems that occur in nature.
AcronymLocalMend /Suomela
StatusActive
Effective start/end date01/09/202031/08/2024

Collaborative partners

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
  • Distributed half-integral matching and beyond

    Dahal, S. & Suomela, J., 8 Jan 2024, In: Theoretical Computer Science. 982, 114278.

    Research output: Contribution to journalArticleScientificpeer-review

    Open Access
    File
    3 Downloads (Pure)
  • Distributed Half-Integral Matching and Beyond

    Dahal, S. & Suomela, J., 2023, Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Proceedings. Rajsbaum, S., Rajsbaum, S., Balliu, A., Olivetti, D. & Daymude, J. J. (eds.). Springer, p. 339-356 18 p. (Lecture Notes in Computer Science; vol. 13892).

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    1 Citation (Scopus)
    17 Downloads (Pure)
  • Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms

    Akbari, A., Eslami, N., Lievonen, H., Melnyk, D., Särkijärvi, J. & Suomela, J., 5 Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 20 p. 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    Open Access
    File
    1 Citation (Scopus)
    2 Downloads (Pure)