English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we present multi-threaded algorithms for graph coloringsuitable to the shared memory programming model. We modify an existingalgorithm widely used in the literature and prove the correctness of themodified algorithm. We also propose a new approach to solve the problem ofcoloring using locks. Using datasets from real world graphs, we evaluate theperformance of the algorithms on the Intel platform. We compare the performanceof the sequential approach v/s our proposed approach and analyze the speedupobtained against the existing algorithm from the literature. The results showthat the speedup obtained is consequential. We also provide a direction forfuture work towards improving the performance further in terms of differentmetrics.

Multi-threaded Graph Coloring Algorithm for Shared Memory Architecture