Using task migration to improve non-contiguous processor allocation in NoC-based CMPs

In this paper, a processor allocation mechanism for NoC-based chip multiprocessors is presented. Processor allocation is a well-known problem in parallel computer systems and aims to allocate the processing nodes of a multiprocessor to different tasks of an input application at run time. The proposed mechanism targets optimizing the on-chip communication power/latency and relies on two procedures: processor allocation and task migration. Allocation is done by a fast heuristic algorithm to allocate the free processors to the tasks of an incoming application when a new application begins execution. The task-migration algorithm is activated when some application completes execution and frees up the allocated resources. Task migration uses the recently deallocated processors and tries to rearrange the current tasks in order to find a better mapping for them. The proposed method can also capture the dynamic traffic pattern of the network and perform task migration based on the current communication demands of the tasks. Consequently, task migration adapts the task mapping to the current network status. We adopt a non-contiguous processor allocation strategy in which the tasks of the input application are allowed to be mapped onto disjoint regions (groups of processors) of the network. We then use virtual point-to-point circuits, a state-of-the-art fast on-chip connection designed for network-on-chips, to virtually connect the disjoint regions and make the communication latency/power closer to the values offered by contiguous allocation schemes. The experimental results show considerable improvement over existing allocation mechanisms.     

Proportional and double imitation rules for spectrum access in cognitive radio networks

In this paper, we tackle the problem of opportunistic spectrum access in large-scale cognitive radio networks, where the unlicensed Secondary Users (SUs) access the frequency channels partially occupied by the licensed Primary Users (PUs). Each channel is characterized by an availability probability unknown to the SUs. We apply population game theory to model the spectrum access problem and develop distributed spectrum access policies based on imitation, a behavior rule widely applied in human societies consisting of imitating successful behaviors. We develop two imitation-based spectrum access policies based on the basic Proportional Imitation (PI) rule and the more advanced Double Imitation (DI) rule given that a SU can only imitate the other SUs operating on the same channel. A systematic theoretical analysis is presented for both policies on the induced imitation dynamics and the convergence properties of the proposed policies to the Nash equilibrium. Simple and natural, the proposed imitation-based spectrum access policies can be implemented distributedly based on solely local interactions and thus is especially suited in decentralized adaptive learning environments as cognitive radio networks.     

水库补偿效益分配问题研究

水库补偿效益分配的步骤:一是确定水库补偿效益的施益方和受益方;二是计算水库补偿效益值;三是选择科学合理并能使各方较满意的分配方法.在分析水库补偿效益不确定性、可变性和博弈性的基础上,探讨了梯级水库串联式发电和并联式水库发电补偿效益影响因子的识别方法.水库补偿效益的分配方法主要有多目标综合分析法、模糊综合评判法、熵权法、离差平方法等,但都存在不足,需要进一步研究完善.     

多因子综合分析模型在赣江水量分配中的应用

借鉴国外水量分配模型-多因子综合分析模型,对水资源在赣江流域各用水区域之间进行了分配,旨在对这种水量分配模型进行探讨和实践,以期为我国的水量分配研究提供有实用价值的参考方法。运用该模型计算得到流域8个用水区如赣州、吉安、新余、萍乡、宜春、南昌、抚州、袁惠渠灌区的分水量分别占赣江水资源可分配总量的比例。针对模型应用的特点,指出了在今后的应用中需要进一步研究的内容。     

茅洲河流域再生水的综合优化配置

对深圳市茅洲河流域工业生产、农业灌溉、城市绿地浇灌、道路广场浇洒以及居民冲厕等方面的再生水需求进行分析,建立包括4个再生水厂、35个再生水用水片区的再生水优化配置模型,并运用LINGO求解其全局最优解。结果表明:①茅洲河流域再生水厂的生产能力为59.4万m3/d,仅能满足该流域污水处理需求的51.7%;②农业灌溉、工业回用、城市绿地浇灌、道路广场浇洒、居民冲厕等行业使用再生水的边际收益分别为3.7元/m3、21.6元/m3、4.1元/m32、.1元/m3、1.3元/m3。     

以水功能区为基本单元的流域水资源配置方法探讨

以水功能区为基本单元,以水功能区管理办法和分水协议为基础,以滦河流域为研究对象,综合考虑上下游工农业用水和生态环境用水,对各水功能区的水资源潜在利用量和实际可利用量确定方法进行分析,探讨滦河流域水资源配置和合理利用方案,为水资源的合理开发利用提供参考依据。     

Uplink resource allocation in OFDMA system using distributed antennas

In this article, we investigate uplink resource allocation in orthogonal frequency division multiple access （OFDMA） systems that use distributed antennas. The multiple distributed receiving antennas motivate us to exploit the spatial diversity to maximize the achievable rate of the system. Given constraints on the subcarrier allocation and the power limit of each user equipment （UE）, a mixed-integer optimization problem is formulated. We first propose a centralized greedy algorithm to find the maximum achievable rate of the system. Then a heuristic algorithm is proposed that can be implemented in a distributed manner. Simulation results show that the heuristic algorithm can approximately achieve the maximum achievable rate of the system and result in significant system performance improvement over the approach assigning one user to each subcarrier.     

Joint relay selection and power allocation for amplify-and-forward two-path relaying networks

This paper presents a joint relay selection and power allocation scheme for amplify-and-forward two-path relaying networks,in which diferent relay nodes forward information symbols alternatively in adjacent time slots.Our approach is based on the maximization of the received signal-to-noise ratio under total power consumption by the transmission of the symbol.We show that in spite of inter-relay interferences,the maximization problem has a closed-form solution.Simulation results explicitly indicate that the performance of proposed approach outmatches the existing methods including equal power allocation and one-path relaying.     

Dynamically reconfigurable radio-over-fiber network with medium access control protocol to provide network access to train passengers

An innovative dynamically reconfgurable radio-over-fber(RoF)network equipped with an intelligent medium access control(MAC)protocol is proposed to provide broadband access to train passengers in railway high-speed mobile applications.The proposed RoF network architecture is based on a reconfgurable control station and remote access unit(RAU)that is equipped with a fxed flter and tunable flter.The proposed hybrid frequency-division multiplexing/time division multiple access(FDM/TDMA)based MAC protocol realizes failure detection/recovery and dynamic wavelength allocation to remote access units.Simulation result shows that with the proposed MAC protocol,the control station can detect failures and recover and dynamic wavelength allocation can increase the wavelength resource utilization to maintain network performance.     

A suboptimal joint bandwidth and power allocation for cooperative relay networks＂ a cooperative game theoretic approach

In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.