A Hybrid Parallel Strategy for Isogeometric Topology Optimization via CPU/GPU Heterogeneous Computing

This paper aims to solve large-scale and complex isogeometric topology optimization problems that consumesignificant computational resources. A novel isogeometric topology optimization method with a hybrid parallelstrategy of CPU/GPU is proposed, while the hybrid parallel strategies for stiffness matrix assembly, equationsolving, sensitivity analysis, and design variable update are discussed in detail. To ensure the high efficiency ofCPU/GPU computing, a workload balancing strategy is presented for optimally distributing the workload betweenCPU and GPU. To illustrate the advantages of the proposedmethod, three benchmark examples are tested to verifythe hybrid parallel strategy in this paper. The results show that the efficiency of the hybrid method is faster thanserial CPU and parallel GPU, while the speedups can be up to two orders of magnitude.

Multi-Objective Optimization of Multi-Product Parallel Disassembly Line Balancing Problem Considering Multi-Skilled Workers Using a Discrete Chemical Reaction Optimization Algorithm

This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.

Optimization Techniques for GPU-Based Parallel Programming Models in High-Performance Computing

This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology.

Scheduling an Energy-Aware Parallel Machine System with Deteriorating and Learning Effects Considering Multiple Optimization Objectives and Stochastic Processing Time

Currently,energy conservation draws wide attention in industrial manufacturing systems.In recent years,many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as an effective approach.This paper puts forwards a multi-objective stochastic parallel machine scheduling problem with the consideration of deteriorating and learning effects.In it,the real processing time of jobs is calculated by using their processing speed and normal processing time.To describe this problem in a mathematical way,amultiobjective stochastic programming model aiming at realizing makespan and energy consumption minimization is formulated.Furthermore,we develop a multi-objective multi-verse optimization combined with a stochastic simulation method to deal with it.In this approach,the multi-verse optimization is adopted to find favorable solutions from the huge solution domain,while the stochastic simulation method is employed to assess them.By conducting comparison experiments on test problems,it can be verified that the developed approach has better performance in coping with the considered problem,compared to two classic multi-objective evolutionary algorithms.

IOPS:computational graph optimization based on inter-operators parallel scheduling

To improve the inference efficiency of convolutional neural networks(CNN),the existing neural networks mainly adopt heuristic and dynamic programming algorithms to realize parallel scheduling among operators.Heuristic scheduling algorithms can generate local optima easily,while the dynamic programming algorithm has a long convergence time for complex structural models.This paper mainly studies the parallel scheduling between operators and proposes an inter-operator parallelism schedule(IOPS)scheduling algorithm that guarantees the minimum similar execution delay.Firstly,a graph partitioning algorithm based on the largest block is designed to split the neural network model into multiple subgraphs.Then,the operators that meet the conditions is replaced according to the defined operator replacement rules.Finally,the optimal scheduling method based on backtracking is used to schedule the computational graph.Network models such as Inception-v3,ResNet-50,and RandWire are selected for testing.The experimental results show that the algorithm designed in this paper can achieve a 1.6×speedup compared with the existing sequential execution methods.

Modeling and Control of Parallel Hybrid Electric Vehicle Using Sea-Lion Optimization

This paper develops a parallel hybrid electric vehicle(PHEV)propor-tional integral controller with driving cycle.To improve fuel efficiency and reduce hazardous emissions in hybrid electric vehicles(HEVs)combine an electric motor(EM),a battery and an internal combustion engine(ICE).The electric motor assists the engine when accelerating,driving longer highways or climbing hills.This enables the use of a smaller,more efficient engine.It also makes use of the concept of regenerative braking to maximize energy efficiency.In a Hybrid Electric Vehicle(HEV),energy dissipated while braking is utilized to charge the battery.The proportional integral controller was used in this paper to analyze engine,motor performance and the New European Driving Cycle(NEDC)was used in the vehicle driving test using Matlab/Simulink.The proportional integral controllers were designed to track the desired vehicle speed and manage the vehi-cle’s energyflow.The Sea Lion Optimization(SLnO)methods were created to reduce fuel consumption in a parallel hybrid electric vehicle and the results were obtained for the New European Driving Cycle.

Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

