• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.2914-2935
• /
• 2016

With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

• 산업공학
• /
• 제12권3호
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• 가족자원경영과 정책
• /
• 제9권1호
• /
• pp.59-73
• /
• 2005

The purpose of this study was to understand which factors affect on the leisure constraint and leisure attitude of workers, to observe how the factors of leisure constraints affect on the leisure attitude. The subjects of this study were 267 urban workers who are older than 20 years old and resident in Seoul. The periods of this study was from November 15 to December 5. The modified versions of leisure constraint scale and leisure attitude scale were utilized for this study. The results of this study are as follows : First, as a result to compare the average of leisure constraint factors, intrapersonal constraint, which are individual mental status as interest, self-consciousness, uneasiness et at., was founded generally less than interpersonal constraints as personal relationship for leisure activity, or structural constraints as financial, time, information et at., Secondly, it was found that interpersonal constraint was statistically different in age, and that structural constraint was statistically different in sex, education, health status, marital status, income, and career. Thirdly, there were statistically different in cognitive leisure attitude, feeling leisure attitude, and behavioral leisure attitude according to the average monthly income and career. But, it was found that marital status and the five-day workweek system were not statistically different in 3 leisure attitude factors. Finally, 3 leisure constraint factors(intrapersonal, interpersonal, structural) had statistically significant effect on cognitive leisure attitude. Also, intrapersonal leisure constraint and interpersonal leisure constraint had statistically significant effect on feeling leisure attitude and behavioral leisure attitude

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.608-615
• /
• 2022

Construction projects are large-scale projects that require extensive construction costs and resources. Especially, scheduling is considered as one of the essential issues for project success. However, the schedule and resource management are challenging to conduct in high-tech construction projects including complex design of MEP and architectural finishing which has to be constructed within a limited workspace and duration. In order to deal with such a problem, this study suggests resource and sequence optimization using constraint programming in construction projects. The optimization model consists of two modules. The first module is the data structure of the schedule model, which consists of parameters for optimization such as labor, task, workspace, and the work interference rate. The second module is the optimization module, which is for optimizing resources and sequences based on Constraint Programming (CP) methodology. For model validation, actual data of plumbing works were collected from a construction project using a five-minute rate (FMR) method. By comparing actual data and optimized results, this study shows the possibility of reducing the duration of plumbing works in construction projects. This study shows decreased overall project duration by eliminating work interference by optimizing resources and sequences within limited workspaces.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권8호
• /
• pp.484-489
• /
• 2004

When the energy resource available to a particular plant (be it coal, oil, gas, water, or nuclear fuel) is a limiting factor in the operation of the plant, the entire economic dispatch calculation must be done differently. Each economic dispatch calculation must account for what happened before and what will happen in the future. This paper presents a formulation and a solution method for the optimization problem with a fuel constraint in a competitive electricity market. Take-or- Pay (TOP) contract for an energy resource is the typical constraint as a limiting factor. Two approaches are proposed in this paper for modeling the dispatch calculation in a market mechanism. The approaches differ in the subject who considers and inserts the fuel-constraint into its optimization problem. Market operator and each power producer having a TOP contract are assumed as such subjects. The two approaches are compared from the viewpoint of profits. surplus. and social welfare on the basis of Nash Equilibrium.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.802-807
• /
• 2005

For linear projects, it has long been known that resource utilization is important in improving work efficiency. However, most existing scheduling techniques cannot satisfy the need for solving such issues. This paper presents an optimization model for solving linear scheduling problems involving resource assignment tasks. The proposed model adopts constraint programming (CP) as the searching algorithm for model formulation, and the proposed model is designed to optimize project total cost. Additionally, the concept of outsourcing resources is introduced here to improve project performance.

• KNOM Review
• /
• 제22권3호
• /
• pp.25-30
• /
• 2019

기상 응용의 경우 시간적, 자원적 한계 내에서도 의미 있는 결과를 도출해 제공해야 한다. 수많은 과거 데이터를 통한 예보는 시간적인 소요가 크며, 국지성 태풍 예보와 같은 재난 안전 관련 분석/예측의 경우에는 여전히 자원적 한계가 존재한다. 태풍 예보, 도로별 침수/홍수 지역 예측 서비스 등 시간 제약하에 결과를 도출해야 하는 경우와 제한적인 물리적 환경 조건으로 인해 발생하는 문제 없이 적합한 예보를 제공해야 한다. 본 논문에서는 시간적, 자원적 조건에서도 원활한 예보 서비스 제공을 위해 기상 및 기후 예측 응용을 분석한다. 격자 크게 따른 수행 시간 분석을 통해 격자 조절을 통해 시간적 제약 조건이 있는 경우에 대처할 수있음을 확인하였다. 또한 메모리 자원 조절을 통해 수행 시간을 분석하여 성능에 영향을 미치지 않는 최소 자원 조건을 확인하였으며 swap, mlock 분석을 통해 응용의 자원 사용 패턴을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2873-2892
• /
• 2019

Reducing the interference to the licensed mobile users and obtaining the energy efficiency are key issues in cognitive heterogeneous networks. A corresponding rate loss constraint is proposed to be used for the sensing-based spectrum sharing (SBSS) model in cognitive heterogeneous networks in this paper. Resource allocation optimization strategy is designed for the maximum energy efficiency under the proposed interference constraint together with average transmission power constraint. An efficiency algorithm is studied to maximize energy efficiency due to the nonconvex optimal problem. Furthermore, the relationship between the proposed protection criterion and the conventional interference constraint strategy under imperfect sensing condition for the SBSS model is also investigated, and we found that the conventional interference threshold can be regarded as the upper bound of the maximum rate loss that the primary user could tolerate. Simulation results have shown the effectiveness of the proposed protection criterion overcome the conventional interference power constraint.

• 디지털산업정보학회논문지
• /
• 제4권3호
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.