scholarly journals Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks

2010 ◽  
Vol 6 (1) ◽  
pp. 65-83
Author(s):  
Feilong Tang ◽  
Ilsun You ◽  
Minyi Guo ◽  
Song Guo ◽  
Long Zheng

Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT), which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.

Energies ◽  
2019 ◽  
Vol 12 (22) ◽  
pp. 4300 ◽  
Author(s):  
Hoon Lee ◽  
Han Seung Jang ◽  
Bang Chul Jung

Achieving energy efficiency (EE) fairness among heterogeneous mobile devices will become a crucial issue in future wireless networks. This paper investigates a deep learning (DL) approach for improving EE fairness performance in interference channels (IFCs) where multiple transmitters simultaneously convey data to their corresponding receivers. To improve the EE fairness, we aim to maximize the minimum EE among multiple transmitter–receiver pairs by optimizing the transmit power levels. Due to fractional and max-min formulation, the problem is shown to be non-convex, and, thus, it is difficult to identify the optimal power control policy. Although the EE fairness maximization problem has been recently addressed by the successive convex approximation framework, it requires intensive computations for iterative optimizations and suffers from the sub-optimality incurred by the non-convexity. To tackle these issues, we propose a deep neural network (DNN) where the procedure of optimal solution calculation, which is unknown in general, is accurately approximated by well-designed DNNs. The target of the DNN is to yield an efficient power control solution for the EE fairness maximization problem by accepting the channel state information as an input feature. An unsupervised training algorithm is presented where the DNN learns an effective mapping from the channel to the EE maximizing power control strategy by itself. Numerical results demonstrate that the proposed DNN-based power control method performs better than a conventional optimization approach with much-reduced execution time. This work opens a new possibility of using DL as an alternative optimization tool for the EE maximizing design of the next-generation wireless networks.


Author(s):  
Seamus M. McGovern ◽  
Surendra M. Gupta

NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate comparison of these solution techniques due to the decision-maker’s weighting schema potentially masking search limitations. In addition, many contemporary problems lack quantitative assessment tools, including benchmark data sets. This chapter proposes the use of lexicographic goal programming for use in comparing combinatorial search techniques. These techniques are implemented here using a recently formulated problem from the area of production analysis. The development of a benchmark data set and other assessment tools is demonstrated, and these are then used to compare the performance of a genetic algorithm and an H-K general-purpose heuristic as applied to the production-related application.


2006 ◽  
Vol 29 (5) ◽  
pp. 540-550 ◽  
Author(s):  
K. Farkas ◽  
O. Wellnitz ◽  
M. Dick ◽  
X. Gu ◽  
M. Busse ◽  
...  

2014 ◽  
Vol 899 ◽  
pp. 399-402
Author(s):  
Miriam Ledererova

Recycling building demolition waste in addition to environmental benefits is also economically interesting. In addressing the environmental issues it is recommended to give priority to recovery and rational utilization of waste with regard to their basic characteristics before disposal respectively storage. Issue of the use of recycled materials in concrete structures and their disposal in the world and in our longer pays much attention. Use and recycling of construction materials is a great asset for more prospective and progressive methods of construction waste utilizations. The program focused on waste management is therefore necessary to reconcile economic and environmental aspects in order to come to an optimal solution of the issue of waste and environmental protection.


Sign in / Sign up

Export Citation Format

Share Document