D. N. Jayasimha

Learn More
An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that can be used for any adaptive or nonadaptive routing(More)
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that(More)
The on-chip interconnect network (OCIN) is the primary “meeting ground” for various on-die components such as cores, memory hierarchy, specialized engines, etc. of a chip multiprocessor (CMP). In this paper, we argue that there are essential differences between on-die and the well-studied off-die networks. These differences necessitate the introduction of a(More)
Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of another event. We formalize bounded fairness by introducing a new family of temporal modal operators. The resultant logic is equivalent to temporal logic with the until modality, but more(More)
In recent years, the study of systems with multiple sensors has been an active area of research. In the paper, the authors focus on the computational, i.e., architectural, algorithmic, and synchronization issues related to competitive information integration in a distributed sensor network (DSN). The proposed architecture of the DSN consists of a set of(More)