Maintenance of Strongly Connected Component in Shared-memory Graph
نویسنده
چکیده
In this paper, we present an on-line full dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads. To the the best of our knowledge, this is the first work to propose using linearizable concurrent directed graph and is build using both ordered and unordered list-based set. We provide an empirical comparison against sequential and course-grained. The results show our algorithm performance is similar to the lazy linked list and the throughput is increased between 3 to 6x depending on different workload distributions and applications. We believe that there are huge applications in the on-line graph. Finally, we show how the algorithm can be extended to community detection in on-line graph.
منابع مشابه
Planar Strong Connectivity
This paper shows that for a strongly connected planar directed graph of size n, a depth-rst search tree rooted a speciied vertex can be computed in O(log 5 n) time using n= logn processors. Previously, for planar directed graphs that may not be strongly connected, the best depth-rst search algorithm runs in O(log 10 n) time using n processors. Both algorithms run on a parallel random access mac...
متن کاملSelf-Stabilizing Mutual Exclusion on Directed Graphs
This paper investigates the complexity of self-stabilizing mutual exclusion protocols for distributed systems, where processors communicate through shared memory according to a strongly connected directed communication graph. Tchuente's approach of covering a network with one directed cycle is taken as point of departure. This protocol requires O(n 2n) states per processor together with some pr...
متن کاملA Comparison of the Performance of List Ranking and Connected Components Algorithms on SMP and MTA Shared-Memory Systems
Irregular problems such as those from graph theory pose serious challenges for parallel machines due to non-contiguous accesses to global data structures with low degrees of locality. Few parallel graph algorithms on distributedor shared-memory machines can outperform their best sequential implementation due to long memory latencies and high synchronization costs. In this paper, we consider the...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملConcurrent determination of connected components
The design is described of a parallel version of Tarjan’s algorithm for the determination of equivalence classes in graphs that represent images. Distribution of the vertices of the graph over a number of processes leads to a message passing algorithm. The algorithm is mapped to a shared-memory architecture by means of POSIX threads. It is applied to the determination of connected components in...
متن کامل