5 papers
The Bloom Clock for Causality Testing
Anshuman Misra, Ajay D. Kshemkalyani
Testing for causality between events in distributed executions is a fundamental problem. Vector clocks solve this problem but do not scale well. The probabilistic Bloom clock can d…
Provisioning Spot Instances Without Employing Fault-Tolerance Mechanisms
Abdullah Alourani, Ajay D. Kshemkalyani
Cloud computing offers a variable-cost payment scheme that allows cloud customers to specify the price they are willing to pay for renting spot instances to run their applications…
Dispersion of Mobile Robots in the Global Communication Model
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a configuration…
Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The mobile robot dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a c…
Efficient Dispersion of Mobile Robots on Graphs
Ajay D. Kshemkalyani, Faizan Ali
The dispersion problem on graphs requires robots placed arbitrarily at the nodes of an anonymous graph, where , to coordinate with each other to reach a final con…