PARALLEL ADAPTIVELY MODIFIED CHARACTERISTIC BASIS FUNCTION METHOD BASED ON STATIC LOAD BALANCE

Characteristic Basis Function Method (CBFM) is a novel approach for analyzing the ElectroMagnetic (EM) scattering from electrically large objects. Based on dividing the studied object into small blocks, the CBFM is suitable for parallel computing. In this paper, a static load balance parallel method is presented by combining Message Passing Interface (MPI) with Adaptively Modified CBFM (AMCBFM). In this method, the object geometry is partitioned into distinct blocks, and the serial number of blocks is sent to related nodes according to a certain rule. Every node only needs to calculate the information on local blocks. The obtained results confirm the accuracy and efficiency of the proposed method in speeding up solving large electrical scale problems.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

Status-Aware Resource Adaptation in Information-Centric and Software-Defined Network

In recent years, realising a ＂clean- state＂ design for the future Internet has become an important research focus. An architecture com- bining an Information-Centric Network （ICN） and Sottware-Defmed Network （SDN） （IC-SDN） has gradually attracted more attention. How- ever, the existing studies regarding IC-SDN still lack support in terms of the ＂network status awareness＂ function, resulting in unreasonable resource allocation. In this paper, we propose a new status-aware resource adaptation sche- me, i.e. a status-aware module is embedded into basic elements （Forwarding Node （FN） and Resource adaption Manager （RM））. The FNs collect the network status dynamically for the controller to reallocate network resources accor- ding to the fluctuations in environmental con- ditions. Simulation results show that, compared with the existing IC-SDN mechanism, the pro- posed scheme reduced the link bandwidth var- iance by 56% and the content delivery latency by 40%. The proof-of-concept implementation demonstrates the feasibility of our proposed sc- heme for small-scale deployment.

An adaptive dynamic feedback load balancing algorithm based on QoS in distributed file system

An adaptive dynamic load balancing algorithm based on QoS is proposed to improve the performance of load balancing in distributed file system,combining the advantages of a variety of load balancing algorithms.The new algorithm uses a tuple containing the number of files and the total file size as the QoS measure for the requested task.The master node sets a threshold for the requested task based on the QoS to filter storage nodes that meet the requirements of the task.In order to guarantee the reliability of the new algorithm,we consider the impact of CPU utilization,memory usage,disk IO occupancy rate,network bandwidth usage and hard disk usage on load balancing performance when calculating the real-time load balancing of storage nodes.The heterogeneity of the network is considered when the master node schedule task assignments to ensure the fairness of the algorithm.The comprehensive evaluation value is determined based the performance load ratio,which is calculated from the real-time load value of the storage node and a performance value after normalization.The master node assigns tasks to the storage node with the highest comprehensive evaluation value.The storage nodes provide adaptive feedback based on changes in the degree of connectivity,rather than periodic update of the load information.The actual distributed file system environment is set up on the server cluster,the performance of the new algorithm is tested through a contrast experiment.The experimental results show that the new algorithm can effectively reduce the average response time of the system,improve throughput,and enable the system load to reach a good balance.

Adaptive and scalable load balancing for metadata server cluster in cloud-scale file systems

Big data is an emerging term in the storage indus- try, and it is data analytics on big storage, i.e., Cloud-scale storage. In Cloud-scale （or EB-scale） file systems, load bal- ancing in request workloads across a metadata server cluster is critical for avoiding performance bottlenecks and improv- ing quality of services. Many good approaches have been pro- posed for load balancing in distributed file systems. Some of them pay attention to global namespace balancing, making metadata distribution across metadata servers as uniform as possible. However, they do not work well in skew request dis- tributions, which impair load balancing but simultaneously increase the effectiveness of caching and replication, in this paper, we propose Cloud Cache （C2）, an adaptive and scal- able load balancing scheme for metadata server cluster in EB-scale file systems. It combines adaptive cache diffusion and replication scheme to cope with the request load balanc- ing problem, and it can be integrated into existing distributed metadata management approaches to efficiently improve their load balancing performance. C2 runs as follows： 1） to run adaptive cache diffusion first, if a node is overloaded, load- shedding will be used; otherwise, load-stealing will be used; and 2） to run adaptive replication scheme second, if there is a very popular metadata item （or at least two items） causing a node be overloaded, adaptive replication scheme will be used,in which the very popular item is not split into several nodes using adaptive cache diffusion because of its knapsack prop- erty. By conducting performance evaluation in trace-driven simulations, experimental results demonstrate the efficiency and scalability of C2.

移动边缘计算不确定性任务持续卸载及资源分配方法

