SearcharxivSearch

arXiv subjects

Siddharth Anil

Publications and source records attributed to Siddharth Anil.

2 recordsLinked to original sources

Spatial Heterogeneity-Aware Multi-Hazard Susceptibility and Risk Mapping at Regional Scale

Floods and landslides often co-occur, but their relationships with environmental controls vary spatially. This study develops a spatial heterogeneity-aware framework for flood-landslide susceptibility and relative-risk mapping in Kerala, India, and Nepal. It combines 15 km x 15 km grid cells with region-specific contextual zones and compares proximity-gated cross-zone training (S1) and ecology-gated zone-constrained training (S2). S1 permits geographically nearby models to be assigned across contextual boundaries, whereas S2 restricts model development and assignment to the same zone. Random Forest models for each hazard use strategy-specific predictor sets and are evaluated on spatially held-out test samples. Susceptibility surfaces are integrated with CRITIC-weighted exposure and vulnerability indices to produce hazard-specific and nine-class bivariate relative-risk maps. S1 achieved higher mean accuracy, precision, recall, F1-score, AUC-ROC, and PR-AUC for both hazards and regions. The largest difference occurred for Nepal flood susceptibility, where AUC-ROC increased from 0.728 under S2 to 0.886 under S1 and PR-AUC from 0.512 to 0.823. S2 produced lower Brier scores for both Nepal hazards and retained zone-specific differences in predictor selection, SHAP rankings, and response patterns, particularly in Kerala. Both strategies reproduced flood-prone lowland and landslide-prone upland patterns but differed in susceptibility and risk classes. Bivariate risk-map agreement was 0.521 in Kerala and 0.711 in Nepal, with allocation disagreement exceeding quantity disagreement in all S1-S2 comparisons. Susceptibility-to-risk correspondence remained below 0.350, showing that exposure and vulnerability changed priority locations. Overall, cross-zone learning strengthens regional discrimination, while zone-constrained learning preserves environmental differences, supporting their integration.

cs.LG

MQFQ-Sticky: Fair Queueing For Serverless GPU Functions

Hardware accelerators like GPUs are now ubiquitous in data centers, but are not fully supported by common cloud abstractions such as Functions as a Service (FaaS). Many popular and emerging FaaS applications such as machine learning and scientific computing can benefit from GPU acceleration. However, FaaS frameworks (such as OpenWhisk) are not capable of providing this acceleration because of the impedance mismatch between GPUs and the FaaS programming model, which requires virtualization and sandboxing of each function. The challenges are amplified due to the highly dynamic and heterogeneous FaaS workloads. This paper presents the design and implementation of a FaaS system for providing GPU acceleration in a black-box manner (without modifying function code). Running small functions in containerized sandboxes is challenging due to limited GPU concurrency and high cold-start overheads, resulting in heavy queueing of function invocations. We show how principles from I/O scheduling, such as fair queuing and anticipatory scheduling, can be translated to function scheduling on GPUs. We develop MQFQ-Sticky, an integrated fair queueing and GPU memory management approach, which balances the tradeoffs between locality, fairness, and latency. Empirical evaluation on a range of workloads shows that it reduces function latency by 2x to 20x compared to existing GPU and CPU queueing policies.

cs.DC