The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter stra...The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.展开更多
In recent years,the number and size of data centers and cloud storage systems has increased.These two corresponding trends are dra matically increasing energy consumption and disk failure in emerging facilities.This p...In recent years,the number and size of data centers and cloud storage systems has increased.These two corresponding trends are dra matically increasing energy consumption and disk failure in emerging facilities.This paper describes a new chunk-based proportion al-power layout called CPPL to address the issues.Our basic idea is to leverage current proportional-power layouts by using declus tering techniques.In this way,we can manage power at a much finer-grained level.CPPL includes a primary disk group and a large number of secondary disks.A primary disk group contains one copy of available datasets and is always active in order to respond to in coming requests.Other copies of data are placed on secondary disks in declusterd way for power-efficiency and parallel recovery at a finer-grained level.Through comprehensive theoretical proofs and experiments,we conclude that CPPL can save more power and achieve a higher recovery speed than current solutions.展开更多
基金funded by the NationalKey Research and Development Program of China under Grant No.11974373.
文摘The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.
基金supported in part by the US National Science FoundationGrant CCF-0811413,CNS-1115665,CCF-1337244National ScienceFoundation Early Career Award 0953946
文摘In recent years,the number and size of data centers and cloud storage systems has increased.These two corresponding trends are dra matically increasing energy consumption and disk failure in emerging facilities.This paper describes a new chunk-based proportion al-power layout called CPPL to address the issues.Our basic idea is to leverage current proportional-power layouts by using declus tering techniques.In this way,we can manage power at a much finer-grained level.CPPL includes a primary disk group and a large number of secondary disks.A primary disk group contains one copy of available datasets and is always active in order to respond to in coming requests.Other copies of data are placed on secondary disks in declusterd way for power-efficiency and parallel recovery at a finer-grained level.Through comprehensive theoretical proofs and experiments,we conclude that CPPL can save more power and achieve a higher recovery speed than current solutions.
