Transaction Batching for Low Latency Commit Processing in Distributed Systems

Naveen Kumar Bandaru

doi:10.71097/IJSAT.v12.i3.10417

Transaction Batching for Low Latency Commit Processing in Distributed Systems

Author(s)	Naveen Kumar Bandaru
Country	United States
Abstract	Distributed systems that support transactional workloads depend on commit protocols to ensure consistency and durability across multiple nodes. In conventional transaction processing models, each transaction is committed independently as soon as execution completes. Every commit involves multiple stages of message exchange, logging, and synchronization among participating nodes before a confirmation is returned. While this immediate commit model maintains correctness, it introduces substantial latency overhead during runtime. Because each transaction is processed separately, the full commit procedure is repeatedly executed for every request, resulting in increased processing time even when transactions arrive close together in time. As the number of nodes in a distributed cluster grows, commit operations require additional communication and coordination across machines. These interactions increase the time needed to finalize each transaction. Consequently, commit latency rises steadily with cluster size and workload intensity. Under moderate and heavy traffic conditions, the commit phase frequently becomes a performance bottleneck that limits system responsiveness. Transactions spend a significant portion of their lifetime waiting for commit completion rather than performing useful computation. This delay directly impacts application performance, reduces throughput, and restricts scalability in latency sensitive environments. Empirical observations across different cluster configurations show consistently high commit times when transactions are handled individually. The repeated execution of commit procedures leads to inefficient utilization of system resources and prolonged response times. These characteristics indicate that existing commit mechanisms do not scale efficiently as workloads and deployment sizes increase. This paper addresses the problem of high commit latency in distributed transaction systems and focuses on improving commit time efficiency to enable faster transaction completion.
Keywords	Transactions, Batching, Latency, Commit, Distributed, Scalability, Throughput, Synchronization, Coordination, Protocols, Performance, Replication.
Field	Engineering
Published In	Volume 12, Issue 3, July-September 2021
Published On	2021-08-11
DOI	https://doi.org/10.71097/IJSAT.v12.i3.10417

View / Download PDF File

doi

CrossRef DOI is assigned to each research paper published in our journal.

IJSAT DOI prefix is
10.71097/IJSAT

Downloads

Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 17 Isu 1 Cover Page Vol 16 Isu 3 Cover Page Vol 16 Isu 2

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA

About IJSAT Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us	Message on WhatsApp	+91-9687-182-185	editor@ijsat.org

International Journal on Science and Technology

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Transaction Batching for Low Latency Commit Processing in Distributed Systems

Share this