移动边缘计算场景中任务的不确定性增加了任务卸载及资源分配的复杂性和难度.鉴于此,提出一种移动边缘计算不确定性任务持续卸载及资源分配方法.首先,构建一种移动边缘计算不确定性任务持续卸载模型,通过基于持续时间片划分的任务多批次处理技术应对任务的不确定性,并设计多设备计算资源协同机制提升对计算密集型任务的承载能力.其次,提出一种基于负载均衡的自适应策略选择算法,避免计算资源过度分配导致信道拥堵进而产生额外能耗.最后,基于泊松分布实现了对不确定任务场景模型的仿真,大量实验结果表明时间片长度减小能够降低系统总能耗.此外,所提算法能够更有效地实现任务卸载及资源分配,相较于对比算法,最大可降低能耗11.8%.

高分三号数据分布式自适应负载均衡并行转换算法研究

针对PolSARpro软件自带高分三号数据转换模块无法自适应分布式差异化硬件环境问题,提出了一种按照该软件的数据格式要求进行分布式自适应负载均衡并行转换算法,将高分三号多极化数据快速、精确地进行定标与格式转换,对不同硬件配置环境自适应,能够抗数据偏斜,并且通过KingMap V10.5平台实现了算法并在实际数据中进行测试,试验结果表明性能提升了约12.7倍,验证了算法的可行性、高效性和正确性。

面向异构处理平台任务调度的麻雀优化算法

针对当前异构信号处理平台中各处理器任务数量分配不均衡、处理器性能发挥不完全以及系统运行效率低的问题,文中提出一种面向异构处理平台的麻雀优化算法。该算法利用了麻雀算法较强的全局寻优能力和麻雀种群内部的高效工作机制。在经典麻雀算法基础上,文中提出了符合任务调度的二进制异或编解码规则,将离散的任务分配方案映射为连续的麻雀位置信息。将处理器负载均衡指数作为适应度函数,选取每次迭代中的最优解;在麻雀遍历任务时,采用任务优先级分流排序策略。对通信密集型任务和计算密集型任务采取不同的计算式得到更符合任务特点的遍历顺序,生成随机任务图,并将所提算法同ICPA(Improved Critical Path Algortthm)算法进行对比。仿真结果表明,相比于ICPA算法,所提算法的负载均衡指数平均优化率为60%,各处理器负载情况更加均衡,能更好地发挥异构处理平台的整体效能。

电能表数据采集终端负载自适应均衡方法研究

针对电能表数据采集终端数据量及访问量高导致的负载失衡问题,研究基于元模型的电能表数据采集终端负载自适应均衡方法。将电能表数据采集终端的电能表数据作为模型元数据,经数据提取、转化、加载处理后,将处理完成的数据存储至元数据仓库内。在元数据负载大小未知条件下,创新性地采用基本负载均衡算法分配元数据仓库中元数据的负载,以求解元数据的负载量。当负载过大时,通过迁移负载低节点的目录子树,均衡处理了元数据的负载量,实现了电能表数据采集终端访问负载均衡。实例测试结果表明,该方法应对速度快。该方法降低了电能表数据采集终端负载,解决了元数据请求激增问题,提高了集群负载的均衡程度。

网络设备负载均衡环境适应性测试方法研究

随着网络应用的不断增加以及用户需求的不断增长,网络设备面临着越来越大的负载压力。为了确保网络设备能够稳定、可靠运行,设备负载均衡环境适应性能力至关重要。为提升网络性能和用户体验,针对网络设备负载均衡环境适应性的测试具有重要意义。本文主要通过对网络设备在负载均衡环境中应用部署场景的介绍,总结出网络设备负载均衡环境适应性测试方法。

一种面向会话的自适应负载均衡算法

在论述负载均衡技术相关工作的基础上,基于IP报文头多域分类方法,提出自适应负载均衡算法MSF(minimum sessions first),通过动态调整TCP流数目最少的流束,能够在各处理节点间保持动态负载均衡的同时维持会话的完整性.模拟结果表明,MSF算法具有设计简洁、负载均匀度好、重映射破坏度小、会话完整性破坏度小等优点,对不同负载具有良好的综合性能.该算法已经成功地应用在国防科学技术大学计算机学院研制的高速网络安全设备中,在保持较好的负载均衡效果的前提下保证了会话的完整性,提高了网络安全设备的性能.

对象存储系统中自适应的元数据负载均衡机制

