arXiv subjects

Shriram Ramesh

Publications and source records attributed to Shriram Ramesh.

4 recordsLinked to original sources

arXiv2026

Distribution of currents in a system of active particles with biased hops and Ising interactions

We consider an ensemble of particles performing a biased random walk on a two-dimensional lattice. Due to the adhesion between particles (nearest-neighbor Ising interactions), the probability of hopping depends on the number of neighbors and the strength of adhesive interaction. The asymmetry in the hopping directions leads to a macroscopic current of particles through the system. We theoretically compute the distribution of currents and verify the results in stochastic particle simulations. To make theoretical progress, one has to determine the probabilities of various particle configurations such as single particles, pairs, and different configurations of three-particle clusters. These probabilities are theoretically derived by formulating rate equations for the concentrations of various structures resembling Becker-D\"oring cluster equations. One intriguing finding is that the concentration of left-handed triplets is not equal to the concentration of right-handed triplets for non-zero asymmetry of hops and non-zero interaction between particles.

cond-mat.stat-mech↗

arXiv2022

Resilient Execution of Data-triggered Applications on Edge, Fog and Cloud Resources

Internet of Things (IoT) is leading to the pervasive availability of streaming data about the physical world, coupled with edge computing infrastructure deployed as part of smart cities and 5G rollout. These constrained, less reliable but cheap resources are complemented by fog resources that offer federated management and accelerated computing, and pay-as-you-go cloud resources. There is a lack of intuitive means to deploy application pipelines to consume such diverse streams, and to execute them reliably on edge and fog resources. We propose an innovative application model to declaratively specify queries to match streams of micro-batch data from stream sources and trigger the distributed execution of data pipelines. We also design a resilient scheduling strategy using advanced reservation on reliable fogs to guarantee dataflow completion within a deadline while minimizing the execution cost. Our detailed experiments on over 100 virtual IoT resources and for $\approx 10k$ task executions, with comparison against baseline scheduling strategies, illustrates the cost-effectiveness, resilience and scalability of our framework.

cs.DC↗

arXiv2020

GoCoronaGo: Privacy Respecting Contact Tracing for COVID-19 Management

The COVID-19 pandemic is imposing enormous global challenges in managing the spread of the virus. A key pillar to mitigation is contact tracing, which complements testing and isolation. Digital apps for contact tracing using Bluetooth technology available in smartphones have gained prevalence globally. In this article, we discuss various capabilities of such digital contact tracing, and its implication on community safety and individual privacy, among others. We further describe the GoCoronaGo institutional contact tracing app that we have developed, and the conscious and sometimes contrarian design choices we have made. We offer a detailed overview of the app, backend platform and analytics, and our early experiences with deploying the app to over 1000 users within the Indian Institute of Science campus in Bangalore. We also highlight research opportunities and open challenges for digital contact tracing and analytics over temporal networks constructed from them.

cs.CY↗

arXiv2020

A Distributed Path Query Engine for Temporal Property Graphs

Property graphs are a common form of linked data, with path queries used to traverse and explore them for enterprise transactions and mining. Temporal property graphs are a recent variant where time is a first-class entity to be queried over, and their properties and structure vary over time. These are seen in social, telecom, transit and epidemic networks. However, current graph databases and query engines have limited support for temporal relations among graph entities, no support for time-varying entities and/or do not scale on distributed resources. We address this gap by extending a linear path query model over property graphs to include intuitive temporal predicates and aggregation operators over temporal graphs. We design a distributed execution model for these temporal path queries using the interval-centric computing model, and develop a novel cost model to select an efficient execution plan from several. We perform detailed experiments of our Granite distributed query engine using both static and dynamic temporal property graphs as large as 52M vertices, 218M edges and 325M properties, and a 1600-query workload, derived from the LDBC benchmark. We often offer sub-second query latencies on a commodity cluster, which is 149x-1140x faster compared to industry-leading Neo4J shared-memory graph database and the JanusGraph / Spark distributed graph query engine. Granite also completes 100% of the queries for all graphs, compared to only 32-92% workload completion by the baseline systems. Further, our cost model selects a query plan that is within 10% of the optimal execution time in 90% of the cases. Despite the irregular nature of graph processing, we exhibit a weak-scaling efficiency >= 60% on 8 nodes and >= 40% on 16 nodes, for most query workloads.

cs.DC↗