Engineering Commons^™

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

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, …

Parameterizable Network-On-Chip Emulation Framework, Jaya Suseela

UNLV Theses, Dissertations, Professional Papers, and Capstones

Networks-on-Chip (NoCs) have been proposed as a promising solution to complex on-chip communication problems. But there is no public accessible HDL synthesizable NoC framework which connects industrial level cores and runs real applications on them. Moreover, many challenging research problems remain unsolved at all levels of design abstraction; design exploration of NoC architecture for applications, scheduling and mapping algorithms, evaluation of switching, topology or routing algorithm for efficient execution of application and optimizing communication cost, area, energy etc Solution to solve the above problem calls for the development of synthesizable, parameterizable NoC Framework that would evaluate and implement the above …

Real-Time On-Board Object Tracking For Cooperative Flight Control, Ajay Kumar Mandava, Emma Regentova, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

One of possible cooperative Situations for flights could be a scenario when the decision on a new path is taken by A Certain fleet member, who is called the leader. The update on the new path is Transmitted to the fleet members via communication That can be noisy. An optical sensor can be used as a back-up for re-estimating the path parameters based on visual information. For A Certain topology, the issue can be solved by continuous tracking of the leader of the fleet in the video sequence and re-adjusting parameters of the flight, accordingly. To solve such a problem …