For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarc...For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.展开更多
The Virtual Machine(VM) placement is a serious problem to limit the improvement of resource utilization of data center. The VM traffic bandwidth demand is a Non zero-sum resource that the global traffic sum is relativ...The Virtual Machine(VM) placement is a serious problem to limit the improvement of resource utilization of data center. The VM traffic bandwidth demand is a Non zero-sum resource that the global traffic sum is relative with each VM placement position. In this paper, we introduce a new improved traffic constant algorithm in the data center, called Degree and Weighted Maximum Traffic Ratio(DWMTR). The proposal DWMTR algorithm defines a new weighted ratio parameter in this paper. The main body of the parameter is constructed with the ratio, current overall intra-cluster traffic divided by current overall inter-cluster traffic, when a new VM places in the data center. The DWMTR algorithm has the ability to constraint the inter-cluster traffic incensement more strictly than the current VM placement algorithms based on traffic bandwidth allocation. For this algorithm based on the theoretical analysis and simulation, it confirms the proposed DWMTR possesses smaller global interactive traffic cost than the control group algorithms in the appointed VM placement in the three-layer data center model.展开更多
Cloud computing has emerged as a vital platform for processing resource-intensive workloads in smart manu-facturing environments,enabling scalable and flexible access to remote data centers over the internet.In these ...Cloud computing has emerged as a vital platform for processing resource-intensive workloads in smart manu-facturing environments,enabling scalable and flexible access to remote data centers over the internet.In these environments,Virtual Machines(VMs)are employed to manage workloads,with their optimal placement on Physical Machines(PMs)being crucial for maximizing resource utilization.However,achieving high resource utilization in cloud data centers remains a challenge due to multiple conflicting objectives,particularly in scenarios involving inter-VM communication dependencies,which are common in smart manufacturing applications.This manuscript presents an AI-driven approach utilizing a modified Multi-Objective Particle Swarm Optimization(MOPSO)algorithm,enhanced with improved mutation and crossover operators,to efficiently place VMs.This approach aims to minimize the impact on networking devices during inter-VM communication while enhancing resource utilization.The proposed algorithm is benchmarked against other multi-objective algorithms,such as Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),demonstrating its superiority in optimizing resource allocation in cloud-based environments for smart manufacturing.展开更多
Cloud data centers face the largest energy consumption.In order to save energy consumption in cloud data centers,cloud service providers adopt a virtual machine migration strategy.In this paper,we propose an efficient...Cloud data centers face the largest energy consumption.In order to save energy consumption in cloud data centers,cloud service providers adopt a virtual machine migration strategy.In this paper,we propose an efficient virtual machine placement strategy(VMP-SI)based on virtual machine selection and integration.Our proposed VMP-SI strategy divides the migration process into three phases:physical host state detection,virtual machine selection and virtual machine placement.The local regression robust(LRR)algorithm and minimum migration time(MMT)policy are individual used in the first and section phase,respectively.Then we design a virtual machine migration strategy that integrates the process of virtual machine selection and placement,which can ensure a satisfactory utilization efficiency of the hardware resources of the active physical host.Experimental results show that our proposed method is better than the approach in Cloudsim under various performance metrics.展开更多
Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time o...Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.展开更多
In order to improve the energy efficiency of large-scale data centers, a virtual machine(VM) deployment algorithm called three-threshold energy saving algorithm(TESA), which is based on the linear relation between the...In order to improve the energy efficiency of large-scale data centers, a virtual machine(VM) deployment algorithm called three-threshold energy saving algorithm(TESA), which is based on the linear relation between the energy consumption and(processor) resource utilization, is proposed. In TESA, according to load, hosts in data centers are divided into four classes, that is,host with light load, host with proper load, host with middle load and host with heavy load. By defining TESA, VMs on lightly loaded host or VMs on heavily loaded host are migrated to another host with proper load; VMs on properly loaded host or VMs on middling loaded host are kept constant. Then, based on the TESA, five kinds of VM selection policies(minimization of migrations policy based on TESA(MIMT), maximization of migrations policy based on TESA(MAMT), highest potential growth policy based on TESA(HPGT), lowest potential growth policy based on TESA(LPGT) and random choice policy based on TESA(RCT)) are presented, and MIMT is chosen as the representative policy through experimental comparison. Finally, five research directions are put forward on future energy management. The results of simulation indicate that, as compared with single threshold(ST) algorithm and minimization of migrations(MM) algorithm, MIMT significantly improves the energy efficiency in data centers.展开更多
The mobile hybrid machining robot has a very bright application prospect in the field of high-efficiency and high-precision machining of large aerospace structures.However,an inappropriate base placement may make the ...The mobile hybrid machining robot has a very bright application prospect in the field of high-efficiency and high-precision machining of large aerospace structures.However,an inappropriate base placement may make the robot encounter a singular configuration,or even fail to complete the entire machining task due to unreachability.In addition to considering the two constraints of reachability and non-singularity,this paper also optimizes the robot base placement with stiffness as the goal to improve the machining quality.First of all,starting from the structure of the robot,the reachability and nonsingularity constraints are transformed into a simple geometric constraint imposed on the base placement:feasible base placement area.Then,genetic algorithm is used to search for the base placement with near optimal stiffness(near optimal base placement for short)in the feasible base placement area.Finally,multiple controlled experiments were carried out by taking the milling of a protuberance on the spacecraft cabin as an example.It is found that the calculated optimal base placement meets all the constraints and that the machining quality was indeed improved.In addition,compared with simple genetic algorithm,it is proved that the feasible base placement area method can shorten the running time of the whole program.展开更多
This paper presents a Torque Sharing Function(TSF)control of Switched Reluctance Machines(SRMs)with different current sensor placements to reconstruct the phase currents.TSF requires precise phase current information ...This paper presents a Torque Sharing Function(TSF)control of Switched Reluctance Machines(SRMs)with different current sensor placements to reconstruct the phase currents.TSF requires precise phase current information to ensure accurate torque control.Two proposed methods with different chopping transistors or a new PWM implementation require four or two current sensors to replace the current sensors on each phase regardless of the phase number.For both approaches,the actual phase current can be easily extracted during the single phase conducting region.However,how to separate the incoming and outgoing phase current values during the commutation region is the difficult issue to deal with.In order to derive these two adjacent currents,the explanations and comparisons of two proposed methods are described.Their effectiveness is verified by experimental results on a four-phase 8/6 SRM.Finally,the approach with a new PWM implementation is selected,which requires only two current sensors for reducing the number of sensors.The control system can be more compact and cheaper.展开更多
Cloud computing promises the advent of a new era of service boosted by means of virtualization technology.The process of virtualization means creation of virtual infrastructure,devices,servers and computing resources ...Cloud computing promises the advent of a new era of service boosted by means of virtualization technology.The process of virtualization means creation of virtual infrastructure,devices,servers and computing resources needed to deploy an application smoothly.This extensively practiced technology involves selecting an efficient Virtual Machine(VM)to complete the task by transferring applications from Physical Machines(PM)to VM or from VM to VM.The whole process is very challenging not only in terms of computation but also in terms of energy and memory.This research paper presents an energy aware VM allocation and migration approach to meet the challenges faced by the growing number of cloud data centres.Machine Learning(ML)based Artificial Bee Colony(ABC)is used to rank the VM with respect to the load while considering the energy efficiency as a crucial parameter.The most efficient virtual machines are further selected and thus depending on the dynamics of the load and energy,applications are migrated fromoneVMto another.The simulation analysis is performed inMatlab and it shows that this research work results in more reduction in energy consumption as compared to existing studies.展开更多
Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource...Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource utilization.This paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical value.We use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)simultaneously.Experimental results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).展开更多
文摘For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.
基金supported by National Major Projects (No. 2015ZX03001013-002)National Natural Science Foundation of China (No. 61173149)+1 种基金Beijing Higher Education Young Elite Teacher ProjectFundamental Research Funds for the Central Universities
文摘The Virtual Machine(VM) placement is a serious problem to limit the improvement of resource utilization of data center. The VM traffic bandwidth demand is a Non zero-sum resource that the global traffic sum is relative with each VM placement position. In this paper, we introduce a new improved traffic constant algorithm in the data center, called Degree and Weighted Maximum Traffic Ratio(DWMTR). The proposal DWMTR algorithm defines a new weighted ratio parameter in this paper. The main body of the parameter is constructed with the ratio, current overall intra-cluster traffic divided by current overall inter-cluster traffic, when a new VM places in the data center. The DWMTR algorithm has the ability to constraint the inter-cluster traffic incensement more strictly than the current VM placement algorithms based on traffic bandwidth allocation. For this algorithm based on the theoretical analysis and simulation, it confirms the proposed DWMTR possesses smaller global interactive traffic cost than the control group algorithms in the appointed VM placement in the three-layer data center model.
基金funded by Researchers Supporting Project Number(RSPD2025R 947),King Saud University,Riyadh,Saudi Arabia.
文摘Cloud computing has emerged as a vital platform for processing resource-intensive workloads in smart manu-facturing environments,enabling scalable and flexible access to remote data centers over the internet.In these environments,Virtual Machines(VMs)are employed to manage workloads,with their optimal placement on Physical Machines(PMs)being crucial for maximizing resource utilization.However,achieving high resource utilization in cloud data centers remains a challenge due to multiple conflicting objectives,particularly in scenarios involving inter-VM communication dependencies,which are common in smart manufacturing applications.This manuscript presents an AI-driven approach utilizing a modified Multi-Objective Particle Swarm Optimization(MOPSO)algorithm,enhanced with improved mutation and crossover operators,to efficiently place VMs.This approach aims to minimize the impact on networking devices during inter-VM communication while enhancing resource utilization.The proposed algorithm is benchmarked against other multi-objective algorithms,such as Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),demonstrating its superiority in optimizing resource allocation in cloud-based environments for smart manufacturing.
文摘Cloud data centers face the largest energy consumption.In order to save energy consumption in cloud data centers,cloud service providers adopt a virtual machine migration strategy.In this paper,we propose an efficient virtual machine placement strategy(VMP-SI)based on virtual machine selection and integration.Our proposed VMP-SI strategy divides the migration process into three phases:physical host state detection,virtual machine selection and virtual machine placement.The local regression robust(LRR)algorithm and minimum migration time(MMT)policy are individual used in the first and section phase,respectively.Then we design a virtual machine migration strategy that integrates the process of virtual machine selection and placement,which can ensure a satisfactory utilization efficiency of the hardware resources of the active physical host.Experimental results show that our proposed method is better than the approach in Cloudsim under various performance metrics.
基金supported by the National Natural Science Foundation of China(6120235461272422)the Scientific and Technological Support Project(Industry)of Jiangsu Province(BE2011189)
文摘Cloud computing represents a novel computing model in the contemporary technology world. In a cloud system, the com- puting power of virtual machines （VMs） and network status can greatly affect the completion time of data intensive tasks. How- ever, most of the current resource allocation policies focus only on network conditions and physical hosts. And the computing power of VMs is largely ignored. This paper proposes a comprehensive resource allocation policy which consists of a data intensive task scheduling algorithm that takes account of computing power of VMs and a VM allocation policy that considers bandwidth between storage nodes and hosts. The VM allocation policy includes VM placement and VM migration algorithms. Related simulations show that the proposed algorithms can greatly reduce the task comple- tion time and keep good load balance of physical hosts at the same time.
基金Project(61272148) supported by the National Natural Science Foundation of ChinaProject(20120162110061) supported by the Doctoral Programs of Ministry of Education of China+1 种基金Project(CX2014B066) supported by the Hunan Provincial Innovation Foundation for Postgraduate,ChinaProject(2014zzts044) supported by the Fundamental Research Funds for the Central Universities,China
文摘In order to improve the energy efficiency of large-scale data centers, a virtual machine(VM) deployment algorithm called three-threshold energy saving algorithm(TESA), which is based on the linear relation between the energy consumption and(processor) resource utilization, is proposed. In TESA, according to load, hosts in data centers are divided into four classes, that is,host with light load, host with proper load, host with middle load and host with heavy load. By defining TESA, VMs on lightly loaded host or VMs on heavily loaded host are migrated to another host with proper load; VMs on properly loaded host or VMs on middling loaded host are kept constant. Then, based on the TESA, five kinds of VM selection policies(minimization of migrations policy based on TESA(MIMT), maximization of migrations policy based on TESA(MAMT), highest potential growth policy based on TESA(HPGT), lowest potential growth policy based on TESA(LPGT) and random choice policy based on TESA(RCT)) are presented, and MIMT is chosen as the representative policy through experimental comparison. Finally, five research directions are put forward on future energy management. The results of simulation indicate that, as compared with single threshold(ST) algorithm and minimization of migrations(MM) algorithm, MIMT significantly improves the energy efficiency in data centers.
基金supported by National Natural Science Foundation of China(Nos.91948301,52175025 and 51721003).
文摘The mobile hybrid machining robot has a very bright application prospect in the field of high-efficiency and high-precision machining of large aerospace structures.However,an inappropriate base placement may make the robot encounter a singular configuration,or even fail to complete the entire machining task due to unreachability.In addition to considering the two constraints of reachability and non-singularity,this paper also optimizes the robot base placement with stiffness as the goal to improve the machining quality.First of all,starting from the structure of the robot,the reachability and nonsingularity constraints are transformed into a simple geometric constraint imposed on the base placement:feasible base placement area.Then,genetic algorithm is used to search for the base placement with near optimal stiffness(near optimal base placement for short)in the feasible base placement area.Finally,multiple controlled experiments were carried out by taking the milling of a protuberance on the spacecraft cabin as an example.It is found that the calculated optimal base placement meets all the constraints and that the machining quality was indeed improved.In addition,compared with simple genetic algorithm,it is proved that the feasible base placement area method can shorten the running time of the whole program.
基金The test bench was supported by The Future Planning(NRF-2016H1D5A1910536)“Human Resources Program in Energy Technology”of the Korea Institute of Energy Technology Evaluation and Planning(KETEP),granted financial resource from the Ministry of Trade,Industry&Energy,Republic of Korea.(No.20164010200940)The authors would like to thank FONDS DAVID ET ALICE VAN BUUREN and FONDATION JAUMOTTE-DEMOULIN for the funding“Prix Van Buuren-Jaumotte-Demoulin”.
文摘This paper presents a Torque Sharing Function(TSF)control of Switched Reluctance Machines(SRMs)with different current sensor placements to reconstruct the phase currents.TSF requires precise phase current information to ensure accurate torque control.Two proposed methods with different chopping transistors or a new PWM implementation require four or two current sensors to replace the current sensors on each phase regardless of the phase number.For both approaches,the actual phase current can be easily extracted during the single phase conducting region.However,how to separate the incoming and outgoing phase current values during the commutation region is the difficult issue to deal with.In order to derive these two adjacent currents,the explanations and comparisons of two proposed methods are described.Their effectiveness is verified by experimental results on a four-phase 8/6 SRM.Finally,the approach with a new PWM implementation is selected,which requires only two current sensors for reducing the number of sensors.The control system can be more compact and cheaper.
文摘Cloud computing promises the advent of a new era of service boosted by means of virtualization technology.The process of virtualization means creation of virtual infrastructure,devices,servers and computing resources needed to deploy an application smoothly.This extensively practiced technology involves selecting an efficient Virtual Machine(VM)to complete the task by transferring applications from Physical Machines(PM)to VM or from VM to VM.The whole process is very challenging not only in terms of computation but also in terms of energy and memory.This research paper presents an energy aware VM allocation and migration approach to meet the challenges faced by the growing number of cloud data centres.Machine Learning(ML)based Artificial Bee Colony(ABC)is used to rank the VM with respect to the load while considering the energy efficiency as a crucial parameter.The most efficient virtual machines are further selected and thus depending on the dynamics of the load and energy,applications are migrated fromoneVMto another.The simulation analysis is performed inMatlab and it shows that this research work results in more reduction in energy consumption as compared to existing studies.
基金funded by Science and Technology Department of Shaanxi Province,Grant Numbers:2019GY-020 and 2024JC-YBQN-0730.
文摘Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource utilization.This paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical value.We use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)simultaneously.Experimental results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).