Multi-objective Optimization of a Parallel Ankle Rehabilitation Robot Using Modified Differential Evolution Algorithm

Dimensional synthesis is one of the most difficult issues in the field of parallel robots with actuation redundancy. To deal with the optimal design of a redundantly actuated parallel robot used for ankle rehabilitation, a methodology of dimensional synthesis based on multi-objective optimization is presented. First, the dimensional synthesis of the redundant parallel robot is formulated as a nonlinear constrained multi-objective optimization problem. Then four objective functions, separately reflecting occupied space, input/output transmission and torque performances, and multi-criteria constraints, such as dimension, interference and kinematics, are defined. In consideration of the passive exercise of plantar/dorsiflexion requiring large output moment, a torque index is proposed. To cope with the actuation redundancy of the parallel robot, a new output transmission index is defined as well. The multi-objective optimization problem is solved by using a modified Differential Evolution（DE） algorithm, which is characterized by new selection and mutation strategies. Meanwhile, a special penalty method is presented to tackle the multi-criteria constraints. Finally, numerical experiments for different optimization algorithms are implemented. The computation results show that the proposed indices of output transmission and torque, and constraint handling are effective for the redundant parallel robot; the modified DE algorithm is superior to the other tested algorithms, in terms of the ability of global search and the number of non-dominated solutions. The proposed methodology of multi-objective optimization can be also applied to the dimensional synthesis of other redundantly actuated parallel robots only with rotational movements.

Dynamic Manipulability and Optimization of a Two DOF Parallel Mechanism

The dynamic dexterity is an important issue for manipulator design, some indices were proposed for analyzing dynamic dexterity, but they can evaluate the dynamic performance just at one pose in the workspaee of the manipulator, and can＇t be applied to dynamic design expediently. Much work has been done in the kinematic optimization, but the work in the dynamic optimization is much less. A global dynamic condition number index is proposed and applied to the dynamic optimization design the parallel manipulator. This paper deals with the dynamic manipulability and dynamic optimization of a two degree-of-freedom （DOF） parallel manipulator. The particular velocity and particular angular velocity matrices of each moving part about the part＇s pivot point are derived fi＇om the kinematic formulation of the manipulator, and the inertial force and inertial movement are obtained utilizing Newton-Euler formulation, then the inverse dynamic model of the parallel manipulator is proposed based on the virtual work principle. The general inertial ellipsoid and dynamic manipulability ellipsoid are applied to evaluate the dynamic performance of the manipulator, a global dynamic condition number index based on the condition number of general inertial matrix in the workspace is proposed, and then the link lengths of the manipulator is redesigned to optimize the dynamic manipulability by this index. The dynamic manipulability of the origin mechanism and the optimized mechanism are compared, the result shows that the optimized one is much better. The global dynamic condition number index has good effect in evaluating the dynamic dexterity of the whole workspace, and is efficient in the dynamic optimal design of the parallel manipulator.

PARALLEL IMPLEMENTATION AND OPTIMIZATION OF THE SEBVHOS ALGORITHM

In this paper, a parallel Surface Extraction from Binary Volumes with Higher-Order Smoothness (SEBVHOS) algorithm is proposed to accelerate the SEBVHOS execution. The original SEBVHOS algorithm is parallelized first, and then several performance optimization techniques which are loop optimization, cache optimization, false sharing optimization, synchronization overhead op-timization, and thread affinity optimization, are used to improve the implementation's performance on multi-core systems. The performance of the parallel SEBVHOS algorithm is analyzed on a dual-core system. The experimental results show that the parallel SEBVHOS algorithm achieves an average of 1.86x speedup. More importantly, our method does not come with additional aliasing artifacts, com-paring to the original SEBVHOS algorithm.

