Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Interference graph"”.
-
Physical Design for Multichip Modules
… based on max-cut partitioning of a net interference graph, is also studied. New techniques for constructing the interference graph based on congestion and crosstalk are presented, and algorithms for max-cut partitioning and crosstalk minimization are described.
-
Scratch-pad memory management for static data aggregates
… pseudo register file then generalising existing graph colouring algorithms for register allocation to colour data aggregates. In this thesis, a scheme for partitioning an SPM into a pseudo register file is introduced. This methodology is inter-procedural and therefore operates on the interference …
-
Nash Equilibrium Seeking Over Networks
… in the network. This dependency is captured by a graph referred to as an interference graph. According to the topology of this graph, we design distributed algorithms to find a Nash equilibrium of the game. We focus on distributed algorithms since the players are only aware of imperfect …
-
Traffic-aware channel assignment in enterprise wireless LANs
… our scheme in real WLANs, including measuring an interference graph, collecting traffic demands, and predicting future demands based on historical information. On the whole, our approach is similar yet very effective. It can be incorporated into existing WLANs with little to no modification to the …
-
An experimental analysis of a set of compiler algorithms*
… we examine different methods for building an interference graph, the pivotal structure of a graph-coloring register allocator. Our results show that a twenty-year-old assumption about the graph's characteristics is flawed, and we show extensive data to explain the best way to build this graph. …
-
Link scheduling directed graphs using undirected edge colours
… either a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modeled as a graph, typically the same as the communication …
-
Resource Abstraction and Virtualization Solutions for Wireless Networks
… non-overlapping radio resources, monitoring interference, etc.). Software-defined networking (SDN) and network function virtualization (NFV) are the two emerging technologies that promise to provide programmability and flexibility in terms of managing, configuring and optimizing wireless …
-
An Optimization Framework for Embedded Processors with Auto-Modify Addressing Modes
… of optimizations focuses on using an access graph and finding the maximum weight path cover to find an optimized stack variables layout. We take this further by using coalescing, addressing mode selection and offset registers to find further opportunities for reducing the number of …