Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); GitHub - Tejas-Raj01/distributed-system · GitHub
Skip to content

Repository files navigation

🚀 Tejas-DB: High-Performance Distributed Key-Value Store

C++ReactArchitectureThroughput

A highly concurrent, fault-tolerant, and masterless distributed Key-Value store built entirely from scratch in Modern C++, featuring a real-time visual dashboard built in React & Tailwind CSS.

Engineered to handle massive scalability, this system implements core distributed systems concepts inspired by Amazon Dynamo and Apache Cassandra.


✨ Core Architecture & Features

1. 🔄 Consistent Hashing & Data Distribution

  • Implemented a Ring Topology using the 64-bit FNV-1a Hash Algorithm to ensure uniform data distribution and eliminate hot spots.
  • Configured with 100 Virtual Nodes (vNodes) per physical server to achieve perfect load balancing and seamless scaling.

2. 🛡️ Fault Tolerance & Replication

  • Strict Quorum Logic (W=2, R=2): Ensures consistency across cluster nodes. Writes are acknowledged once replica quorums are achieved.
  • Write-Ahead Logging (WAL): Disk-backed crash recovery. Every node recovers its exact state from local logs instantly upon reboot.
  • Gossip Protocol: Background heartbeat threads monitor cluster health, instantly detecting node failures and dynamically updating the routing topology.

3. ⚡ High-Performance Concurrency

  • Architected a thread-safe custom Storage Engine utilizing std::shared_mutex (Read-Write Locks).
  • Achieved 33,685 Write Requests Per Second (RPS) with a highly concurrent load of 100 simultaneous threads, maintaining an average latency of just ~2.97ms (Benchmarked via Apache ab).

4. ⚖️ Elastic Scaling & Live Rebalancing

  • Dynamically supports adding or removing nodes.
  • Exposes an /admin/rebalance endpoint that intelligently calculates hash boundaries and migrates live data to new nodes without cluster downtime.

5. 🖥️ Interactive Visual Dashboard (Control Center)

  • A real-time React/Vite dashboard that visualizes the Consistent Hashing Ring.
  • Chaos Engineering Controls: Inject massive workloads or simulate node deaths with a single click to visually demonstrate data rebalancing and fault tolerance in real-time.

🛠️ Tech Stack

  • Backend Engine: Modern C++ (C++17)
  • Networking/HTTP:cpp-httplib
  • Frontend UI: React.js, Vite, Tailwind CSS
  • Performance Testing: Apache Bench (ab) & Custom Bash Scripts

🚀 Getting Started

Prerequisites

  • GCC/G++ (Supports C++17)
  • CMake 3.10+
  • Apache Bench (ab tool for load testing)
  • Node.js & npm (For the UI)

1. Build the Backend (Release Mode with -O3 Optimizations)

# Clone the repository
git clone https://github.com/Tejas-Raj01/distributed-system.git
cd distributed-system
# Create release build with maximum optimizations
cmake -B build -DCMAKE_BUILD_TYPE=Release -DCMAKE_CXX_FLAGS="-O3"
cmake --build build

2. Start the Backend Server

# Ensure data directory exists for WAL logging
mkdir -p data
# Start a server node on port 8080
./build/kv_server 8080

⚡ Performance Benchmarking & Load Testing

To run high-concurrency performance benchmarks matching our test setup (100 concurrent threads, 50,000 requests), follow these steps:

Step 1: Install Apache Benchmark (ab)

  • Ubuntu/Debian:sudo apt install apache2-utils
  • Fedora/RHEL:sudo dnf install httpd-tools
  • Arch Linux:sudo pacman -S apache

Step 2: Start Server in Background

./build/kv_server 8080 > data/server.log 2>&1&

Step 3: Write (POST) Benchmark Execution

  1. Create a post payload file:
    echo"key=StressTestKey&value=MassiveDataLoad"> payload.txt
  2. Run Apache Bench for 50,000 POST requests with 100 concurrent connections:
    ab -n 50000 -c 100 -p payload.txt -T "application/x-www-form-urlencoded""http://127.0.0.1:8080/put"

Step 4: Read (GET) Benchmark Execution

Run Apache Bench for 50,000 GET requests under 100 concurrent connections:

ab -n 50000 -c 100 "http://127.0.0.1:8080/get?key=StressTestKey"

📊 Benchmark Results & Detailed Analytics

Tested on Release build (-O3 optimized) with 50,000 requests under 100 concurrent threads:

Metric / ParameterWrite (POST /put)Read (GET /get)
Total Requests50,00050,000
Concurrency Level100 connections100 connections
Throughput (Requests/sec)33,684.94 req/sec1,809.14 req/sec
Mean Latency (Average)2.969 ms55.275 ms
Concurrent Request Latency0.030 ms0.553 ms
Success / Error Rate100% Success (0 Errors)100% Success (0 Errors)

Latency Percentile Breakdown

PercentileWrite Latency (ms)Read Latency (ms)
50% (Median)1 ms49 ms
66%2 ms50 ms
75%2 ms50 ms
80%2 ms51 ms
90%3 ms71 ms
95%4 ms72 ms
98%5 ms73 ms
99%5 ms73 ms

About

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages