In view of the shortcomings of the whale optimization algorithm (WOA), such as slow convergence speed, low accuracy, and easy to fall into local optimum, an improved whale optimization algorithm (IWOA) is proposed. First, the standard WOA is improved from the three aspects of initial population, convergence factor, and mutation operation. At the same time, Gaussian mutation is introduced. Then the nonfixed penalty function method is used to transform the constrained problem into an unconstrained problem. Finally, 13 benchmark problems were used to test the feasibility and effectiveness of the proposed method. Numerical results show that the proposed IWOA has obvious advantages such as stronger global search ability, better stability, faster convergence speed, and higher convergence accuracy; it can be used to effectively solve complex constrained optimization problems.
Energy consumption has become one of the main bottlenecks that limit the performance improvement of heterogeneous multiprocessor systems. In a heterogeneous distributed shared‐memory multiprocessor system (HDSMS), each processor can access all the memories, and each data can be stored in different memories. This article aims at addressing the problem of task scheduling and data allocation (TSDA) on HDSMS. To minimize the total energy consumption under a time constraint for TSDA, we propose two algorithms: the extended tree assignment for task scheduling incorporating data allocation (ETATS‐DA) and critical path task scheduling and data allocation (CPTSDA). The ETATS‐DA algorithm first utilizes the extended tree assignment to search the near optimal solution for task assignment, and then allocates data to memory based on the result of assignment. The CPTSDA algorithm considers TSDA jointly on a critical path simultaneously. Our proposed algorithms perform coherent data allocation under the consideration of best task scheduling by running two different heuristic strategies, respectively, and taking the best result as the final result. We conduct a large number of simulation experiments to test the performance of our algorithms, and the results validate the higher performance of our methods compared with the state‐of‐the‐art algorithms.
In this paper, we mainly study an exponential spline function space, construct a basis with local supports, and present the relationship between the function value and the first and the second derivative at the nodes. Using these relations, we construct an exponential spline-based difference scheme for solving a class of boundary value problems of second-order ordinary differential equations (ODEs) and analyze the error and the convergence of this method. The results show that the algorithm is high accurate and conditionally convergent, and an accuracy of 1/240h6 was achieved with smooth functions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.