Centrum Informat. Trójmiejskiej Akadem.Sieci Komputerowej - Jednostki Administracyjne - MOST Wiedzy

Wyszukiwarka

Centrum Informat. Trójmiejskiej Akadem.Sieci Komputerowej

Filtry

wszystkich: 35

  • Kategoria
  • Rok
  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Katalog Publikacji

Rok 2023
Rok 2022
Rok 2021
  • All-gather Algorithms Resilient to Imbalanced Process Arrival Patterns

    Two novel algorithms for the all-gather operation resilient to imbalanced process arrival patterns (PATs) are presented. The first one, Background Disseminated Ring (BDR), is based on the regular parallel ring algorithm often supplied in MPI implementations and exploits an auxiliary background thread for early data exchange from faster processes to accelerate the performed all-gather operation. The other algorithm, Background Sorted...

    Pełny tekst do pobrania w portalu

  • Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns

    The Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain edge cases in the original pseudocode and description, i.e., adding another state of a process, improved cache friendliness more precise complexity estimations and some other issues improving the robustness of the algorithm implementation....

    Pełny tekst do pobrania w portalu

  • Total chromatic sum for trees
    Publikacja

    - Rok 2021

    The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2020
Rok 2019