• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.706-708
• /
• 1998

WWW에서 의뢰인- 병렬처리 서버- 작업자 구성을 이용하여, 작업자 애플릿을 임의의 호스트에 분산시키고, 대량의 연산수행을 지닌 작업을 배분하여 수행시킨 뒤, 그 결과를 의뢰인에게 보여주는 WWW 기반 자바병렬 시스템이 기존의 LAN상에서의 병렬 시스템보다 확장성 및 이용 용이성 면에서 크게 주목을 끌고 있다. 이러한 WWW 기반 자바 병렬 처리 시스템에서 서버가 주어진 태스크들을 작업자들에게 할당하는 효율적인 기법이 크게 요구된다. 본 논문에서는, 이미 구현된 WWW 기반 자바 병렬 시스템 원형(prototype)에서 효율적인 적응적 태스크 할당 기법을 제시한다. 제안하는 적응적 태스크 할당 기법이 WWW에서 여러 호스트들의 성능이 시간의 흐름에 따라 크게 변화하는 상황에 크게 이점이 있음을 성능 분석 및 평가를 통해 보여준다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.203-206
• /
• 2005

This paper presents a design experience of supervisory control system for agile and intelligent manufacturing(AIM). For effectively program job instructions, a Petri net-type graphical language is proposed and it can be applied to a various task such as concurrency and synchronization. PGL is consisted of PGL editor, PGL analyzer and PGL translator; PGL editor generates a job instruction program using graphic symbol. PGL analyzer prevents a deadlock or resource allocation of unit cell. PGL translator transfers to adequate sequential job commands of each unit cell.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.15-27
• /
• 1998

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.81-94
• /
• 1999

Organization change projects such as Business Process Redesign(BPR) have been implemented by many firms for enhancing their organizational performance. However, management is reluctant to initiate these projects due to enterprise-wide impact and steeper project cost than the traditional system development projects. Thus, there emerges a need to accurately assess the value of the redesigned organizational process for the successful implementation of BPR projects. The purpose of this study is to assess the value of process redesign in the point of resource utilization and allocation, and cycle time and cost reduction. The candidate process and the design alternatives are identified from organizational requirements analysis. The variables and their relations are defined to perform task activity analysis, bottleneck analysis, cycle cost analysis, and resource utilization analysis. A Case study of a manufacturing company indicates that the assessments method proposed in this study is a promising approach to identify the business alternative process that lead to the highest organizational performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.82-84
• /
• 2001

워크플로우 시스템에서 중요한 기능은 정의된 규칙, 절차 및 조건에 의한 작업흐름을 자동화하는 것으로 정보처리의 이동성을 고려하여야 한다. 특히, 최근에는 웹 환경의 확대에 따라 분산시스템에 대한 관심이 높으며, 분산시스템에서의 워크플로우 프로세스는 다른 노드에서도 태스크 처리가 가능해야 하고 실시간 처리가 요구된다. 또한 분산시스템을 구성하는 노드에서의 결함 발생은 전체 작업처리 효율을 저하시키므로 결합이 허용되는 분산 시스템에 적합한 워크플로우 엔진이 필요하다. 본 논문은 워크플로우 시스템이 분산시스템 환경에서 수행될 때, 결함을 허용하며 작업을 자동으로 처리하여 전체 프로세스의 처리율을 향상시킬 수 있는 태스크 할당 알고리즘을 설계하고, 태스크의 수행 보증율을 통해 분석한다.

• Nuclear Engineering and Technology
• /
• v.19 no.4
• /
• pp.266-278
• /
• 1987

This paper addresses the issues in setting performance criteria for safety regulation of nuclear power plants. Since setting criteria at the low level is a much more difficult task than it is at the top level, the low-level performance criteria should be derived consistently from the more easily determinable top-level performance criteria. The paper also proposes several approaches to characterizing uncertainties in performance criteria, by extending the reliability allocation methodology that is based on the mean-to-mean mapping to a stochastic multi-objective optimization problem where the state variables are uncertain.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5694-5711
• /
• 2017

The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2003-2021
• /
• 2020

Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.6
• /
• pp.412-420
• /
• 2008

In order to design the large complex structures like VLFS (Very Large Floating Structures), it is essential the cooperation between the experts in various fields; structural engineering expert, fluid mechanics expert, mooring system engineer, and so on. This paper describes the development of an integrated system to support the cooperative design between various experts and project manager. This integrated system is designed to be operated in Web environment and it contains the support of design DB and 3D graphical tool, negotiation tool for task allocation, and various engineering supporting tools for each design step. The user group of this system can be classified as Project Manager, Engineering Expert, DB Builder, and System Administrator. All of the engineering data is saved after and during the process of the design projects and all participants can be connected by Internet without the limit of time or space constraints.