通信无线资源调度系统设计

为了达到对空间无线电资源的有效管理,提高频谱资源的利用率,在认知用户可以准确获取空间频谱利用情况和无线资源特征的前提下,提出了短时和长期学习的无线资源体统调度模型。根据认知用户对空间某点的无线信号进行特征提取,得到频谱的利用情况和各个信道的特征参数,如调制方式、带宽、中心频率和功率,根据用户的发射机特性,利用层次分析法结合测量的信道参数,给出可用信道的特征参数,以供认知用户参考。长期对某一固定点进行测量记录后根据历史数据进行复合,作为认知用户机特征参数跳变的根据,以给出合理的建议。     

Controller design for a wind farm, considering both power and load aspects

In this paper, a wind farm controller is developed that distributes power references among wind turbines while it reduces their structural loads. The proposed controller is based on a spatially discrete model of the farm, which delivers an approximation of wind speed in the vicinity of each wind turbine. The control algorithm determines the reference signals for each individual wind turbine controller in two scenarios based on low and high wind speed. In low wind speed, the reference signals for rotor speed are adjusted, taking the trade-off between power maximization and load minimization into account. In high wind speed, the power and pitch reference signals are determined while structural loads are minimized. To the best of authors’ knowledge, the proposed dynamical model is a suitable framework for control, since it provides a dynamic structure for behavior of the flow in wind farms. Moreover, the controller has been proven exceptionally useful in solving the problem of both power and load optimization on the basis of this model.     

按需轮循的蓝牙微微网调度算法与性能评估

提出了一种低时延、高信道利用率与公平性好的按需轮循的蓝牙微微网调度算法.首先通过速率估计过程计算出上行链路分组到达率的估计值,然后在主调度过程中分别计算各链路对自上次轮循时刻到当前时刻的分组到达数量的估计值与等待时间,根据提出的动态轮循选择规则选出优先度最高的链路对进行轮循,再根据自适应轮循间隙规则计算出下次轮循应该进行的时间.分别在混合、下行与上行三种传输模型的仿真中进行了与其他经典算法的性能比较.结果表明:算法在前两种传输模型中具有最佳的整体性能,尤其是时延分别降低了24.1%与41.4%以上,在第三种传输模型中也具有较佳的整体性能.该算法效率高、实现复杂度低,可应用于蓝牙与其他无线网络.     

一种可提供QoS保障的新型交换结构

本文采用带缓存交叉开关作为核心交换单元,构建了一种空分复用扩展的联合输入/交叉节点/输出排队(SDM-CICOQ)交换结构,从理论上证明了当扩展因子为2时,SDM-CICOQ交换结构可以获得100%的吞吐量,并且能够完全模拟输出排队(OQ)交换结构,从而能够提供服务质量(QoS)保障.本文还给出了一种层次化优先级调度(HPS)方案作为SDM-CICOQ交换结构调度机制的工程设计参考,仿真结果表明采用HPS调度方案SDM-CICOQ交换结构可获得良好的性能.     

基于扩展控制流图的片上存储器分配策略

本文提出一种基于扩展控制流图(ECFG)的片上存储器(Scratch-Pad Memory,SPM)分配策略,该策略首先把程序划分为全局变量、全局堆栈、指令块等节点,用包含节点和节点间关系的ECFG来描述应用程序,接着采用考虑了节点间关系的改进的背包算法把选中的节点分配到SPM中.实验表明该策略比采用单纯背包算法的SPM分配策略减少应用程序执行时间11%,比不使用SPM时减少56%,大大提高了SoC存储子系统的性能.     

改进的资源限制流抽样算法

该文分析了hardflow算法抽样率与大流抽样损失率的关系,提出两个改进算法以降低大流抽样损失率与抽样率的比值rd,并讨论了缓冲区大小、测量周期对相对误差的影响以及参数的选取。结果表明：与hardflow相比,在低抽样率(4.5%),两种改进算法的rd比hardflow分别降低1.4和6.6,当抽样率提高至一定水平时(11.3%),则3种算法的rd均趋于0。     

iRGRR/PM：一种新的高速crossbar分组调度策略

iRGRR(iterative Request-Grant-based Round-Robin)算法是一种输入排队crossbar调度算法,具有硬件易实现、可扩展性强、性能优良等优点。在此基础上,该文提出一种新的高速crossbar分组调度策略iRGRR/PM(iRGRR with Packet Mode),可以更好地支持IP分组的调度,能够被应用于高速、大容量的路由器中。与iRGRR算法相比,iRGRR/PM简化了分组输出重组模块的设计,并且提高了crossbar的带宽资源利用率。文中简单分析了两种算法间的分组时延关系,并进行了详尽的仿真研究。结果表明：在相同条件下,iRGRR/PM算法具有更高的吞吐量,尤其在非均匀业务流下能获得接近100%的吞吐量;调度长分组时,iRGRR/PM算法具有更好的时延性能。     

复杂密度场测量中的莫尔层析重建技术

将一种新的莫尔层析重建算法应用于复杂流场测量.该算法由莫尔偏折原理和网格重建技术推导得出,直接使用光线偏折角进行修正迭代,适用于有限角采样和包含遮挡物等非完全数据条件下的层析重建.应用该算法,对火箭燃气射流场和高超音速流场的莫尔偏折图进行了处理和计算,重建出流场截面的密度分布,并对重建结果进行了分析.     

Load prediction based elastic resource scheduling strategy in Flink

In order to solve the problem that the load of big data stream computing platform fluctuates drastically while the cluster was suffering from the performance bottleneck due to the shortage of computing resources,the load prediction based elastic resource scheduling strategy in Flink (LPERS-Flink) was proposed.Firstly,the load prediction model was set up as the foundation to propose the load prediction algorithm and predict the variation tendency of the processing load.Secondly,the resource judgment model was set up to identify the performance bottleneck and resource redundancy of the cluster while the resource scheduling algorithm was proposed to draw up the resource rescheduling plan.Finally,the online load migration algorithm was proposed to execute the resource rescheduling plan and migrate processing load among nodes efficiently.The experimental results show that the strategy provides better performance promotion in the application with drastically fluctuating processing load.The scale and resource configuration of the cluster responded to the variation of processing load in time and the communication overhead of the load migration was reduced effectively.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].