Publications by Sanidhya Kashyap

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Disaggregated memory provides many cost savings and resource provisioning benefits for current datacenters, but software systems enabling disaggregated memory access result in high performance penalties. These systems require intrusive code changes to port ...

Distributed file systems (DFSes) are prone to bugs. Although numerous bug-finding techniques have been applied to DFSes, static analysis does not scalewell with the sheer complexity of DFS codebases while dynamic methods (e.g., regression testing) are limi ...

Today's high-performance applications heavily rely on various synchronization mechanisms, such as locks. While locks ensure mutual exclusion of shared data, their design impacts application scalability. Locks, as used in practice, move the lock-guarded sha ...

Userspace library file systems (LibFSes) promise to unleash the performance potential of non-volatile memory (NVM) by directly accessing it and enabling unprivileged applications to customize their LibFSes to their workloads. Unfortunately, such benefits p ...

Kernel synchronization primitives are the backbone of any OS design. Kernel locks, for instance, are crucial for both application performance and correctness. However, unlike application locks, kernel locks are far from the reach of application developers, ...

Writing a correct operating system kernel is notoriously hard. Kernel code requires manual memory management and type-unsafe code and must efficiently handle complex, asynchronous events. In addition, increasing CPU core counts further complicate kernel de ...

We present ContextPrefetcher, a host-guided high-performant prefetching framework for near-storage accelerators that prefetches data blocks from storage (e.g., NAND) to devicelevel RAM. Efficiently prefetching data blocks to device-level RAM reduces storag ...

This paper presents NFOS, a programming model, runtime, and profiler for productively developing software network functions (NFs) that scale on multicore machines. Writing shared-state concurrent systems that are both correct and scalable is still a seriou ...

Disaggregated memory can address resource provisioning inefficiencies in current datacenters. Multiple software runtimes for disaggregated memory have been proposed in an attempt to make disaggregated memory practical. These systems rely on the virtual mem ...

The ability to safely extend OS kernel functionality is a longstanding goal in OS design, with the widespread use of the eBPF framework in Linux and Windows demonstrating the benefits of such extensibility. However, existing solutions for kernel extensibil ...

Data-intensive systems are the backbone of today's computing and are responsible for shaping data centers. Over the years, cloud providers have relied on three principles to maintain cost-effective data systems: use disaggregation to decouple scaling, use ...

Byte-addressable non-volatile memory (NVM) allows programs to directly access storage using memory interface without going through the expensive conventional storage stack. However, direct access to NVM makes the NVM data vulnerable to software bugs and ha ...

Function-as-a-Service (FaaS) has emerged as a popular cloud paradigm that simplifies software development and deployment by providing scalable and event-driven function execution without the burden of managing servers. FaaS was originally created with a fu ...

Memory-unsafe languages are widely used to implement critical systems like kernels and browsers, leading to thousands of memory safety issues every year. A use-after-free bug is a temporal memory error where the program accidentally visits a freed memory l ...

Existing file systems for persistent memory (PM) exploit its byte-addressable non-volatile access with low latency and high bandwidth. However, they do not utilize two unique PM properties effectively. The first one is contention awareness, i.e., a small n ...

With the "non-hierarchical" trend in emerging storage media, the philosophy of hierarchy inevitably falls short in fully leveraging the combined bandwidth of multiple devices. In this paper, we propose a horizontally structured storage architecture that le ...

Sanidhya Kashyap

Chat with Graph Search

Using Local Cache Coherence for Disaggregated Memory Systems

MONARCH: a fuzzing framework for distributed file systems

Ship your Critical Section, Not Your Data: Enabling Transparent Delegation with TCLocks

Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture

Application-Informed Kernel Synchronization Primitives

NrOS: Effective Replication and Sharing in an Operating System

Context-aware Prefetching for Near-Storage Accelerators

Transparent Multicore Scaling of Single-threaded Network Functions

Rethinking Software Runtimes for Disaggregated Memory

Fast, Flexible, and Practical Kernel Extensions

Skadi: Building a Distributed Runtime for Data Systems in Disaggregated Data Centers

TENET: Memory Safe and Fault Tolerant Persistent Transactional Memory

Single-Address-Space FaaS with Jord

Preventing Use-After-Free Attacks with Fast Forward Allocation

ODINFS: Scaling PM Performance with Opportunistic Delegation

PolyStore: Exploiting Combined Capabilities of Heterogeneous Storage