面向对象的存储系统在研究、工程以及服务领域均得到了广泛的应用.在面向对象的存储系统中,元数据的负载均衡对于提高整个系统的I/O性能具有重要的作用.现有的元数据负载均衡策略不能动态地平衡元数据的访问负载,而且自适应性以及容错特性有待提高.提出了一种自适应的分布式元数据负载均衡机制(adaptabledistributed load balancing of metadata,简称ADMLB),包含基本的负载均衡算法和分布式的增量负载均衡算法.采用基本的负载均衡算法按照服务器的性能公平地分布负载,使用分布式的负载均衡算法定时地调整负载的分布.ADMLB采取分布式的方法均衡地在元数据服务器之间分布负载,根据负载的变化自适应地进行调整,具有很好的容错特性,而且用户可以高效地定位元数据服务器.

均衡虚拟网构建算法研究

如何在物理资源有限的条件下构建出满足用户需求的虚拟网是一个热点问题。该文针对虚拟网(Virtual Network,VN)的构建方法进行了论述,分析了虚拟网构建的数学模型,给出了构建策略的若干重要原则,为提高构网成功率,分别提出基于链路负载均衡度和节点负载均衡度的虚拟网构建算法,在此基础上提出了考虑均衡的自适应虚拟网构建算法(Balanced Adaptive VN Construction Algorithm,BACA)以及链路失效后的处理方法和迁移策略。最后,通过仿真实验,从虚拟网构建需求接收率和构建后整个网络的链路均衡度以及节点均衡度3个方面验证了BACA的优越性。

一种自适应动态负载均衡算法

负载均衡问题是一个经典的组合优化难题,该文建立了一个集群中的负载均衡问题模型,并提出了一种旨在最小化负载均衡开销的动态自适应算法。由于集群中存在网络延时,所以负载重分配的开销很大一部分取决于CPU间发送、接受的消息的最大数量。该负载均衡算法以最小化负载重分配时CPU间消息发送、接受的数量为目标,根据过载、轻载CPU数量的变化动态调用D算法和R算法,以降低负载均衡开销。

面向物联网传感器信息的数据分配策略

物联网作为国内外新兴的热门技术,正在深刻地影响着人们的生产生活,它在带来诸多好处的同时也给信息存储领域带来挑战.物联网信息存储中心需要根据其数据特性结合分布式实时数据库信息存储管理的优点,设计与之相适应的数据存储方案,而数据分配策略作为数据存储方案的关键技术是研究的重点.根据物联网传感器信息的海量性、时空相关性、访问失衡性和连续变化性,需要一种基于时域的数据分配模型与之相适应,以此设计出基于自适应时域负载反馈的动态数据分配策略(adaptive time domain data allocation,ATDA).策略根据数据特征,将静态数据分配问题归约成简单线性规划问题,同时采用自适应时域对负载信息进行反馈,最后设置动态负载门限函数实现数据的动态分配.实验表明,该策略与同类Random、Bubba算法相比,在系统短时域负载均衡(LBST)、系统数据迁移量(DM)方面具有更好的性能.

网络计算机集群负载均衡机制的研究

目前使用单台网络计算机应用服务器难以满足大量用户的并发访问需求,在网络计算机系统中引入集群/负载均衡技术是解决这一问题的理想途径。研究网络计算机集群的负载均衡机制。设计和实现了适合于网络计算机应用模式的负载评估方法及负载状态更新机制,并在此基础上提出和实现了一种基于分布式协商的动态负载均衡算法。

考虑时空特性分布的电动汽车充电负荷预测

随着电动汽车的快速推广应用,对电动汽车充电负荷需求实现较准确的预测也逐步成为电动汽车领域研究的热点。为解决电动汽车大量推广应用后的电网负荷平衡问题,在分析电动汽车时空特性分布的基础上,提出了一种基于自适应动态三次指数平滑法的电动汽车负荷预测模型。该预测模型对传统的三次指数平滑模型进行改进,并根据误差绝对值之和最小的原则及时调整,以获得理想的平滑系数,再对后续的年度最大日电动汽车充电量和不同小区的典型日电动汽车充电负荷进行预测。以某工业小区和居民小区电动汽车负荷分布为例进行仿真,仿真结果表明所提方法误差较小,给出的充电桩规划建议也切实可行。

两柱掩护式液压支架承载特性及其适应性研究

基于平面杆系模型研究了两柱掩护式液压支架承载特性,根据支架接顶情况的不同,对该型支架的力学平衡区与承载能力进行了定义与划分,并对支架承载能力影响因素进行了研究。在此基础上,结合该型支架结构特点,应用岩梁模型研究了液压支架顶梁柱帽的合理位置,给出了支架顶梁前后比的解析结果,并由此得出了支护强度估算公式,理论结果与经验数据一致。实践表明,理论结果能够很好地解释两柱掩护式液压支架工作特性,为支架设计提供参考。