• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1100-1122
• /
• 2023

Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

• 한국전산구조공학회논문집
• /
• 제23권5호
• /
• pp.475-482
• /
• 2010

본 논문에서는 대규모 자유도 시스템의 병렬처리를 위하여 2단계로 이루어진 영역분할법(Domain Decomposition Method) 기반의 병렬 알고리즘을 제안하였다. 분할된 영역의 내부 및 외부 경계를 상위영역문제로 정의하고 국부영역문제는 변위 경계조건이 모두 주어지는 분할영역에서의 Dirichlet 문제로 구성한다. 상위영역에서는 전체 상위영역에 대한 강성 행렬의 어셈블이 필요없는 반복법을 통하여 변위를 구하고, 이를 바탕으로 국부영역에서 Multi-Frontal Sparse Solver (MFSS)를 이용하여 변위를 계산한다. 상위영역문제의 연산에서 프로세서 간의 데이터 교환을 최소화하여 계산효율을 유지하며, 동시에 해석 가능한 자유도를 증대시키는 병렬 PCG(Preconditioned Conjugate Gradient)법 기반의 알고리즘을 개발하였다. 제안된 알고리즘을 적용하여 수치해석을 수행한 결과, 프로세서 수가 증가할수록 계산성능의 손실없이 해석 가능한 자유도가 비례하여 증가하는 선형 확장성을 관찰할 수 있었으며, 대규모 자유도 문제에 효과적으로 사용 가능함을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.372-376
• /
• 1989

One of the major difficulties with modular approach model of separation process simulation is initial guess problem. Only accurate initial guess make the problem converge and large computer memory and calculating time are required. In this study, we use the initial bottom guess value same as given feed condition and update the value the .theta.method. So we examine;(1)the problem converges using initial guess with large range, (2)computer memory and calculating time are reduced considerably.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권1호
• /
• pp.47-61
• /
• 2003

Two principally different statements of the problem of stable numerical differentiation are considered. It is analyzed when it is possible in principle to get a stable approximation to the derivative ${\Large f}'$ given noisy data ${\Large f}_{\delta}$. Computational aspects of the problem are discussed and illustrated by examples. These examples show the practical value of the new understanding of the problem of stable differentiation.

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

• 한국초등수학교육학회지
• /
• 제13권2호
• /
• pp.231-245
• /
• 2009

최근 학생주도적인 활동을 유도하기 위하여 수행평가를 도입 적용하는 학교가 늘고 있다. 그러나 교실의 수행평가에도 불구하고 학생들의 수학적 능력은 표준화 시험지에 의하여 결정되고, 또 교육부는 학생들의 연합고사 점수로서 교육 프로그램의 질을 판단하고 그 개선효과를 기대하는 것 같다. 한편 표준화 검사는 학생 시험불안을 유발하고 자칫 그들의 대안적 방어행동을 유발할 수 있다. 본고는 초등학교의 표준화 시험의 문제점과 초등학생들의 시험불안을 완화할 수 있는 시험문제의 구성 및 채점 방안에 대하여 구안하고자 한다.

• Structural Engineering and Mechanics
• /
• 제44권3호
• /
• pp.405-416
• /
• 2012

In this study the investigation of large deflections subject in compliant mechanisms is presented using homotopy perturbation method (HPM). The main purpose is to propose a convenient method of solution for the large deflection problem in compliant mechanisms in order to overcome the difficulty and complexity of conventional methods, as well as for the purpose of mathematical modeling and optimization. For simplicity, a cantilever beam of linear elastic material under horizontal, vertical and bending moment end point load is considered. The results show that the applied method is very accurate and capable for cantilever beams and can be used for a large category of practical problems for the aim of optimization. Also the consequence of effective parameters on the large deflection is analyzed and presented.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• 대한산업공학회지
• /
• 제40권3호
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• Tribology and Lubricants
• /
• 제15권2호
• /
• pp.131-140
• /
• 1999

This study dealt with some problems occurred in spectrometric oil analysis that has been popularly used for a machine condition monitoring in various fields of industry. One of the problems is that spectrometric technique could not analyze contaminants of large particle (larger than 10 $\mu\textrm{m}$) in lubricating oils. This limitation caused a serious problem in analyzing lubricated machine conditions since wear debris of large size represents better critical machine conditions. In this work, this problem was found to be solved by using a filtration method prior to spectrometric analysis. Another problem could be that spectrometric analysis is incapable of identifying contaminants. This nay mislead the result seriously in practice. This problem was surveyed by analyzing both various types of industrial lubricants and laboratory simulation tests, and the solutions to the problem were suggested in this work.