Sathya Peri

Orcid: 0000-0002-3471-7929

According to our database1, Sathya Peri authored at least 68 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improving Throughput and Fault Tolerance of Blockchain Nodes.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot.
CoRR, 2023

Learned Lock-free Search Data Structures.
CoRR, 2023

An Efficient Framework for Execution of Smart Contracts in Hyperledger Sawtooth.
CoRR, 2023

Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Wait-Free Updates and Range Search Using Uruv.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

DAG-Based Efficient Parallel Scheduler for Blockchains: Hyperledger Sawtooth as a Case Study.
Proceedings of the Euro-Par 2023: Parallel Processing - 29th International Conference on Parallel and Distributed Computing, Limassol, Cyprus, August 28, 2023

2022
An Improved/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs.
Int. J. Parallel Program., 2022

An efficient approach to achieve compositionality using optimized multi-version object based transactional systems.
Inf. Comput., 2022

FUSED-PAGERANK: Loop-Fusion based Approximate PageRank.
CoRR, 2022

DiPETrans: A framework for distributed parallel execution of transactions of blocks in blockchains.
Concurr. Comput. Pract. Exp., 2022

Achieving starvation-freedom in multi-version transactional memory systems.
Computing, 2022

A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality.
Proceedings of the 30th Euromicro International Conference on Parallel, 2022

A Self-stabilizing Minimum Average Stretch Spanning Tree Construction.
Proceedings of the Networked Systems - 10th International Conference, 2022

An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree.
Proceedings of the IEEE 15th International Conference on Cloud Computing, 2022

2021
An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs.
CoRR, 2021

OptSmart: A Space Efficient Optimistic Concurrent Execution of Smart Contracts.
CoRR, 2021

Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs.
Proceedings of the 29th Euromicro International Conference on Parallel, 2021

Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain✱.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020
Dynamic Graph Operations: A Consistent Non-blocking Approach.
CoRR, 2020

Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory.
Proceedings of the Networked Systems - 8th International Conference, 2020

Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree.
Proceedings of the 19th International Symposium on Parallel and Distributed Computing, 2020

2019
DiPETrans: A Framework for Distributed Parallel Execution of Transactions of Blocks in Blockchain.
CoRR, 2019

Obtaining Progress Guarantee and GreaterConcurrency in Multi-Version Object Semantics.
CoRR, 2019

Achieving Greater Concurrency in Execution of Smart Contracts using Object Semantics.
CoRR, 2019

STMs in practice: Partial rollback vs pure abort mechanisms.
Concurr. Comput. Pract. Exp., 2019

Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

An Efficient Framework for Optimistic Concurrent Execution of Smart Contracts.
Proceedings of the 27th Euromicro International Conference on Parallel, 2019

A Pragmatic Non-blocking Concurrent Directed Acyclic Graph.
Proceedings of the Networked Systems - 7th International Conference, 2019

A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

Entitling concurrency to smart contracts using optimistic transactional memory.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

An Efficient Practical Concurrent Wait-Free Unbounded Graph.
Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019

2018
A Concurrent Unbounded Wait-Free Graph.
CoRR, 2018

An Efficient Framework for Concurrent Execution of Smart Contracts.
CoRR, 2018

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries.
CoRR, 2018

Garbage Collection in Concurrent Sets.
CoRR, 2018

An Innovative Approach to Achieve Compositionality Efficiently Using Multi-version Object Based Transactional Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems.
Proceedings of the Networked Systems - 6th International Conference, 2018

2017
Non-interference and local correctness in transactional memory.
Theor. Comput. Sci., 2017

An Innovative Approach for Achieving Composability in Concurrent Systems using Multi-Version Object Based STMs.
CoRR, 2017

Building Efficient Concurrent Graph Object through Composition of List-based Set.
CoRR, 2017

Starvation Freedom in Multi-Version Transactional Memory Systems.
CoRR, 2017

Efficient means of Achieving Composability using Transactional Memory.
CoRR, 2017

Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench.
CoRR, 2017

Proving Correctness of Concurrent Objects by Validating Linearization Points.
CoRR, 2017

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016
Maintaining Acyclicity of Concurrent Graphs.
CoRR, 2016

Opacity proof for CaPR+ algorithm.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture.
CoRR, 2015

Multiversion Conflict Notion for Transactional Memory Systems.
CoRR, 2015

S-Gossip: Security Enhanced Gossip Protocol for Unstructured P2P Networks.
Proceedings of the Distributed Computing and Internet Technology, 2015

2014
A TimeStamp Based Multi-version STM Algorithm.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013
Correctness of concurrent executions of closed nested transactions in transactional memory systems.
Theor. Comput. Sci., 2013

A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness
CoRR, 2013

Multi-Version Conflict Notion.
CoRR, 2013

2012
On Non-Interference of Transactions
CoRR, 2012

An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference.
Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

SEPastry: Security Enhanced Pastry.
Proceedings of the Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India, 2012

2010
D2HT: The Best of Both Worlds, Integrating RPS and DHT.
Proceedings of the Eighth European Dependable Computing Conference, 2010

2008
Improving the Efficacy of a Termination Detection Algorithm.
J. Inf. Sci. Eng., 2008

2007
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set.
IEEE Trans. Parallel Distributed Syst., 2007

A family of optimal termination detection algorithms.
Distributed Comput., 2007

2005
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies.
Proceedings of the Distributed Computing, 18th International Conference, 2004

On Termination Detection in an Asynchronous Distributed System.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004


  Loading...