Academic Computer Centre TASK - Administrative Units - Bridge of Knowledge

Search

Academic Computer Centre TASK

Filters

total: 35

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Publications

Year 2023
Year 2022
Year 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...

    Full text available to download

  • 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....

    Full text available to download

  • Total chromatic sum for trees
    Publication

    - Year 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.

    Full text to download in external service

Year 2020
Year 2019