Rajesh Pandian Muniasamy

Rajesh Pandian Muniasamy

Auto-generated profile, based on publicly available information

Rajesh Pandian Muniasamy

Qualcomm, Bangalore, India

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
14 August 2024 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
NBNibedita Behera
Nibedita Behera
AKAshwina Kumar
Ashwina Kumar
ETEbenezer Rajadurai T
Ebenezer Rajadurai T
SNSai Nitish
Sai Nitish
RMRajesh Pandian M
Rajesh Pandian M
RNRupesh Nasre
Rupesh Nasre

27 November 2021 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
RMRajesh Pandian Muniasamy
Rajesh Pandian Muniasamy
RNRupesh Nasre
Rupesh Nasre
NNN. S. Narayanaswamy
N. S. Narayanaswamy

12 July 2023
Verified
Conference Paper
Open access
RMRajesh Pandian Muniasamy
Rajesh Pandian Muniasamy
SSSomesh Singh
Somesh Singh
RNRupesh Nasre
Rupesh Nasre
NNN. S. Narayanaswamy
N. S. Narayanaswamy
Capacitated Vehicle Routing Problem (CVRP) is an important combinatorial optimization problem, which is also NP-hard. A wide array of heuristics have been proposed in the literature to obtain an approximate solution to CVRP. To improve the execution time, parallel methods have been developed for accelerating metaheuristics-based algorithms, genetic algorithms, and evolutionary algorithms for CVRP. Despite these advances, our experiments with the state-of-the-art parallel solutions indicate that their run times are too high to be practically useful. The combinatorial explosion is so high that the execution time is prohibitively large even on mid-sized CVRP instances having a few hundred customers. In this work, we propose a novel technique which combines local search and randomization for solving CVRP faster with reasonable accuracy, even on large problem instances. Our usage of randomization enables searching a large space of candidate solutions. We experimentally compare our proposed method with the state-of-the-art GPU implementations on diverse input instances and demonstrate the efficacy of our approach. Our sequential and shared-memory parallel implementations are on an average 36--1189× faster than the state-of-the-art GPU-parallel genetic algorithms while also achieving a superior solution quality. Furthermore, our reported solutions are close to the current best-known solutions from CVRPLIB.

5 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
NBNibedita Behera
Nibedita Behera
AKAshwina Kumar
Ashwina Kumar
ETEbenezer Rajadurai T
Ebenezer Rajadurai T
SNSai Nitish
Sai Nitish
RMRajesh Pandian M
Rajesh Pandian M
RNRupesh Nasre
Rupesh Nasre
Graphs model several real-world phenomena. With the growth of unstructured and semi-structured data, parallelization of graph algorithms is inevitable. Unfortunately, due to inherent irregularity of computation, memory access, and communication, graph algorithms are traditionally challenging to parallelize. To tame this challenge, several libraries, frameworks, and domain-specific languages (DSLs) have been proposed to reduce the parallel programming burden of the users, who are often domain experts. However, existing frameworks to model graph algorithms typically target a single architecture. In this paper, we present a graph DSL, named StarPlat, that allows programmers to specify graph algorithms in a high-level format, but generates code for three different backends from the same algorithmic specification. In particular, the DSL compiler generates OpenMP for multi-core, MPI for distributed, and CUDA for many-core GPUs. Since these three are completely different parallel programming paradigms, binding them together under the same language is challenging. We share our experience with the language design. Central to our compiler is an intermediate representation which allows a common representation of the high-level program, from which individual backend code generations begin. We demonstrate the expressiveness of StarPlat by specifying four graph algorithms: betweenness centrality computation, page rank computation, single-source shortest paths, and triangle counting. We illustrate the effectiveness of our approach by comparing the performance of the generated codes with that obtained with hand-crafted library codes. We find that the generated code is competitive to library-based codes in many cases. More importantly, we show the feasibility to generate efficient codes for different target architectures from the same algorithmic specification of graph algorithms.

15 August 2026
Verified
Book Chapter
Closed access
PDF file
AKAshwina Kumar
Ashwina Kumar
MKM. Venkata Krishna
M. Venkata Krishna
PBPrasanna Bartakke
Prasanna Bartakke
MTMathew Thomas
Mathew Thomas
RKRahul Kumar
Rahul Kumar
RNRupesh Nasre
Rupesh Nasre

27 September 2026
Verified
Conference Paper
Open access
CRChekkala Sandeep Reddy
Chekkala Sandeep Reddy
LPLakshya Rani P
Lakshya Rani P
SSSomesh Singh
Somesh Singh
RMRajesh Pandian Muniasamy
Rajesh Pandian Muniasamy
RNRupesh Nasre
Rupesh Nasre
The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem with wide applications in logistics and transportation. Given the combinatorial nature of the problem, a diverse set of heuristics has been proposed in the literature to obtain approximate solutions to CVRP. Prior research has largely focused on small- and medium-sized instances, having up to a few thousand customers. With growing instance sizes and problem complexity in logistics and transportation, there is a pressing need to design scalable techniques for CVRP. The current state-of-the-art CVRP heuristics struggle to scale to large problem instances, taking prohibitively long to arrive at a reasonable solution and also having a massive memory footprint. We introduce BP-MDS, a parallel divide-and-conquer framework for approximate CVRP that targets large-scale (million-customer) instances while achieving low optimality gaps. BP-MDS decomposes the problem into smaller subproblems that are processed concurrently, exhibiting empirically near-linear scalability with respect to input size and strong scaling across threads. Experimental results show that BP-MDS achieves 20 × –60 × speedups over ParMDS and up to 100 × (single-threaded) and 2370 × (multi-threaded) speedups over HGS-CVRP. BP-MDS solves CVRP instances with up to 5 million customers in 8 minutes.