Impacts of optimization strategies on performance,power/energy consumption of a GPU based parallel reduction

In the era of modern high performance computing, GPUs have been considered an excellent accelerator for general purpose data-intensive parallel applications. To achieve application speedup from GPUs, many of performance-oriented optimization techniques have been proposed. However, in order to satisfy the recent trend of power and energy consumptions, power/energy-aware optimization of GPUs needs to be investigated with detailed analysis in addition to the performance-oriented optimization. In this work, in order to explore the impact of various optimization strategies on GPU performance, power and energy consumptions, we evaluate performance and power/energy consumption of a well-known application running on different commercial GPU devices with the different optimization strategies. In particular, in order to see the more generalized performance and power consumption patterns of GPU based accelerations, our evaluations are performed with three different Nvdia GPU generations(Fermi, Kepler and Maxwell architectures), various core clock frequencies and memory clock frequencies. We analyze how a GPU kernel execution is affected by optimization and what GPU architectural factors have much impact on its performance and power/energy consumption. This paper also categorizes which optimization technique primarily improves which metric(i.e., performance, power or energy efficiency). Furthermore, voltage frequency scaling(VFS) is also applied to examine the effect of changing a clock frequency on these metrics. In general, our work shows that effective GPU optimization strategies can improve the application performance significantly without increasing power and energy consumption.

Optimization of Planar Five-bar Parallel Mechanism via Self-reconfiguration Method

The parallel mechanisms have the disadvantage of small workspace and complication in kinematics and dynamics. An optimizing design for the parallel mechanisms can improve the motion performance relatively, but not guarantee the design results which satisfy the various practical requirements simultaneously. In this paper, a dynamical and optimal synthesis method is proposed for parallel mechanisms based on the dynamical reconfiguration technique. As a specific, application, the problem of optimizing the kinematics isotropy of a five-bar planar parallel mechanism is studied. The motion of a reconfigurable mechanism can be parted into two phases, the natural motion phase and the reconfiguration phase. The two motion phases can be studied by the same performance evaluation methodology. This points out from both theory and practices a novel method for improving the motion performance of the parallel mechanisms. Simulation by a symmetrical five-bar planar parallel manipulator shows some aspects of the investigations.

Parameters matching and optimization of parallel hybrid electric vehicle powertrain

Aiming at the development of parallel hybrid electric vehicle （PHEV） powertrain, parameter matching and optimization are presented, According to the performance of PHEV, the optimization range of engine, motor, driveline gear ratio and battery parameters are determined. And then a two-level optimization problem is formulated based on analytical target cascading （ATC）. At the system level, the optimization of the whole vehicle fuel economy is carried out, while the tractive performance is defined as the constraints. The optimized parameters are cascaded to the subsystem as the optimization targets. At the subsystem level, the final drive and transmission design are optimized to make the ratios as close to the targets as possible. The optimization result shows that the fuel economy had improved significantly, while the tractive performance maintains the former level.

Chaotic migration-based pseudo parallel genetic algorithm and its application in inventory optimization

Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.

A Rayleigh Wave Globally Optimal Full Waveform Inversion Framework Based on GPU Parallel Computing

Conventional gradient-based full waveform inversion (FWI) is a local optimization, which is highly dependent on the initial model and prone to trapping in local minima. Globally optimal FWI that can overcome this limitation is particularly attractive, but is currently limited by the huge amount of calculation. In this paper, we propose a globally optimal FWI framework based on GPU parallel computing, which greatly improves the efficiency, and is expected to make globally optimal FWI more widely used. In this framework, we simplify and recombine the model parameters, and optimize the model iteratively. Each iteration contains hundreds of individuals, each individual is independent of the other, and each individual contains forward modeling and cost function calculation. The framework is suitable for a variety of globally optimal algorithms, and we test the framework with particle swarm optimization algorithm for example. Both the synthetic and field examples achieve good results, indicating the effectiveness of the framework. .

Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem

