AWAvani Wildani

Avani Wildani

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Avani Wildani has a total of 61 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Rethinking Web Cache Design for the AI Era

    by Yazhuo Zhang, Jinqing Cai, Avani Wildani, Ana Klimovic


  • Open Access

    Valet: Efficient Data Placement on Modern SSDs

    by Devashish R. Purandare, Peter Alvaro, Avani Wildani, Darrell D. E. Long, Ethan L. Miller


  • Open Access

    Beyond Guess and Check: Quantifying the Fidelity of Proxy Applications

    by Si Chen, Simon Garcia de Gonzalo, Omar Aaziz, Jeanine Cook, Avani Wildani


  • Open Access

    Rethinking the Networking Stack for Serverless Environments: A Sidecar Approach

    by Vishwanath Seshagiri, Abhinav Gupta, Vahab Jabrayilov, Avani Wildani, Kostis Kaffes

    Serverless platforms rely on legacy networking stacks for communication and data movement. We quantitatively analyze the performance of these stacks and show their mismatch with highly consolidated, virtualized modern serverless environments, focusing on Firecracker, the most common serverless virtualization framework. As serverless applications grow in complexity and interaction, the resulting network bottleneck is a prime source of user-perceived, end-to-end latency. In this paper, we present a detailed vision of a new, sidecar-based networking stack for serverless environments. Our primary design goal is to provide low-overhead networking while maintaining existing security guarantees. We outline the research challenges in both the control and the data plane that the community needs to tackle before such a sidecar architecture can be used in practice.


  • Open Access

    PreSight: A Vision for an Instantaneous Web

    by Isaac Khor, Suleman Ahmad, Avani Wildani

    We present the position that the time for general, scalable, privacy-preserving web cache speculation is at hand. At its core, web speculation is about predicting what resources users will want. Machine learning (ML) seems like a natural fit for this predictive task. We show, however, that ML is not fundamentally necessary to achieve a ~10% performance improvement worldwide across a diverse set of sites. We also present a set of constraints that large-scale CDNs are subject to, how these constraints limit the possibilities of using ML, what we did instead to achieve our performance results, and a discussion on the place of ML in large, Internet-scale, systems.

  • Spatial Transfer Learning for Estimating PM$_{2.5}$ in Data-Poor Regions

    by Shrey Gupta, Yongbee Park, Jianzhao Bi, Suyash Gupta, Andreas Züfle, Avani Wildani, Yang Liu


  • Open Access

    Persistent Memory Research in the Post-Optane Era

    by Peter Desnoyers, Ian Adams, Tyler Estro, Anshul Gandhi, Geoff Kuenning, Mike Mesnier, Carl Waldspurger, Avani Wildani, Erez Zadok

    After over a decade of researcher anticipation for the arrival of persistent memory (PMem), the first shipments of 3D XPoint-based Intel Optane Memory in 2019 were quickly followed by its cancellation in 2022. Was this another case of an idea quickly fading from future to past tense, relegating work in this area to the graveyard of failed technologies? The recently introduced Compute Express Link (CXL) may offer a path forward, with its persistent memory profile offering a universal PMem attachment point. Yet new technologies for memory-speed persistence seem years off, and may never become competitive with evolving DRAM and flash speeds. Without persistent memory itself, is future PMem research doomed? We offer two arguments for why reports of the death of PMem research are greatly exaggerated. First, the bulk of persistent-memory research has not in fact addressed memory persistence, but rather in-memory crash consistency, which was never an issue in prior systems where CPUs could not observe post-crash memory states. CXL memory pooling allows multiple hosts to share a single memory, all in different failure domains, raising crash-consistency issues even with volatile memory. Second, we believe CXL necessitates a "disaggregation" of PMem research. Most work to date assumed a single technology and set of features, i.e., speed, byte addressability, and CPU load/store access. With an open interface allowing new topologies and diverse PMem technologies, we argue for the need to examine these features individually and in combination. While one form of PMem may have been canceled, we argue that the research problems it raised not only remain relevant but have expanded in a CXL-based future.


  • Open Access

    ISTRBoost: Importance Sampling Transfer Regression using Boosting

    by Shrey Gupta, Jianzhao Bi, Yang Liu, Avani Wildani

    Current Instance Transfer Learning (ITL) methodologies use domain adaptation and sub-space transformation to achieve successful transfer learning. However, these methodologies, in their processes, sometimes overfit on the target dataset or suffer from negative transfer if the test dataset has a high variance. Boosting methodologies have been shown to reduce the risk of overfitting by iteratively re-weighing instances with high-residual. However, this balance is usually achieved with parameter optimization, as well as reducing the skewness in weights produced due to the size of the source dataset. While the former can be achieved, the latter is more challenging and can lead to negative transfer. We introduce a simpler and more robust fix to this problem by building upon the popular boosting ITL regression methodology, two-stage TrAdaBoost.R2. Our methodology,~\us{}, is a boosting and random-forest based ensemble methodology that utilizes importance sampling to reduce the skewness due to the source dataset. We show that~\us{}~performs better than competitive transfer learning methodologies $63\%$ of the time. It also displays consistency in its performance over diverse datasets with varying complexities, as opposed to the sporadic results observed for other transfer learning methodologies.

  • Incorporating Low-Cost Sensor Measurements into High-Resolution PM2.5 Modeling at a Large Spatial Scale

    by Jianzhao Bi, Avani Wildani, Howard H. Chang, Yang Liu

    Low-cost air quality sensors are promising supplements to regulatory monitors for PM2.5 exposure assessment. However, little has been done to incorporate the low-cost sensor measurements in large-scale PM2.5 exposure modeling. We conducted spatially varying calibration and developed a down-weighting strategy to optimize the use of low-cost sensor data in PM2.5 estimation. In California, PurpleAir low-cost sensors were paired with Air Quality System (AQS) regulatory stations and calibration of the sensors was performed by Geographically Weighted Regression. The calibrated PurpleAir measurements were then given lower weights according to their residual errors and fused with AQS measurements into a Random Forest model to generate 1-km daily PM2.5 estimates. The calibration reduced PurpleAir’s systematic bias to ~0 μg/m³ and residual errors by 36%. Increased sensor bias was found to be associated with higher temperature and humidity as well as a longer operating time. The weighted prediction model outperformed the AQS-based prediction model with an improved random CV R2 of 0.86, an improved spatial CV R2 of 0.81, and a lower prediction error. The temporal CV R2 did not improve due to the temporal discontinuity of PurpleAir. The inclusion of PurpleAir data allowed the predictions to better reflect PM2.5 spatial details and hotspots.