Sivasankaran Rajamanickam

Sivasankaran Rajamanickam


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
14 July 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
CTChristian R. Trott
Christian R. Trott
DLDamien Lebrun-Grandie
Damien Lebrun-Grandie
DADaniel Arndt
Daniel Arndt
JCJan Ciesko
Jan Ciesko
VDVinh Q Dang
Vinh Q Dang
JWJeremiah Wilke
Jeremiah Wilke
As the push towards exascale hardware has increased the diversity of system architectures, performance portability has become a critical aspect for scientific software. We describe the Kokkos Performance Portable Programming Model that allows developers to write single source applications for diverse high-performance computing architectures. Kokkos provides key abstractions for both the compute and memory hierarchy of modern hardware. We describe the novel abstractions that have been added to Kokkos version 3 such as hierarchical parallelism, containers, task graphs, and arbitrary-sized atomic operations to prepare for exascale era architectures. We demonstrate the performance of these new features with reproducible benchmarks on CPUs and GPUs.

1 May 2016 in Acta Numerica
Verified
Journal Article
Closed access
PDF file
TDTimothy A. Davis
Timothy A. Davis
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
WSWissam M. Sid-Lakhdar
Wissam M. Sid-Lakhdar
Wilkinson defined a sparse matrix as one with enough zeros that it pays to take advantage of them.1This informal yet practical definition captures the essence of the goal of direct methods for solving sparse matrix problems. They exploit the sparsity of a matrix to solve problems economically: much faster and using far less memory than if all the entries of a matrix were stored and took part in explicit computations. These methods form the backbone of a wide range of problems in computational science. A glimpse of the breadth of applications relying on sparse solvers can be seen in the origins of matrices in published matrix benchmark collections (Duff and Reid 1979a, Duff, Grimes and Lewis 1989a, Davis and Hu 2011). The goal of this survey article is to impart a working knowledge of the underlying theory and practice of sparse direct methods for solving linear systems and least-squares problems, and to provide an overview of the algorithms, data structures, and software available to solve these problems, so that the reader can both understand the methods and know how best to use them.

2 August 2021 in Computing in Science & Engineering
Verified
Journal Article
Closed access
CTChristian Trott
Christian Trott
LBLuc Berger-Vergiat
Luc Berger-Vergiat
DPDavid Poliakoff
David Poliakoff
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
DLDamien Lebrun-Grandie
Damien Lebrun-Grandie
GWGeoff Womeldorff
Geoff Womeldorff
State-of-the-art engineering and science codes have grown in complexity dramatically over the last two decades. Application teams have adopted more sophisticated development strategies, leveraging third party libraries, deploying comprehensive testing, and using advanced debugging and profiling tools. In today’s environment of diverse hardware platforms, these applications also desire performance portability—avoiding the need to duplicate work for various platforms. The Kokkos EcoSystem provides that portable software stack. Based on the Kokkos Core Programming Model, the EcoSystem provides math libraries, interoperability capabilities with Python and Fortran, and Tools for analyzing, debugging, and optimizing applications. In this article, we overview the components, discuss some specific use cases, and highlight how codesigning these components enables a more developer friendly experience.

8 July 2021 in Physical Review B
Verified
Journal Article
Open access
PDF file
JEJ. A. Ellis
J. A. Ellis
LFL. Fiedler
L. Fiedler
GPG. A. Popoola
G. A. Popoola
NMN. A. Modine
N. A. Modine
JSJ. A. Stephens
J. A. Stephens
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
We present a numerical modeling workflow based on machine learning which reproduces the total energies produced by Kohn-Sham density functional theory (DFT) at finite electronic temperature to within chemical accuracy at negligible computational cost. Based on deep neural networks, our workflow yields the local density of states (LDOS) for a given atomic configuration. From the LDOS, spatially resolved, energy-resolved, and integrated quantities can be calculated, including the DFT total free energy, which serves as the Born-Oppenheimer potential energy surface for the atoms. We demonstrate the efficacy of this approach for both solid and liquid metals and compare results between independent and unified machine-learning models for solid and liquid aluminum. Our machine-learning density functional theory framework opens up the path towards multiscale materials modeling for matter under ambient and extreme conditions at a computational scale and cost that is unattainable with current algorithms.

11 August 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
Gordon Euhyun MoonGordon Euhyun Moon
Gordon Euhyun Moon
HKHyoukjun Kwon
Hyoukjun Kwon
GJGeonhwa Jeong
Geonhwa Jeong
PCPrasanth Chatarasi
Prasanth Chatarasi
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
TKTushar Krishna
Tushar Krishna
There is a growing interest in custom spatial accelerators for machine learning applications. These accelerators employ a spatial array of processing elements (PEs) interacting via custom buffer hierarchies and networks-on-chip. The efficiency of these accelerators comes from employing optimized dataflow (i.e., spatial/temporal partitioning of data across the PEs and fine-grained scheduling) strategies to optimize data reuse. The focus of this work is to evaluate these accelerator architectures using a tiled general matrix-matrix multiplication (GEMM) kernel. To do so, we develop a framework that finds optimized mappings (dataflow and tile sizes) for a tiled GEMM for a given spatial accelerator and workload combination, leveraging an analytical cost model for runtime and energy. Our evaluations over five spatial accelerators demonstrate that the tiled GEMM mappings systematically generated by our framework achieve high performance on various GEMM workloads and accelerators.

27 February 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
KLKim Liegeois
Kim Liegeois
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
LBLuc Berger-Vergiat
Luc Berger-Vergiat
Solving large number of small linear systems is increasingly becoming a bottleneck in computational science applications. While dense linear solvers for such systems have been studied before, batched sparse linear solvers are just starting to emerge. In this paper, we discuss algorithms for solving batched sparse linear systems and their implementation in the Kokkos Kernels library. The new algorithms are performance portable and map well to the hierarchical parallelism available in modern accelerator architectures. The sparse matrix vector product (SPMV) kernel is the main performance bottleneck of the Krylov solvers we implement in this work. The implementation of the batched SPMV and its performance are therefore discussed thoroughly in this paper. The implemented kernels are tested on different Central Processing Unit (CPU) and Graphic Processing Unit (GPU) architectures. We also develop batched Conjugate Gradient (CG) and batched Generalized Minimum Residual (GMRES) solvers using the batched SPMV. Our proposed solver was able to solve 20,000 sparse linear systems on V100 GPUs with a mean speedup of 76x and 924x compared to using a parallel sparse solver with a block diagonal system with all the small linear systems, and compared to solving the small systems one at a time, respectively. We see mean speedup of 0.51 compared to dense batched solver of cuSOLVER on V100, while using lot less memory. Thorough performance evaluation on three different architectures and analysis of the performance are presented.