CLPS-GA: A case library and Pareto solution-based hybrid genetic algorithm for energy-aware cloud service scheduling

Resource Mapping Allocation Scheme in 6G Satellite Twin Network

The sixth generation (6G) satellite twin network is an important solution to achieve seamless global coverage of 6G. The deterministic geometric topology and the randomness of the communication behaviors of 6G networks limit the realism and transparency of cross-platform and cross-object communication, twin, and computing co-simulation networks. Meanwhile, the parallel-based serverless architecture has a high redundancy of computational resource allocation. Therefore, for the first time, we present a new hypergraph hierarchical nested kriging model, which provides theoretical analysis and modeling of integrated relationships for communication, twin, and computing. We explore the hierarchical unified characterization method which joins heterogeneous topologies. A basis function matrix for local flexible connectivity of the global network is designed for the connection of huge heterogeneous systems to decouple the resource mapping among heterogeneous networks. To improve the efficiency of resource allocation in communication, twin, and computing integrated network, a multi-constraint multi-objective genetic algorithm (MMGA) based on the common requirements of operations, storage, interaction, and multi-layer optimal solution conflict is proposed for the first time. The effectiveness of the algorithm and architecture is verified through simulation and testing.

Modeling of Laser Melting Deposition Equipment Based on Digital Twin

With the rapid development of new-generation information technologies such as big data, cloud computing, Internet of Things, and mobile internet in traditional manufacturing, the development of intelligent manufacturing (IM) is accelerating. Digital twin is an important method to achieve the goal of IM, and provides an effective means for the integrated development of design and manufacturing (R & M). In view of the problems of long installation and debugging cycles, and process parameters requiring multiple trial and error in the research and development (R & D) process of laser melting deposition (LMD) equipment, this paper focuses on building an LMD equipment model based on digital twin technology. It involves performing virtual assembly, motion setting, collision inspection, and PLC debugging, thereby providing an innovative method and insights for improving the R & D efficiency of the IM of LMD equipment.

Optimized execution method for queries with materialized views: Design and implementation

A query application for On-Line Analytical Processing (OLAP) examines various kinds of data stored in a Data Warehouse (DW). There have been no systematic studies that look at the impact of query optimizations on performance and energy consumption in relational and NoSQL databases. Indeed, due to a lack of precise power calculation techniques in various databases and queries, the energy activity of several basic database operations is mostly unknown, as are the queries themselves, which are very complicated, extensive, and exploratory. As a result of the rapidly growing size of the DW system, query response times are regularly increasing. To improve decision-making performance, the response time of such queries should be as short as possible. To resolve these issues, multiple materialized views from individual database tables have been collected, and queries have been handled. Similarly, due to overall maintenance and storage expenses, as well as the selection of an optimal view set to increase the data storage facility’s efficacy, materializing all conceivable views is not viable. Thus, to overcome these issues, this paper proposed the method of energy-aware query optimization and processing, on materialized views using enhanced simulated annealing (EAQO-ESA). This work was carried out in four stages. First, a Simulated Annealing (SA) based meta-heuristic approach was used to pre-process the query and optimize the scheduling performance. Second, the optimal sets of views were materialized, resulting in enhanced query response efficiency. Third, the authors assessed the performance of the query execution time and computational complexity with and without optimization. Finally, based on processing time, efficiency, and computing cost, the system’s performance was validated and compared to the traditional technique.

An Enhanced Discrete Symbiotic Organism Search Algorithm for Optimal Task Scheduling in the Cloud

Recently, cloud computing has begun to experience tremendous growth because government agencies and private organisations are migrating to the cloud environment. Hence, having a task scheduling strategy that is efficient is paramount for effectively improving the prospects of cloud computing. Typically, a certain number of tasks are scheduled to use diverse resources (virtual machines) to minimise the makespan and achieve the optimum utilisation of the system by reducing the response time within the cloud environment. The task scheduling problem is NP-complete; as such, obtaining a precise solution is difficult, particularly for large-scale tasks. Therefore, in this paper, we propose a metaheuristic enhanced discrete symbiotic organism search (eDSOS) algorithm for optimal task scheduling in the cloud computing setting. Our proposed algorithm is an extension of the standard symbiotic organism search (SOS), a nature-inspired algorithm that has been implemented to solve various numerical optimisation problems. This algorithm imitates the symbiotic associations (mutualism, commensalism, and parasitism stages) displayed by organisms in an ecosystem. Despite the improvements made with the discrete symbiotic organism search (DSOS) algorithm, it still becomes trapped in local optima due to the large size of the values of the makespan and response time. The local search space of the DSOS is diversified by substituting the best value with any candidate in the population at the mutualism phase of the DSOS algorithm, which makes it worthy for use in task scheduling problems in the cloud. Thus, the eDSOS strategy converges faster when the search space is larger or more prominent due to diversification. The CloudSim simulator was used to conduct the experiment, and the simulation results show that the proposed eDSOS was able to produce a solution with a good quality when compared with that of the DSOS. Lastly, we analysed the proposed strategy by using a two-sample t-test, which revealed that the performance of eDSOS was of significance compared to the benchmark strategy (DSOS), particularly for large search spaces. The percentage improvements were 26.23% for the makespan and 63.34% for the response time.

A PSO Algorithm Based Task Scheduling in Cloud Computing

Cloud computing is an emerging technology which involves the allocation and de-allocation of the computing resources using the internet. Task scheduling (TS) is one of the fundamental issues in cloud computing and effort has been made to solve this problem. An efficient task scheduling mechanism is always needed for the allocation to the available processing machines in such a manner that no machine is over or under-utilized. Scheduling tasks belongs to the category of NP-hard problem. Through this article, the authors are proposing a particle swarm optimization (PSO) based task scheduling mechanism for the efficient scheduling of tasks among the virtual machines (VMs). The proposed algorithm is compared using the CloudSim simulator with the existing greedy and genetic algorithm-based task scheduling mechanism. The simulation results clearly show that the PSO-based task scheduling mechanism clearly outperforms the others as it results in almost 30% reduction in makespan and increases the resource utilization by 20%.