Ajay Kshemkalyani

Dr. Ajay Kshemkalyani

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2022 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
AKAjay Kshemkalyani
Ajay Kshemkalyani
AMAnisur Rahaman Molla
Anisur Rahaman Molla
GSGokarna Sharma
Gokarna Sharma

1 September 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
THTa-Yuan Hsu
Ta-Yuan Hsu
AKAjay Kshemkalyani
Ajay Kshemkalyani
MSMin Shen
Min Shen

4 January 2023
Verified
Conference Paper
Open access
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani
Byzantine fault-tolerant causal ordering of messages in asynchronous systems is useful to many applications. Although the problem has been studied for broadcast communication, it has not been examined for unicasts or multicasts in asynchronous systems. In this paper, we use execution histories to prove that it is impossible to solve causal ordering for both unicasts and multicasts in an asynchronous system with one or more Byzantine processes. In view of these impossibility results, we propose the Channel Sync Algorithms to provide causal order of unicasts and multicasts under the Byzantine failure model in synchronous systems, which have a known upper bound on message latency. The Channel Sync Algorithms operate under the synchronous system model, but are inherently asynchronous and offer a high degree of concurrency as lock-step communication is not assumed.

28 September 2022
Verified
Book Chapter
Closed access
PDF file
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani

20 October 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
TPTommaso Pozzetti
Tommaso Pozzetti
AKAjay Kshemkalyani
Ajay Kshemkalyani
Causality tracking among events is a fundamental challenge in distributed environments. Much previous work on this subject has focused on designing an efficient and scalable protocol to represent logical time. Several implementations of logical clocks have been proposed, most recently the Encoded Vector Clock (EVC), a protocol to encode Vector Clocks (VC) in scalar numbers through the use of prime numbers, to improve performance and scalability. We propose and formalize the concept of Resettable Encoded Vector Clock (REVC), a new logical clock implementation, which builds on the EVC to tackle its very high growth rate issue. We show how our REVC can be applied in both shared memory systems and message passing systems to achieve a consistent logical clock. We show, through practical examples, the advantage of REVC's growth rate with respect to EVC's growth rate. Finally, we show a practical application of the REVC to the dynamic race detection problem in multi-threaded environments. We compare our tool to the currently existing VC-based tool DJIT+ to show how the REVC can help in achieving higher performance with respect to the Vector Clock.

1 August 2004 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
AKAjay Kshemkalyani
Ajay Kshemkalyani