My List of Publications:
Journal Publications
•“DiPETrans: A framework for distributed parallel execution of transactions of blocks in blockchains”, Shrey Baheti, Parwat Singh Anjana, Sathya Peri, Yogesh Simmhan in CCPE 2022. [pdf] [slides]
•“An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems”, Chirag Juyal, Sandeep Kulkarni, Sweta Kumari, Sathya Peri and Archit Somani. In the special edition of Information and Computation 2021 Journal https://doi.org/10.1016/j.ic.2021.104696. Invited by SSS 2018 organizers for the paper “An Innovative Approach to Achieve Compositionality Efficiently using Multi-Version Object Based Transactional Systems”. [pdf]
•“Achieving Starvation-Freedom in Multi-Version Transactional Memory Systems”, Ved Chaudhary, Chirag Juyal, Sandeep Kulkarni, Sweta Kumari and Sathya Peri. Published in the special issue of Computing 2020. https://link.springer.com/article/10.1007%2Fs00607-021-00994-y. Invited by the organizers of Netys 2019 where the conference version of this paper was published. [pdf]
•“STMs in Practice: Partial Rollback vs Pure Abort Mechanisms”, Anshu S. Anand, R. K. Shyamasundar, Sathya Peri. Concurrency and Computation: Practice and Experience, 2018. https://doi.org/10.1002/cpe.4465.
•“Non-interference and local correctness in transactional memory”, Petr Kuznetsov and Sathya Peri, Theoretical Computer Science, 688: 103-116, 2017 [pdf].
•“Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems”, Sathya Peri and K.Vidyasankar. Theoretical Computer Science, 496:125-153, 2013 [pdf].
•“Improving the Efficacy of a Termination Detection Algorithm”, Sathya Peri and Neeraj Mittal, J. Inf. Sci. Eng., 24(1):159–174, 2008 [pdf].
•“A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set ”, Ranganath Atreya, Neeraj Mittal and Sathya Peri, IEEE Trans. Parallel Distrib. Syst.,18(10):1345–1360, 2007 [pdf].
•“A Family of Optimal Termination Detection Algorithms”, Neeraj Mittal, S. Venkatesan and Sathya Peri, Distributed Computing, 20(2):141–162, 2007 [pdf].
Conference/Workshop Publications
•“Enhancing QR Decomposition: A GPU-based Approach to Parallelizing the Householder Algorithm with CUDA Streams” by by Eshwar Uppu, Soumyajit Chatterjee, and Sathya Peri in International Conference on Distributed Computing and Information Technology (ICDCIT) 2025. This paper was awarded the Best Student Paper Award. [pdf]
•Short Paper: On Constructing a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers” by Ajay D. Kshemkalyani (Department of Computer Science, University of Illinois Chicago, United States) , Manaswini Piduguralla, Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India), Anshuman Misra (Department of Computer Science, University of Illinois Chicago, United States) in in the 26th International Conference on Distributed Computing and Networking (ICDCN) 2025. DOI: https://doi.org/10.1145/3700838.3700839. [pdf] [slides]
•"Short Paper: Unleashing Multicore Strength for Efficient Execution of Blockchain Transactions" by Ankit Ravish, Akshay Tejwani, Piduguralla Manaswini, Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India) in the International Conference on Distributed Computing and Information Technology (ICDCIT) 2025. DOI: https://doi.org/10.1007/978-3-031-81404-4_11 [pdf] [slides]
•“Kanva: A Lock-free Learned Search Data Structure” by Gaurav Bhardwaj (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India); Bapi Chatterjee, Abhinav Sharma (Department of Computer Science Engineering, Indraprastha Institute of Information Technology Delhi, India); Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology in ICPP 2024. DOI: https://doi.org/10.1145/3673038.3673082
•“Brief Announcement: Lock-free Learned Search Data Structure” by Gaurav Bhardwaj (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India); Bapi Chatterjee, Abhinav Sharma (Department of Computer Science Engineering, Indraprastha Institute of Information Technology Delhi, India); Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology in SPAA 2024. DOI: https://doi.org/10.1145/3626183.3660267
•“Concurrent Wait-Free Graph Snapshots using Multi-Versioning” by Gaurav Bhardwaj, Ayaz Ahmed and Sathya Peri in Netys 2024. DOI: https://doi.org/10.1007/978-3-031-67321-4_2 [pdf] [slides]
•“Doctoral Symposium: Improving Throughput and Fault Tolerance of Blockchain Nodes” by Manaswini Piduguralla, Souvik Sarkar, Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India) in ICDCN 2024. DOI:https://doi.org/10.1145/3631461.3632509.
•“Wait-Free Updates and Range Search using Uruv” Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee, and Sathya Peri in The 25th International Symposium on Stabilization, Safety, and Security (SSS) 2023, New Jersey, USA. [pdf] [slides]
•“Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot”, Gaurav Bhardwaj, Sathya Peri, and Pratik Shetty. In 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2023, New Jersey, USA. [pdf] [slides]
•“DAG-based Efficient Parallel Scheduler for Blockchains: Hyperledger Sawtooth as a Case Study”, Manaswini P, Saheli C, Anjana PS, and S Peri. In 29th International European Conference on Parallel and Distributed Computing (Europar) 2023, Limassol, Cyprus. [pdf] [slides]
•“A Self-Stabilizing Low Stretch Spanning Tree Construction”, Sinchan Sengupta, Sathya Peri, Parwat Singh Anjana. In 10th International Conference on NETworked sYStems (NETYS) 2022, Marrakech, Morocco.
•“An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree”, Parwat Singh Anjana, Adithya Rajesh Chandrassery and Sathya Peri. In IEEE International Conference on Cloud Computing (CLOUD) 2022. [pdf]
•“An Efficient Approach to Move Elements in a Distributed Geo-Replicated Tree”, Parwat Singh Anjana, Adithya Rajesh Chandrassery and Sathya Peri. Accepted as a short paper and presented as a poster at the 22nd IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid) 2022.
•“A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality”. Sinchan Sengupta, Sathya Peri, Vipul Aggarwal and Ambey Kumari Gupta. In the 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) 2022.
•“Non-blocking Dynamic Unbounded Graphs with Worst-case Amortized Bounds”, Bapi Chatterjee, Sathya Peri, Muktikanta Sa and Komma Manogna in the Opodis, Strasbourg, France, December 2021. [pdf] [slides]
•“Non-blocking Dynamic Unbounded Graphs with Worst-case Amortized Bounds”, Bapi Chatterjee, Sathya Peri, Muktikanta Sa as a Brief Announcement in the 35th International Symposium on Distributed Computing (DISC) Freiburg, Germany, October 2021.
•“An Efficient Practical Non-Blocking PageRank Algorithm for Large Scale Graphs”, Hemalatha Eedi, Sathya Peri, Neha Ranabothu, Rahul Utkoor in the 28th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) 2021. [pdf] [slides]
•“Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree”, Aishwarya Gurjar, Sathya Peri, Sinchan Sengupta. 19th International Symposium On Parallel And Distributed Computing (ISPDC), Warsaw, Poland 2020.
•“Efficient Concurrent Execution of Smart Contracts in Blockchains using Object-based Transactional Memory”, Parwat Singh Anjana, Hagit Attiya, Sweta Kumari, Sathya Peri, Archit Somani in the 8th International Conference on Networked Systems (NETYS) June 2020 at Marrakech, Morocco. [pdf] [slides]
•“Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems”, Chirag Juyal, Sandeep Kulkarni, Sweta Kumari, Sathya Peri and Archit Somani in 21st International Conference Safety Security and Stabilization (SSS) October 2019 at Pisa, Italy. [pdf] [slides]
•“An Efficient Practical Concurrent Wait-Free Unbounded Graph”, Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa, in 21st IEEE International Conference on High Performance Computing and Communications, August 2019 in Zhangjiajie, China. [pdf][slides]
•“Achieving Starvation-Freedom in Multi-Version Transactional Memory Systems”, Ved Chaudhary, Chirag Juyal, Sandeep Kulkarni, Sweta Kumari and Sathya Peri in the 7th International Conference on Networked Systems (NETYS) June 2019 at MARRAKECH, MOROCCO. [pdf] [slides]
•“A Pragmatic Non-blocking Concurrent Directed Acyclic Graph”, Sathya Peri, Muktikanta Sa and Nandini Singhal in the 7th International Conference on Networked Systems (NETYS) June 2019 at MARRAKECH, MOROCCO. [pdf] [slides]
•“An Efficient Framework for Concurrent Execution of Smart Contracts”, Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, Archit Somani in the 27th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), Pavia Italy, February 2019 [pdf] [slides]. The poster version of this paper received the best poster award in the Ph.D symposium of ICDCN 2019.
•“A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries”, Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal in the 20th International Conference on Distributed Computing and Networking (ICDCN), Bangalore, India, January 2019 [pdf] [slides].
•“An Innovative Approach to Achieve Compositionality Efficiently using Multi-Version Object Based Transactional Systems”, C.Juyal, S.Kulkarni, S.Kumari, S.Peri, A.Somani. in 20th International Conference Safety Security and Stabilization (SSS) November 2018 at Tokyo, Japan [pdf] [slides]. Recipient of Best Student Paper Award at SSS 2018. The poster version of this paper received “Best Poster Award” at Netys 2018. [Abstract, Poster].
•“Efficient means of Achieving Composability using Object based Semantics in Transactional Memory Systems”, Sathya Peri, Ajay Singh, and Archit Somani in The 6th International Conference on Networked Systems (NETYS) May 2018 at ESSAOUIRA, MOROCCO [pdf] [slides].
•“STMs in Practice: Partial Rollback vs Pure Abort Mechanisms”, Anshu S Anand, R. K. Shyamasundar and Sathya Peri in 10th International Symposium on High-Level Parallel Programming and Applications, July 2017 at Valladolid, Spain.
•“Performance comparison of various STM concurrency control protocols using Synchrobench”, Ajay Singh, Sathya Peri, G Monika, Anila Kumari in Parallel Computing Technologies (PARCOMPTECH), 2017 held at Bangalore, India [pdf].
•“Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture”, Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram in 1st International Workshop on Algorithms & Architectures for Distributed Data Analytics (AADDA) held in conjunction with ICDCN 2017 at Hyderabad, India [pdf] [slides].
•“Multiversion Conflict Notion for Transactional Memory Systems”, Priyanka Kumar and Sathya Peri currently under submission [pdf]. Can also be accessed here: http://arxiv.org/abs/1509.04048
•“Opacity Proof for CaPR+ Algorithm”, Anshu S. Anand, R.K. Shyamasundar and Sathya Peri as a short paper in 17th International Conference on Distributed Computing and Networking, Singapore, January 2016. Extended version can be found here [pdf].
•“On Non-Interference of Transactions Non-Interference and Local Correctness in Transactional Memory ”, Petr Kouznetsov and Sathya Peri in 15th International Conference on Distributed Computing and Networking, Coimbatore, India, January 2014 [pdf].
•“A TimeStamp based Multi-version STM Algorithm ”, Priyanka Kumar, Sathya Peri and K.Vidyasankar in 15th International Conference on Distributed Computing and Networking, Coimbatore, India, January 2014 [pdf].
•“Multiversion Conflict Notion ”, Priyanka Kumar and Sathya Peri in 5th International Workshop on Theory of Transactional Memory, Jerusalem, Israel, October 2013 [pdf].
•“An Efficient Scheduler for Closed Nested Transactions that satisfies All-Reads-Consistency and Non-Interference”, Sathya Peri and K.Vidyasankar in 13th International Conference on Distributed Computing and Networking, Hong Kong, China, January 2012 [pdf].
•“Efficient Non-blocking Conflict Notion for Nested Transactions”, Sathya Peri and K.Vidyasankar in 3rd International Workshop on Theory of Transactional Memory, Rome, Italy, September 2011 [pdf].
•“Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems”, Sathya Peri and K.Vidyasankar in 12th International Conference on Distributed Computing and Networking, Bangalore, India, January 2011 [pdf].
•“D2HT: the best of both worlds, Integrating RPS and DHT”, Bertier Marin, Bonnet François, Kermarrec Anne-Marie, Leroy Vincent, Sathya Peri, Raynal Michel in European Dependable Computing Conference, April 2010.
•“On Efficient Departure for Dynamic Asynchronous Systems”, Sathya Peri and Neeraj Mittal, Poster Presentation, Twenty-Fifth Annual Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, July 2006 [pdf].
•“Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems”, Sathya Peri and Neeraj Mittal in the proceedings of 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 420-431, Hyderabad, India, December 2005 [pdf].
•“Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies”, Neeraj Mittal, S. Venkatesan and Sathya Peri in Proceedings of the 18th International Symposium on Distributed Computing (DISC), pages 290-304, Amsterdam, The Netherlands, October 2004 [pdf].
•“On Termination Detection in an Asynchronous system”, Sathya Peri and Neeraj Mittal in Proceedings of the 17th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS), pages 209-215, San Francisco, California, USA, September 2004 [pdf].
Technical Reports
•“Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems ”, Sathya Peri and K.Vidyasankar, Technical Report MUN-CS-2011-01, Department of Computer Science, Memorial University, 2011 [pdf].
•“A lower bound for active departure in dynamic distributed systems”, Sathya Peri and Neeraj Mittal, Technical Report UTDCS-06-07, Department of Computer Science, University of Texas at Dallas, 2007
Unpublished Manuscripts
•“Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems”, Sathya Peri and Neeraj Mittal [pdf].
•“Load Balanced agent activation for reliable multicast”, O.Daescu, R.Jothi, S.Peri, B.Raghavachari and K Sarac. Technical Report, Department of Computer Science, University of Texas at Dallas.