1 citations · 4 across the 5 of their papers we have counts for
7 papers
Dynamic Graph Operations: A Consistent Non-blocking Approach
Bapi Chatterjee, Sathya Peri, Muktikanta Sa
Graph algorithms enormously contribute to the domains such as blockchains, social networks, biological networks, telecommunication networks, and several others. The ever-increasing…
A Concurrent Unbounded Wait-Free Graph
Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa
In this paper, we propose an efficient concurrent wait-free algorithm to construct an unbounded directed graph for shared memory architecture. To the best of our knowledge that thi…
A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries
Bapi Chatterjee, Sathya Peri, Muktikanta Sa +1
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- additi…
Maintenance of Strongly Connected Component in Shared-memory Graph
Muktikanta Sa
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertice…
Building Efficient Concurrent Graph Object through Composition of List-based Set
Sathya Peri, Muktikanta Sa, Nandini Singhal
In this paper, we propose a generic concurrent directed graph (for shared memory architecture) that is concurrently being updated by threads adding/deleting vertices and edges. The…
Proving Correctness of Concurrent Objects by Validating Linearization Points
Sathya Peri, Muktikanta Sa, Ajay Singh +2
Concurrent data structures or CDS such as concurrent stacks, queues, sets etc. have become very popular in the past few years partly due to the rise of multi-core systems. But one…