Dynamic Load Balancing Based on Restricted Multicast Tree in Homogeneous Multiprocessor Systems

To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.

CLUSTER OF WORKSTATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL TREE COMPUTATION DEPTH-FIRST-SEARCH

The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.

Balance in Random Trees

We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly &#107-balanced for any &#107 &#8805 &#51. Definition: Color the vertices of graph &#71 with two colors. Color an edge with the color of its endpoints if they are colored with the same color. Edges with different colored endpoints are left uncolored. &#71 is said to be balanced if neither the number of vertices nor and the number of edges of the two different colors differs by more than one.

On Embedding of m-Sequential k-ary Trees into Hypercubes

In this paper, we present an algorithm for embedding an m-sequential k-ary tree into its optimal hypercube with dilation at most 2 and prove its correctness.

Implementation Study of Dynamic Load Balancing Algorithm of Parallel Tree Computation on Clusters of Heterogeneous Workstation

The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).

基于安全裕度的网联自主汽车换道行为风险量化及动态平衡模型

伴随车联网技术的发展,道路交通流呈现智能网联自动驾驶汽车与传统人工驾驶车辆混合共存发展态势,研究网联新型混合车流换道驾驶行为的风险特性极其重要。基于安全裕度理论,建立了换道行为风险量化模型,采用故障树分析法,推导换道的时间和空间风险,进行时空融合的风险评定量化,以判断车辆是否处于安全变道状态,并动态平衡车辆换道行为可能存在的风险。运用SUMO软件对建立的量化模型进行仿真验证分析,碰撞时间倒数与瞬时风险系数均值分别下降0.1与0.05,同时变化趋势趋于稳定。安全裕度风险量化模型使换道风险得到了有效控制的同时,交通流的稳定性得到了较大提高,可保障未来网联环境中自主驾驶车辆队列的稳态运行,从而提高交通容量和交通效率。

基于Spanning Tree的网络负载均衡实现研究

冗余的网络环境能够保证网络的稳定运行,生成树协议能够防止冗余的网络环境下产生的网络环路,生成树的默认配置导致整个网络运行效率低下,与VLAN配合可以提供链路负载均衡,实现网络的安全、稳定、高效运行.本文通过网络拓扑的构建以及具体的配置过程实现了基于生成树的网络负载均衡.

Effect of Different Fertilizing Methods on Zinc Nutrition in Zn-Deficiency Apple Trees

Red Fuji apple trees of Zn-deficiency were used as material in the experiment. The effect of different Zn application methods on the regularity of Zn transportation and nutrition was studied. It was found that the storage of Zn in the branches was greatly increased by foliar application of the solution of 15% ZnSO4·7H2O before abscission. It had advantage to keep suitable Zn content in leaves, branches and roots, as well as between Zn and P and K, which increased Zn transportation and reusability. Zn content in roots increased when Zn was used in soil in autumn. However, the absorbed Zn did not transport to the top of the plant. It was used by the plant next year. Foliar application of ZnSO4·7H2O at early stage of the plant growth enhanced Zn content of the branch. However, the effect was kept for a short time. It had little effect on Zn transportation when Zn was sprayed three weeks after blossoming.

Enhancing Navigability:An Algorithm for Constructing Tag Trees

Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.

一个调度Out-Tree任务图的启发式算法

任务调度问题是并行分布式计算中的挑战性问题之一。大多数实际的调度算法是启发式的因而常常具有改进的余地。针对Out-Tree任务图这一基本结构提出一个基于任务复制的启发式调度算法,该算法在确保最短调度长度的同时,注重处理器的负载平衡,以达到节约处理器的目的。比较性实验的结果表明,该算法确保了最短调度长度且使用的处理器最少。因而,该算法提高了系统的利用率,避免消耗过多的资源,实际应用性更好。

LOW-COST HIGH PERFORMANCE CLUSTER OF WORK-STATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL DEPTH-FIRST SEARCH(DFS)

This paper presented an idea to replace the traditionally expensive parallel machines by heterogeneous cluster of workstations. To emphasise the usability of cluster of workstations platform for parallel and distributed computing, also the paper presented the status report on the effort and experiences for the implementation of a dynamic load balancing for parallel tree computation depth first search(DFS) on the cluster of a workstations project. It compared the speedup performance obtained from our platform with that obtained from the traditional one. The speedup results show that cluster of workstations can be a serious alternative to the expensive parallel machines.

Novel load balancing DHT scheme for the heterogeneous system

The capacities of the nodes in the peer-to-peer system are strongly heterogeneous, hence one can benefit from distributing the load, based on the capacity of the nodes. At first a model is discussed to evaluate the load balancing of the heterogeneous system, and then a novel load balancing scheme is proposed based on the concept of logical servers and the randomized binary tree, and theoretical guarantees are given. Finally, the feasibility of the scheme using extensive simulations is proven.

Productivity and energy balance of forest plantation harvesting in Uganda

The study evaluated the productivity and energy balance of the harvesting and the extraction of wood in plantation of exotic tree species, i.e., Pinus patula （Schiede ex Schlectendahl et Chamisso） and Cupressus lusitanica （Mill.）. The harvesting and extraction operations concerned clear-cut felling on two different types of terrain （gentle and steep terrain） and two levels of prun- ing. The results show that cutting is not affected by the terrain gradient whereas the pruning condition shows a significant effect on the delimbing operation. The productivity of cutting is evaluated at 28.1 m3.d-1 for unpruned trees and at 30.2 m3.d t for pruned trees. For the extraction phase, rolling was significantly affected by terrain conditions. On steep terrain, the gross productivity can be evaluated at 22.5 m3.d 1 for an extraction distance of 40 m, while for the same distance on gentle terrain the productivity decreases to 14.1 m3.d~. As a result, the steep terrain condition showed higher energy efficiency, suggesting that it is the more efficient system of extraction. The productivity model and the energy balance resulting from the study provide a better understanding of the variables af- fecting motor-manual cutting and rolling extraction in exotic plantations in Uganda.

