18 citations · 46 across the 7 of their papers we have counts for
8 papers
TC-MIS: Maximal Independent Set on Tensor-cores
Prajjwal Nijhara, Dip Sankar Banerjee
Maximal Independent Set (MIS) in a graph is a fundamental problem with applications in resource allocation, scheduling, and network optimization. Although graphs are inherently un-…
GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting
Subhajit Sahu
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of application…
GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting
Subhajit Sahu
Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for this purpose are crucial in various applications, particularly as…
VAR-DRAM: Variation-Aware Framework for Efficient Dynamic Random Access Memory Design
Kaustav Goswami, Hemanta Kumar Mondal, Shirshendu Das +1
Dynamic Random Access Memory (DRAM) is the de-facto choice for main memory devices due to its cost-effectiveness. It offers a larger capacity and higher bandwidth compared to SRAM…
Effect of stepwise adjustment of Damping factor upon PageRank
Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee
The effect of adjusting damping factor α, from a small initial value α0 to the final desired αf value, upon then iterations needed for PageRank computation is observed. Adjustment…
Adjusting PageRank parameters and Comparing results
Subhajit Sahu, Kishore Kothapalli, Dip Sankar Banerjee
The effect of adjusting damping factor α and tolerance τ on iterations needed for PageRank computation is studied here. Relative performance of PageRank computation with L1, L2, an…