Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 2 of 2
Full-Text Articles in Computer Engineering
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
UNLV Theses, Dissertations, Professional Papers, and Capstones
In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.
Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected …
Data Routing In Multicore Processors Using Dimension Increment Method, Arpita H. Kadakia
Data Routing In Multicore Processors Using Dimension Increment Method, Arpita H. Kadakia
UNLV Theses, Dissertations, Professional Papers, and Capstones
A Deadlock-free routing algorithm can be generated for arbitrary interconnection network using the concept of virtual channels but the virtual channels will lead to more complex algorithms and more demands of NOC resource.
In this thesis, we study a Torus topology for NOC application, design its structure and propose a routing algorithm exploiting the characteristics of NOC. We have chosen a typical 16 (4 by 4) routers Torus and propose the corresponding route algorithm. In our algorithm, all the channels are assigned 4 different dimensions (n0,n1,n2 & n3). By following the dimension increment method, we break the dependent route circles, …