https://nidhidhamnani.dev/tag/concurrency/ConcurrencyWowchemy (https://wowchemy.com)en-ushttps://nidhidhamnani.dev/media/icon_hu8807d1b1c94e9f5c8b462b28439c590e_18795_512x512_fill_lanczos_center_2.pnghttps://nidhidhamnani.dev/tag/concurrency/https://nidhidhamnani.dev/project/concurrent_mst/Mon, 01 Jan 0001 00:00:00 +0000https://nidhidhamnani.dev/project/concurrent_mst/<h3 id="system-architecture--performance">System Architecture &amp; Performance</h3> <p>Engineered a highly concurrent variation of Borůvka’s algorithm to process large-scale graph structures in parallel. The implementation focused on minimizing thread contention and optimizing memory access patterns.</p> <ul> <li><strong>Parallel Processing:</strong> Designed the algorithm to distribute edge-weight evaluations across multiple worker threads, significantly reducing processing bottlenecks on dense clusters.</li> <li><strong>Synchronization:</strong> Utilized atomic variables and thread-safe concurrent priority queues to manage state without introducing heavy locking mechanisms or deadlocks.</li> <li><strong>Performance Metrics:</strong> Benchmarked against standard sequential implementations, achieving a <strong>59.7% faster execution time</strong> when processing randomly generated sparse graphs (100,000+ nodes) on an 8-core machine.</li> </ul>