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

Abstract

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.

BGN: A Novel Scatternet Formation Algorithm for Bluetooth-Based Sensor Networks

“…Recently, researchers proposed many scatternet formation algorithms which can be roughly divided into three categories: tree-based algorithms [10][11][12][13], ring-based algorithms [14][15][16] and mesh-based algorithms [17][18][19][20][21][22].…”

“…Rashid Bin Muhammad [11] proposed a method for range assignment problem on the Steiner tree based topology, but the method should throw away nodes that are too far from neighbor nodes which lead to too many dense nodes for the connectivity. Tang et al [12] proposed a tree-based heuristic algorithm for mobile and pervasive computing based on special network processors. Saginbekov et al [13] also proposed a tree-based shortest path algorithm, trying to realize the energy saving through minimizing the energy consumption during communication.…”

Flexible Multi-Authority Attribute-Based Signature Schemes for Expressive Policy

“…And the scheme in [21] even support NOT gate. To our knowledge, most ABS schemes cannot simultaneously implement an expressive policy and construct the security in standard model, that is, Diffie-Hellman assumptions, which are as famous as Diffie-Hellman key based methods used in [27,28] to improve the security of wireless networks, in which other techniques, such as register allocation method [29], MISP protocol [30], and SVO logic [31], have been utilized too.…”