News
Two Papers Accepted in SSS 2017
August 19th, 2017
Two papers have recently been accepted for presentation in SSS 2017, 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems to be held on November 05 - 08, 2017 at Boston, Massachusetts, USA. The regular paper titled Constant-Time Complete Visibility for Asynchronous Robots with Lights was co-authored by Dr. Sharma with Profs. Ramachandran Vaidyanathan and Jerry L. Trahan from Louisiana State University. This paper presents a constant time algorithm for complete visibility problem for robots with light in asynchronous setting. The other paper titled Universally Optimal Gathering under Limited Visibility was co-authored by Dr. Sharma with his Ph.D. student Pavan Poudel. This paper presents the universally optimal time algorithm for the robot gathering problem in asynchronous setting and under limited visibility. Both the papers are listed in publications section.
New Website Launched
June 20th, 2017
We have designed and lauched the website for our SCALE lab. Your suggestions, comments, and questions are welcome. Please write to: scale@cs.kent.edu for questions regarding the lab and if you would like to join our research team. Many thanks to Pavan for the logo and overall design of the website!
Two Papers Presented in IPDPS 2017
June 1st, 2017
Two papers have recently been presented in IPDPS 2017, 31st IEEE International Parallel & Distributed Processing Symposium
held on May 29 - June 2, 2017 at Orlando, Florida, USA. One of the papers titled O(log N)-Time Complete Visibility for Asynchronous Robots with Lights
was co-authored by Dr. Sharma with Profs. Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, and Suresh Rai from Louisiana State University. This paper
is related to distributed robotics which deals with O(log N) time algorithm for the complete visibility problem in an asynchronous setting. The other paper
titled Complete Visibility for Mobile Agents with Lights Tolerating a Faulty Agent was co-authored by Dr. Sharma with his M.S. thesis student
Aisha Aljohani and was presented in APDCM2017, The 19th Workshop on Advances in Parallel and
Distributed Computational Models, co-located with IPDPS 2017. This paper presents
an algorithm for the complete visibility problem for the robots with lights handling the mobility faults on a robot in a system of three or more rohots.
Both the papers are listed in publications section and they can be downloaded from IEEE Xplore.
Two Papers Accepted in SPAA 2017
April 13th, 2017
Two papers, one regular and one short, have recently been accepted for presentation in SPAA 2017, 29th ACM Symposium on Parallelism in Algorithms and Architectures to be held on July 24 - 26, 2017 at Washington D.C, USA. The regular paper titled Fast Scheduling in Distributed Transactional Memory was co-authored by Dr. Sharma with Profs. Costas Busch (Louisiana State University), Maurice Herlihy (Brown University), and Miroslav Popovic (University of Novi-Sad, Serbia). This paper is related to scheduling distributed transactions efficiently in special network topologies, such as cliques, lines, cluster, and star. The short paper titled Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time was co-authored by Dr. Sharma with Costas Busch and Supratik Mukhopadhyay from Louisiana State University. This paper presents a fast runtime algorithm for the complete visibility problem for classic oblivious robots. This is the first solution that provides linear runtime. Both the papers are listed in publications section and they can be downloaded from ACM Digital Library.
NVIDIA GPU Received
March 20th, 2017
NVIDIA has recently provided a Titan X Pascal GPU to support our research. This GPU is being used for experimantal valuation of the algorithms designed for ATC (air traffic control) type problems.
Thanks NVIDIA for this support!