As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.

Series-parallel Hybrid Vehicle Control Strategy Design and Optimization Using Real-valued Genetic Algorithm

Despite the series-parallel hybrid electric vehicle inherits the performance advantages from both series and parallel hybrid electric vehicle, few researches about the series-parallel hybrid electric vehicle have been revealed because of its complex co nstruction and control strategy. In this paper, a series-parallel hybrid electric bus as well as its control strategy is revealed, and a control parameter optimization approach using the real-valued genetic algorithm is proposed. The optimization objective is to minimize the fuel consumption while sustain the battery state of charge, a tangent penalty function of state of charge（SOC） is embodied in the objective function to recast this multi-objective nonlinear optimization problem as a single linear optimization problem. For this strategy, the vehicle operating mode is switched based on the vehicle speed, and an ＂optimal line＂ typed strategy is designed for the parallel control. The optimization parameters include the speed threshold for mode switching, the highest state of charge allowed, the lowest state of charge allowed and the scale factor of the engine optimal torque to the engine maximum torque at a rotational speed. They are optimized through numerical experiments based on real-value genes, arithmetic crossover and mutation operators. The hybrid bus has been evaluated at the Chinese Transit Bus City Driving Cycle via road test, in which a control area network-based monitor system was used to trace the driving schedule. The test result shows that this approach is feasible for the control parameter optimization. This approach can be applied to not only the novel construction presented in this paper, but also other types of hybrid electric vehicles.

Configuration and Kinematics of a 3-DOF Generalized Spherical Parallel Mechanism for Ankle Rehabilitation

The kinematic equivalent model of an existing ankle-rehabilitation robot is inconsistent with the anatomical structure of the human ankle,which influences the rehabilitation effect.Therefore,this study equates the human ankle to the UR model and proposes a novel three degrees of freedom(3-DOF)generalized spherical parallel mechanism for ankle rehabilitation.The parallel mechanism has two spherical centers corresponding to the rotation centers of tibiotalar and subtalar joints.Using screw theory,the mobility of the parallel mechanism,which meets the requirements of the human ankle,is analyzed.The inverse kinematics are presented,and singularities are identified based on the Jacobian matrix.The workspaces of the parallel mechanism are obtained through the search method and compared with the motion range of the human ankle,which shows that the parallel mechanism can meet the motion demand of ankle rehabilitation.Additionally,based on the motion-force transmissibility,the performance atlases are plotted in the parameter optimal design space,and the optimum parameter is obtained according to the demands of practical applications.The results show that the parallel mechanism can meet the motion requirements of ankle rehabilitation and has excellent kinematic performance in its rehabilitation range,which provides a theoretical basis for the prototype design and experimental verification.

Asynchronous Nested Optimization Algorithms and Their Parallel Implementation

Large scale optimization problems can only be solved in an efficient way, if their special structure is taken as the basis of algorithm design. In this paper we consider a very broad class of large-scale problems with special structure, namely tree structured problems. We show how the exploitation of the structure leads to efficient decomposition algorithms and how it may be implemented in a parallel environment.

Optimization for Hydroforming Loading Paths of Parallel Multi-branch Tubes Based on Grey System Theory

According to characteristic of hydroforming of parallel multi-branch tubes,multi-objective problems were transformed to single objective problem of relational grade comparison by grey system theory.Two different objectives were selected,according to the principle that process parameters were optimal which of grey relational grade were maximum,the optimal loading parameters under different objective condition were obtained,and loading paths were optimized.The results indicated that parallel multi-branch tubes hydroformed under loading paths optimized by grey system theory could meet with the requirement that objective was optimal.And the optimal loading paths under different objectives were different,and the appropriate objective should be selected according to forming characteristic.