Pavan Poudel

Dr. Pavan Poudel

Department of Computing Sciences, University of Houston - Clear Lake, Houston, Texas, USA
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2021 in Theoretical Computer Science
Verified
Journal Article
Closed access
Pavan PoudelPavan Poudel
Pavan Poudel
AAAisha Aljohani
Aisha Aljohani
GSGokarna Sharma
Gokarna Sharma

4 January 2019
Verified
Conference Paper
Open access
PDF file
Pavan PoudelPavan Poudel
Pavan Poudel
GSGokarna Sharma
Gokarna Sharma

27 October 2021 in Information
Verified
Journal Article
Open access
PDF file
Pavan PoudelPavan Poudel
Pavan Poudel
GSGokarna Sharma
Gokarna Sharma
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles following the well-celebrated classic oblivious robots model. We study the fundamental problem of gathering N autonomous robots on a plane, which requires all robots to meet at a single point (or to position within a small area) that is not known beforehand. We consider limited visibility under which robots are only able to see other robots up to a constant Euclidean distance and focus on the time complexity of gathering by robots under limited visibility. There exists an O(DG) time algorithm for this problem in the fully synchronous setting, assuming that the robots agree on one coordinate axis (say north), where DG is the diameter of the visibility graph of the initial configuration. In this article, we provide the first O(DE) time algorithm for this problem in the asynchronous setting under the same assumption of robots’ agreement with one coordinate axis, where DE is the Euclidean distance between farthest-pair of robots in the initial configuration. The runtime of our algorithm is a significant improvement since for any initial configuration of N≥1 robots, DE≤DG, and there exist initial configurations for which DG can be quadratic on DE, i.e., DG=Θ(DE2). Moreover, our algorithm is asymptotically time-optimal since the trivial time lower bound for this problem is Ω(DE).

7 October 2017
Verified
Book Chapter
Closed access
PDF file
Pavan PoudelPavan Poudel
Pavan Poudel
GSGokarna Sharma
Gokarna Sharma


5 January 2021
Verified
Conference Paper
Open access
Pavan PoudelPavan Poudel
Pavan Poudel
SRShishir Rai
Shishir Rai
GSGokarna Sharma
Gokarna Sharma
Consider distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those objects have been assembled, and then forwards those objects to other waiting transactions. We study the predefined order scheduling problem of committing transactions according to their priorities. This problem naturally arises in areas, such as loop parallelization and state-machine-based computing, where producing executions equivalent to a priority order is needed to satisfy certain properties. Specifically, we study predefined order scheduling considering two performance metrics fundamental to any distributed system: (i) execution time - total time to commit all the transactions and (ii) communication cost - the total distance messages travel. We design scheduling algorithms that are simultaneously efficient for both the metrics and rigorously evaluate them through several benchmarks on random and grid graphs, validating their efficiency. To the best of our knowledge, this is the first study of predefined order scheduling in distributed systems.