Krishnendu Mukhopadhyaya

Learn More
Checkpointing with rollback recovery is a well-known method for achieving fault-tolerance in distributed systems. In this work, we introduce algorithms for checkpointing and rollback recovery on asynchronous unidirectional and bi-directional ring networks. The proposed checkpointing algorithms can handle multiple concurrent initiations by different(More)
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n 2) compared to its propagation delay O(n) only. Here, we attempt to identify the sets of permutations, which are routable in O(n) time in these networks. We de®ne four classes of self-routable permutations for Benes network. An O(n) algorithm is presented here,(More)
This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots with limited visibility. Each robot sees up to a fixed distance around it and moves to a new position. Eventually they form a circle of a given radius. The robots do not store past actions. The robots are anonymous and cannot be distinguished by their(More)
Aktruct-We propose a scheme for evaluating four commonly used functions namely, 1) inverse trigonometric functions, 2) trigonometric functions, 3) the exponential function, and 4) the logarithmic function with the help of a logarithmic number system (LNS) processor. A novel idea of series folding has been introduced for computing the above functions,(More)
This paper proposes a distributed algorithm for circle formation by a system of mobile robots. Each robot observes the positions of other robots and moves to a new position. Eventually they form a circle. The robots do not store past actions. They are anonymous and cannot be distinguished by their appearance and do not have a common coordinate system(More)