Garbage Collection for Mostly Serialized Heaps

Chaitanya S. Koparkar, Vidhush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni and Ryan R. Newton
International Symposium on Memory Management
June, 2024

HACCLE: Metaprogramming for Secure Multi-Party Computation

Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf and Milind Kulkarni
International Conference on Generative Programming: Concepts and Experiences (GPCE)
October, 2021
Acceptance rate: 50%

Milind Kulkarni

Publications

Email

Position

Affiliations

Office

Phone

Currently teaching

Conferences

Garbage Collection for Mostly Serialized Heaps

Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing

RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search

RT-DBSCAN: Accelerating DBSCAN using Ray Tracing Hardware

Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification

Coyote: A Compiler for Vectorizing Encrypted Arithmetic Circuits

HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction

Unirec: A Unimodular-like Framework for Nested Recursion and Loops

Cornucopia: A Framework for Feedback-Guided Generation of Binaries

SparseLNR: accelerating sparse tensor computations using loop nest restructuring

DARM: Control-Flow Melding for SIMT Thread Divergence Reduction

QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based Systems

HACCLE: Metaprogramming for Secure Multi-Party Computation

Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations

Vectorized Secure Evaluation of Decision Forests

Parameterized Verification of Systems with Global Synchronization and Guards

D2P: From Recursive Formulations to Distributed Memory Codes

Efficient GPU Tree Walks for Effective Distributed N-Body Simulations

Composable, Sound Transformations of Nested Recursion and Loops

Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees

LoCal: A Language for Programs Operating on Serialized Data

MULKSG: MULtiple K Simultaneous Graph Assembly

XSTRESSOR: Automatic Generation of Large-Scale Test Inputs by Inferring Path Conditions

PySE: Automatic Worst-Case Test Generation by Reinforcement Learning

TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals

Scalable Genomic Assembly through Parallel de Bruijn Graph Construction for Multiple K-mers

Compiling Tree Transforms to Operate on Packed Representations

SPIRIT: A Framework for Creating Distributed Recursive Tree Applications

Treelogy: A Benchmark Suite for Tree Traversals

Locality Transformations for Nested Recursive Iteration Spaces

Data Structure–Aware Heap Partitioning

Exploiting Vector and Multicore Parallelism for Recursive Data- and Task-Parallel Programs

Processor-Oblivious Record and Replay

Legato: End-to-End Bounded Region Serializability Using Commodity Hardware Transactional Memory

SARVAVID: A Domain Specific Language for Developing Scalable Computational Genomics Applications

Hybrid CPU-GPU Scheduling and Execution of Tree Traversals

Toward Efficient Strong Memory Model Support for the Java Platform via Hybrid Synchronization

Efficient Deterministic Replay of Multithreaded Executions in a Managed Language Virtual Machine

SemCache++: Semantics-Aware Caching for Efficient Multi-GPU Offloading

Efficient Execution of Recursive Programs on Commodity Vector Hardware

Tree Dependence Analysis

Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability

Orion: Scaling Genomic Sequence Matching with Fine-Grained Parallelization

General transformations for GPU execution of tree traversals

Octet: Capturing and Controlling Cross-Thread Dependences Efficiently

EventWave: Programming Model and Runtime Support for Tightly-Coupled Elastic Cloud Applications

Automatic Vectorization of Tree Traversals

WuKong: Automatically Detecting and Localizing Bugs that Manifest at Large System Scales

Exploiting Domain Knowledge to Optimize Parallel Computational Mechanics Codes

SemCache: Semantics-aware Caching for Efficient GPU Offloading

Automatically Enhancing Locality for Tree Traversals with Traversal Splicing

Enhancing Locality for Recursive Traversals of Recursive Structures

InContext: Simple Parallelism for Distributed Applications

Vrisha: Using Scaling Properties of Parallel Programs for Bug Detection and Localization

The Tao of Parallelism in Algorithms

Exploiting the Commutativity Lattice

Techniques for fine-grained, multi-site computation offloading

μSETL: A Set Based Programming Abstraction for Wireless Sensor Networks

Accelerating Multicore Reuse Distance Analysis with Sampling and Parallelization

Structure-driven Optimizations for Amorphous Data-Parallel Programs

Lonestar: A Suite of Parallel Irregular Programs

How Much Parallelism is There in Irregular Applications?

Fast Agglomerative Clustering for Rendering

Scheduling Strategies for Optimistic Parallel Execution of Irregular Programs

Optimistic Parallelism Benefits From Data Partitioning

Optimistic Parallelization Requires Abstractions

Journals

Challenges in Firmware Re-Hosting, Emulation, and Analysis

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

Processor-Oblivious Record and Replay

A-RESCUE 2.0. A High Fidelity, Parallel, Agent-based Evacuation Simulator