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 su...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.展开更多
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...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.展开更多
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 m...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.展开更多
文摘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.
基金National Natural Science Foundations of China(No. 61103175,No. 11141005)Technology Innovation Platform Project of Fujian Province,China (No. 2009J1007)+1 种基金Key Project Development Foundation of Education Committee of Fujian Province,China (No.JA11011)Project Development Foundations of Fuzhou University,China (No. 2010-XQ-21,No. XRC-1037)
文摘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.
文摘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.
