Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Sundararajah, Kirshanthan"'
Autor:
Das, Pratyush, Dias, Adhitha, Xhebraj, Anxhelo, Pelenitsyn, Artem, Sundararajah, Kirshanthan, Kulkarni, Milind
Sparse Matrices found in the real world often have some structure in their distribution of dense elements. While existing techniques specialize the generated code for the structure of matrices, their generality misses optimization opportunities. We p
Externí odkaz:
http://arxiv.org/abs/2407.00829
SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring
Autor:
Dias, Adhitha, Anderson, Logan, Sundararajah, Kirshanthan, Pelenitsyn, Artem, Kulkarni, Milind
Automated code generation and performance enhancements for sparse tensor algebra have become essential in many real-world applications, such as quantum computing, physical simulations, computational chemistry, and machine learning. General sparse ten
Externí odkaz:
http://arxiv.org/abs/2311.09549
Dynamic symbolic execution (DSE) suffers from path explosion problem when the target program has many conditional branches. Classical approach for managing the path explosion problem is dynamic state merging. Dynamic state merging combines similar sy
Externí odkaz:
http://arxiv.org/abs/2308.01554
Sparse tensor algebra computations have become important in many real-world applications like machine learning, scientific simulations, and data mining. Hence, automated code generation and performance optimizations for tensor algebra kernels are par
Externí odkaz:
http://arxiv.org/abs/2205.11622
GPGPUs use the Single-Instruction-Multiple-Thread (SIMT) execution model where a group of threads-wavefront or warp-execute instructions in lockstep. When threads in a group encounter a branching instruction, not all threads in the group take the sam
Externí odkaz:
http://arxiv.org/abs/2107.05681
Autor:
Bao, Yuyan, Sundararajah, Kirshanthan, Malik, Raghav, Ye, Qianchuan, Wagner, Christopher, Jaber, Nouraldin, Wang, Fei, Ameri, Mohammad Hassan, Lu, Donghang, Seto, Alexander, Delaware, Benjamin, Samanta, Roopsha, Kate, Aniket, Garman, Christina, Blocki, Jeremiah, Letourneau, Pierre-David, Meister, Benoit, Springer, Jonathan, Rompf, Tiark, Kulkarni, Milind
Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An important class of such cryptographic techniques is known as Secure M
Externí odkaz:
http://arxiv.org/abs/2009.01489
Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a common, important optimization technique. In applications such as compil
Externí odkaz:
http://arxiv.org/abs/1904.07061
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.
Autor:
Rocha, Rodrigo C. O., Saumya, Charitha, Sundararajah, Kirshanthan, Petoumenos, Pavlos, Kulkarni, Milind, O'Boyle, Michael F.P.
Publikováno v:
Rocha, R C O, Saumya, C, Sundararajah, K, Petoumenos, P, Kulkarni, M & O'Boyle, M F P 2022, HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction . in ACM SIGPLAN 2023 International Conference on Compiler Construction .
Binary code size is a first-class design consideration in many computing domains and a critical factor in many more, but compiler optimizations targeting code size are few and often limited in functionality. When size reduction opportunities are left
Publikováno v:
Proceedings of the 36th ACM International Conference on Supercomputing.
Sparse tensor algebra computations have become important in many real-world applications like machine learning, scientific simulations, and data mining. Hence, automated code generation and performance optimizations for tensor algebra kernels are par