In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of po...
We address dynamic elasticity issues of VM provisioning in a heterogeneous distributed computing environment that integrates resources of a data center. We consider the scenario when the center includes dedicated reso...
详细信息
ISBN:
(纸本)9781538678800
We address dynamic elasticity issues of VM provisioning in a heterogeneous distributed computing environment that integrates resources of a data center. We consider the scenario when the center includes dedicated resources (private cloud) for providing virtualized service and non-dedicated resources for Grid-computing. Existing platforms for the resource virtualization does not support management of such an infrastructure. We propose an approach to a job management based on the dynamic elasticity of virtual machines provisioning using resources of both types. We develop the multi¬agent job scheduler for dedicated resources and hypervisor shell to launch virtual machines through queues of resource management systems in non-dedicated resources. The scheduler provides a dynamic elasticity of virtual machine provisioning. Advantages of the offered approach to the resource virtualization are demonstrated by an example of a job flow management for a scalable application to solve the complicated practical problem. It is related to the energy security of Vietnam. Provided experiments show that using the developed tools together with the platform for the resource virtualization enables agents to significantly speed up the problem-solving process.
In this study, a new parallel algorithm for solving Boolean satisfiability problem (SAT) is suggested. This algorithm is based on the Conflict Driven Clause Learning (CDCL) algorithm. Given an original SAT instance, C...
详细信息
In this study, a new parallel algorithm for solving Boolean satisfiability problem (SAT) is suggested. This algorithm is based on the Conflict Driven Clause Learning (CDCL) algorithm. Given an original SAT instance, CDCL is launched on it. Some types of conflict clauses, which are produced by CDCL, are collected. Then the collected clauses are employed to construct a family of different SAT instances. In particular, each SAT instance from a family is produced by adding some subset of the collected conflict clauses to an initial set of clauses (which belong to the original instance). In order to solve the original SAT instance, it is sufficient to solve at least one SAT instance from the constructed family. The proposed algorithm was implemented in the form of a parallel SAT solver. It was compared with two high ranked state-of-the-art parallel solvers. As a test set, we used SAT instances which encode cryptanalysis of three keystream generators: summation generator, threshold generator, and Gifford generator. According to computational experiments, our solver outperforms those two solvers.
The exact solutions of the nonlinear heat (porous medium) equation are constructed. We obtain a new class of the heat wave type solutions the construction of which is reduced to the Cauchy problems for nonlinear secon...
详细信息
The exact solutions of the nonlinear heat (porous medium) equation are constructed. We obtain a new class of the heat wave type solutions the construction of which is reduced to the Cauchy problems for nonlinear second order differential equations with a singularity. For these problems we prove a new existence and uniqueness theorem in the class of analytic functions. A special case of the heat wave front is considered in details. The results of numerical experiments are presented and discussed.
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not inte...
详细信息
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not interact with the traditional resource management systems such as the PBS Torque or SLURM that are used in cluster resources. To this end, we developed an additional hypervisor shell to run virtual machines through queues of the aforementioned systems. Thus, we expand the OpenStack capabilities for an application job management and provide a computation scalability for virtualized resources of clusters. In order to show the benefits of our approach to the scalable application management in integrated cluster environments, we developed a parameter sweep application for simulation modeling of warehouse logistics and solved three optimization tasks for the real refrigerated warehouse. We compared the selected criteria of task solving processes with the hypervisor shell applying and without it by means of simulation modeling. Experiments show that the hypervisor shell can significantly improve computation speedup and task solving time through reallocating virtual machines to queues of the resource management systems.
The paper develops an algorithm for solving the two-dimensional nonlinear degenerate parabolic heat conduction equation with a source depending on required function, with a specified law of heat wave front motion. The...
The paper develops an algorithm for solving the two-dimensional nonlinear degenerate parabolic heat conduction equation with a source depending on required function, with a specified law of heat wave front motion. The algorithm based on the boundary element method is implemented in the form of a program. To verify it, we use exact solutions the construction of which is reducible to solving a Cauchy problem for ordinary differential equations with a singularity before the highest derivative. The solutions to the Cauchy problem are constructed in the form of power series with recurrently computed coefficients (with a proof of the statement providing its convergence) and by the boundary element method.
In the framework of the quasipotential method in quantum electrodynamics we calculate corrections to the nuclear structure proportional to r2Nfrom two-photon exchange amplitudes in the fine and hyperfine structure of ...
详细信息
In this study, a GPU-enabled implementation of an algorithm for the solution of a real-life optimization problem arising in the geoacoustic inversion is proposed. In the inversion algorithm, a single-hydrophone record...
详细信息
The article is devoted to optimal covering and packing prob- lems for a bounded set in a two-dimensional metric space with a given amount of congruous circles. Such problems are of both theoretical interest and practi...
详细信息
The article is devoted to optimal covering and packing prob- lems for a bounded set in a two-dimensional metric space with a given amount of congruous circles. Such problems are of both theoretical interest and practical relevance. For instance, such statements appear in logistics when one needs to locate a given number of commercial or social facilities. A numerical algorithm based on fundamental physical principles due to Fermat and Huygens is suggested and implemented. It allows us to solve the problems for the cases of non-convex sets and non-Euclidean metrics. The results of numerical experiments are presented and discussed. Calculations show the applicability of the proposed approach its high efficiency for covering of a convex set in the Euclidean space by a sufficiently large amount of circles.
The paper addresses the nonconvex nonsmooth optimization problem with the cost function and equality and inequality constraints given by d.c. functions. The original problem is reduced to a problem without constraints...
The paper addresses the nonconvex nonsmooth optimization problem with the cost function and equality and inequality constraints given by d.c. functions. The original problem is reduced to a problem without constraints with the help of the exact penalization theory. After that, the penalized problem is represented as a d.c. minimization problem without constraints, for which the new mathematical tools under the form of global optimality conditions (GOCs) are developed. The GOCs reduce the nonconvex problem in question to a family of convex (linearized with respect to the basic nonconvexities) problems. On the base of the proposed theory we develop numerical methods of local and global search for the problem in question.
暂无评论