4 citations · 6 across the 4 of their papers we have counts for
5 papers
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…
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…
A Pragmatic Non-Blocking Concurrent Directed Acyclic Graph
Sathya Peri, Muktikanta Sa, Nandini Singhal
In this paper, we have developed two algorithms for maintaining acyclicity in a concurrent directed graph. The first algorithm is based on a wait-free reachability query and the se…
Multi-threaded Graph Coloring Algorithm for Shared Memory Architecture
Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram
In this paper, we present multi-threaded algorithms for graph coloring suitable to the shared memory programming model. We modify an existing algorithm widely used in the literatur…