Ajay Brahmakshatriya
YOU?
Author Swipe
View article: NetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks
NetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks Open
Modern network applications and environments, ranging from data centers and IoT devices to AR/VR headsets and underwater robotics, present diverse requirements that cannot be satisfied by the all-or-nothing approach of TCP and UDP protocol…
View article: D2X: An eXtensible conteXtual Debugger for Modern DSLs
D2X: An eXtensible conteXtual Debugger for Modern DSLs Open
Compiled Domain Specific Languages are taking over various high-performance domains because of their ability to exploit the domain knowledge and apply optimizations that produce the most specialized code. A lot of research has gone into ma…
View article: CONFLLVM: Compiler-Based Information Flow Control in Low-Level Code
CONFLLVM: Compiler-Based Information Flow Control in Low-Level Code Open
No description available
View article: A Deep Dive Into Understanding The Random Walk-Based Temporal Graph Learning
A Deep Dive Into Understanding The Random Walk-Based Temporal Graph Learning Open
Machine learning on graph data has gained sig-nificant interest because of its applicability to various domainsranging from product recommendations to drug discovery. Whilethere is a rapid growth in the algorithmic community, the com-puter…
View article: A Deep Dive Into Understanding TheRandom Walk-Based Temporal Graph Learning
A Deep Dive Into Understanding TheRandom Walk-Based Temporal Graph Learning Open
Machine learning on graph data has gained significant interest because of its applicability to various domains ranging from product recommendations to drug discovery. While there is a rapid growth in the algorithmic community, the com-pute…
View article: Compilation Techniques for Graph Algorithms on GPUs
Compilation Techniques for Graph Algorithms on GPUs Open
The performance of graph programs depends highly on the algorithm, the size and structure of the input graphs, as well as the features of the underlying hardware. No single set of optimizations or one hardware platform works well across al…
View article: Compliation Techniques for Graphs Algorithms on GPUs.
Compliation Techniques for Graphs Algorithms on GPUs. Open
The performance of graph programs depends highly on the algorithm, size, and structure of the input graphs, as well as the features of the underlying hardware. No single set of optimizations or one hardware platform works well across all s…
View article: Optimizing ordered graph algorithms with GraphIt
Optimizing ordered graph algorithms with GraphIt Open
Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper introduces a new priority-based extension to GraphIt, a dom…
View article: PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms
PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms Open
View article: Optimizing Ordered Graph Algorithms with GraphIt
Optimizing Ordered Graph Algorithms with GraphIt Open
Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper introduces a new priority-based extension to GraphIt, a dom…
View article: An Instrumenting Compiler for Enforcing Confidentiality in Low-Level Code
An Instrumenting Compiler for Enforcing Confidentiality in Low-Level Code Open
We present an instrumenting compiler for enforcing data confidentiality in low-level applications (e.g. those written in C) in the presence of an active adversary. In our approach, the programmer marks secret data by writing lightweight an…
View article: CONFLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code
CONFLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code Open
We present an instrumenting compiler for enforcing data confidentiality in low-level applications (e.g. those written in C) in the presence of an active adversary. In our approach, the programmer marks secret data by writing lightweight an…