Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Nandivada, V. Krishna"'
Data-flow analyses like points-to analysis can vastly improve the precision of other analyses, and help perform powerful code optimizations. However, whole-program points-to analysis of large programs tend to be expensive - both in terms of time and
Externí odkaz:
http://arxiv.org/abs/2409.09062
Mainstream compilers perform a multitude of analyses and optimizations on the given input program. Each analysis (such as points-to analysis) may generate a program-abstraction (such as points-to graph). Each optimization is typically composed of mul
Externí odkaz:
http://arxiv.org/abs/2106.01768
Autor:
Nougrahiya, Aman1 (AUTHOR) amannoug@cse.iitm.ac.in, Nandivada, V. Krishna1 (AUTHOR) nvk@iitm.ac.in
Publikováno v:
ACM Transactions on Programming Languages & Systems. Jun2024, Vol. 46 Issue 2, p1-58. 58p.
Autor:
Jatala, Vishwesh, Hoang, Loc, Dathathri, Roshan, Gill, Gurbinder, Nandivada, V Krishna, Pingali, Keshav
Load-balancing among the threads of a GPU for graph analytics workloads is difficult because of the irregular nature of graph applications and the high variability in vertex degrees, particularly in power-law graphs. We describe a novel load balancin
Externí odkaz:
http://arxiv.org/abs/1911.09135
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we present two symbiotic optimizations to optimize recursive task parallel (RTP) programs by reducing the task creation and termination overheads. Our first optimization Aggressive Finish-Elimination (AFE) helps reduce the redundant jo
Externí odkaz:
http://arxiv.org/abs/1502.06086
Autor:
Gupta, Suyash, Nandivada, V. Krishna
Considering the diverse nature of real-world distributed applications that makes it hard to identify a representative subset of distributed benchmarks, we focus on their underlying distributed algorithms. We present and characterize a new kernel benc
Externí odkaz:
http://arxiv.org/abs/1310.2814
Autor:
Gupta, Kartik, Nandivada, V. Krishna
Lexical states provide a powerful mechanism to scan regular expressions in a context sensitive manner. At the same time, lexical states also make it hard to reason about the correctness of the grammar. We first categorize the related correctness issu
Externí odkaz:
http://arxiv.org/abs/1308.3156
Autor:
MISHRA, PRASOON, NANDIVADA, V. KRISHNA
Publikováno v:
ACM Transactions on Architecture & Code Optimization; Mar2024, Vol. 21 Issue 1, p1-26, 26p
Autor:
THAKUR, MANAS1 manas@cse.iitm.ac.in, NANDIVADA, V. KRISHNA1 nvk@iitm.ac.in
Publikováno v:
ACM Transactions on Programming Languages & Systems. Jul2019, Vol. 41 Issue 3, p1-37. 37p.