Subhrajit Das

Team Contributor at IIT Gandhinagar & University of Edinburgh (Oct 2025 - Present)

• Investigating how clusters of commodity hardware can tackle compute-intensive tasks typically reserved for accelerators.

Team Contributor at IIT Gandhinagar (Oct 2025 - Present)

• Investigating the usability challenges developers face when integrating Consent Management Platforms (CMPs) into web applications.

M.Tech. Thesis Work

• Advisor: Prof. Abhishek Bichhawat, Co-advisor: Prof. Yuvraj Patel (The University of Edinburgh)
• Designed high-performance faster data-parallel algorithms for large integer addition and subtraction using AVX512 for most cases.
• Achieved average execution-time speedup of 2.06x for addition and 2.32x for subtraction (up to 131k bits) compared to the GNU Multiple-Precision Arithmetic Library (GMP).
• Designed a faster Vedic-based multiplication algorithm for large integers using AVX512-IFMA for 256-bit operands, with execution-time speedup of 1.83x compared to the GMP library.
• Additionally, designed approximate variants of the proposed algorithms for large integer addition and multiplication, achieving average execution-time speedup of 2.52x and 2.80x, respectively, compared to GMP.

M.Sc. Thesis Work

• Advisor: Prof. Priya Ranjan Sinha Mahapatra, Co-advisor: Dr. Soumen Atta
• Designed and implemented an algorithm for solving maximal covering location problems using genetic and artificial bee colony algorithms.
• Achieved optimal benchmark results with CPLEX in 50% of cases, reducing the average computational time to 85.83 seconds, compared to over 1000 seconds for previous models, with an average gap of just 0.01%.

B.Sc. Project Work

• Designed a multiplier accumulate unit using reversible gates for low power consumption and heat dissipation.

Team Contributor

• Engineered an instant payment system using Parallel and Distributed Systems concepts.
• Facilitated seamless and secure interoperability between parties, similar to UPI.
• Implemented efficient transaction processing with load balancing, fault tolerance, and concurrency control to ensure high availability and scalability.

Individual Contributor

• Developed a simulation of a tennis game matching server where multiple players send requests for games: singles, doubles, male, female, or mixed.
• Utilized OpenMP threads to handle client requests and MPI calls for player communication.
• Managed the availability of limited tennis courts (4 courts) to continuously match players’ requests.
• Completed as part of the Parallel and Distributed Course at IIT Gandhinagar.