1 citations · 1 across the 7 of their papers we have counts for
12 papers · 1 filter
An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree
Parwat Singh Anjana, Adithya Rajesh Chandrassery, Sathya Peri
Replicated tree data structures are extensively used in collaborative applications and distributed file systems, where clients often perform move operations. Local move operations…
An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs
Hemalatha Eedi, Sahith Karra, Sathya Peri +2
PageRank is a well-known algorithm whose robustness helps set a standard benchmark when processing graphs and analytical problems. The PageRank algorithm serves as a standard for m…
OptSmart: A Space Efficient Optimistic Concurrent Execution of Smart Contracts
Parwat Singh Anjana, Sweta Kumari, Sathya Peri +2
Popular blockchains such as Ethereum and several others execute complex transactions in blocks through user-defined scripts known as smart contracts. Serial execution of smart cont…
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…
An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems
Chirag Juyal, Sandeep Kulkarni, Sweta Kumari +2
In the modern era of multi-core systems, the main aim is to utilize the cores properly. This utilization can be done by concurrent programming. But developing a flawless and well-o…
Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems
Chirag Juyal, Sandeep Kulkarni, Sweta Kumari +2
To utilize the multi-core processors properly concurrent programming is needed. Concurrency control is the main challenge while designing a correct and efficient concurrent program…