Effectively Handling Network Congestion and Load Balancing in Software-Defined Networking

The concept of Software-Defined Networking(SDN)evolves to overcome the drawbacks of the traditional networks with Internet Protocol(I.P.)packets sending and packets handling.The SDN structure is one of the critical advantages of efficiently separating the data plane from the control plane tomanage the network configurations and network management.Whenever there aremultiple sending devices inside the SDNnetwork,theOpenFlow switches are programmed to handle the limited number of requests for their interface.When the recommendations are exceeded from the specific threshold,the load on the switches also increases.This research article introduces a new approach named LBoBS to handle load balancing by adding the load balancing server to the SDN network.Besides,it is used to maximize SDN’s reliability and efficiency.It also works in coordination with the controller to effectively handle the load balancing policies.The load balancing server is implemented to manage the switches load effectively.Results are evaluated on the NS-3 simulator for packet delivery,bandwidth utilization,latency control,and packet decision ratios on the OpenFlow switches.It has been found that the proposed method improved SDN’s load balancing by 70%compared to the previous state-of-the-art methods.

Family tree and population: Distinction and similarity of the analysis on example of hemophilia

On the basis of Hardy-Weinberg law the distinction in the philosophy of the description of a family tree and a population is considered. With the help of introduction of the equivalent constant mutagen factor both in a family tree and in a population, the analysis of hemophilia is led. Influence of selection at presence of hemophilia is considered. On the basis of idea of Danforth and Haldane about the balance mutagenesis and selection at presence of hemophilia, the inter-relation of selection parameter and the equivalent constant mutagen factor is found. It is shown, that dynamics of development of hemophilia in a family tree and in population are similar.

Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.

Load Balancing for Hex-Cell Interconnection Network

The hex-cell is one of the interconnection networks used for parallel systems. The main idea of the hex-cell is that there are hexagon cells that construct the network;each one of those cells has six nodes. The performance of the network is affected by many factors one of the factors as load balancing. Until the moment of writing of this paper, there is no load balancing algorithm for this network. The proposed algorithm for dynamic load balancing on hex-cell is based on Tree Walking Algorithm (TWA) for load balancing on tree interconnection network and the ring all to all broadcast.

基于优化决策树算法的变电站故障诊断系统研究

为有效提升变电站运行期间故障自动化诊断效率和准确率,采用阈值近邻迭代法对样本数量进行优化,同时引入平衡系数对测试属性选择进行优化,然后再采用优化二分离散算法对连续属性离散性进行优化,构建基于优化决策树算法的变电站故障诊断系统。通过优化决策树、ID3以及C4.5三种算法的应用效果对比分析,得出基于优化决策树算法分类准确性更高、决策树构建速度更快、决策树规模更小这一结论,能够显著提升监控系统在变电站运行期间的应用效果,对于变电站长期运行稳定与安全具有重要意义。

云存储多卷负载均衡的LSM键值存储系统

单个云存储卷的IOPS和带宽性能受到限制,通过组合使用多个云存储卷的方式能以较低的费用获得更高的性能.但是,现有工作缺乏针对多云存储卷优化的LSM键值存储系统的探究.首先将现有多路径或哈希负载均衡的方案应用于使用多云存储卷的LSM键值存储系统,相对单个大容量卷的性能有显著提升;但是,现有多卷负载均衡方案的写数据策略,无法感知LSM键值存储系统的数据布局特点,导致各成员卷之间仍然存在负载不均衡的问题,不能充分发挥出多卷的最大性能.为此,提出一种云存储多卷负载均衡的LSM键值存储系统TANGO.在LSM键值存储系统由compaction新生成的sstable落盘之前,先根据统计的各个成员卷的关键信息,判断sstable与各成员卷的键范围重叠情况,然后选择键范围重叠最小的成员卷进行写入;针对读为主的负载,无法通过compaction达到负载均衡,TANGO采用后台数据迁移方式进一步达到负载均衡.在亚马逊云存储卷上的评估表明,相比相同存储容量的单卷,采用了TANGO方案的同等容量的多卷可提高7倍左右的性能;相比其它多卷方案,TANGO能提升20%以上的性能,且各成员卷间负载更加均衡.

基于平衡二叉树的数控机床数据去重备份算法

针对传统数据备份算法无法有效剔除备份过程中所产生的冗余数据,导致数据存储空间利用率下降,提出基于平衡二叉树的数控机床数据去重备份算法。通过编辑距离算法计算数控机床数据的属性集,得到数据间的相似度,依靠Canopy算法获取数据的关键属性,并结合数据相似度剔除存在重复记录的数据,最后将需要备份的机床元数据以时间戳作为基础,使用平衡二叉树算法对数据进行备份,并结合数据冗余挖掘模型,剔除在数据备份与恢复过程中所产生的冗余数据,实现数据去重备份。实验证明,所提方法可以有效避免因重复数据传输量提升而引起的带宽瓶颈效应,提升数据存储空间利用率。