Search

Current filters:

Current filters:

Author

Subject

Date issued

Has File(s)

Search Results

Results 1-1 of 1 (Search time: 0.0 seconds).
  • <<
  • 1
  • >>
  • Authors: Christina, Giannoula; Athanasios, Peppas; Georgios, Goumas;  Advisor: -;  Co-Author: - (2023)

    Graph coloring is widely used to parallelize scientific applications by identifying subsets of independent tasks that can be executed simultaneously. Graph coloring assigns colors the vertices of a graph, such that no adjacent vertices have the same color. The number of colors used corresponds to the number of parallel steps in a real-world end-application. Therefore, the total runtime of the graph coloring kernel adds to the overall parallel overhead of the real-world end-application, whereas the number of the vertices of each color class determines the number of the independent concurrent tasks of each parallel step, thus affecting the amount of parallelism and hardware resource utilization in the execution of the real-world end-application.