• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2003년도 춘계학술대회
• /
• pp.1-20
• /
• 2003

In this research, we developed a Multi-Agent based Negotiation Support System to be able to increase the competitive power of a company in dynamic environment and correspond to various orders of customers by diffusion of electronic commerce. The system uses the agent technology that is being embossed as new paradigm in dynamic environment and flexible system framework. The multi-agent technology is used to solve these problem through cooperation of agent. The system consists of six sub agents: mediator, manufacturability analysis agent, process planning agent, scheduling agent, selection agent, negotiation-strategy building agent. In this paper, the proposed Multi-Agent based Negotiation Support System takes aim at the automation of transaction process from ordering to manufacturing plan through the automation of negotiation that is the most important in order-taking transaction.

• 한국통신학회논문지
• /
• 제31권4A호
• /
• pp.393-401
• /
• 2006

배터리로 동작하는 휴대용 임베디드 시스템에서 에너지 소모는 중요한 설계 파라미터이며, 동적 전력 관리는 잘 알려진 저전력 설계 기법중의 하나이다. 본 논문에서는 실시간 시스템에서 에너지를 고려한 태스크 스케줄링 알고리듬을 제안한다. 제안한 스케줄링 알고리듬은 시스템에 여유 시간이 존재할 경우 장치 중첩도가 높은 태스크가 우선적으로 수행되도록 스케줄링 하여 장치의 전력 상태 전환 횟수를 줄여준다. 전력 상태 전환 횟수가 줄어들 경우 상태 전환에 따른 전력 소모가 감소하고, 동적 전력 관리의 기회를 더욱 얻을 수 있다. 실험 결과 EDF 알고리듬으로 동작 하는 시스템에서 동적 전력 관리를 한 경우와 비교하였을 때 에너지 소모가 약 23% 감소하였다.

• 한국정보통신학회논문지
• /
• 제13권4호
• /
• pp.720-726
• /
• 2009

대규모 데이터베이스 시스템에는 다양한 종류의 데이터들이 공존하고 있으며, 사용자에게 정확하고 유용한 정보를 제공하기 위해 데이터의 신선도를 유지하는 문제는 중요한 이슈로 등장하고 있다. 대부분의 이런 문제의 해결책은 적절한 시간내에 요청된 갱신질의어를 얼마나 효율적으로 수행하는가 하는 것이 관건이다. 본 논문에서는 데이터의 신선도 유지와 기아상태의 공정성을 유지하기 위한 갱신 스케줄링 알고리즘을 제안한다. 제안된 알고리즘은 요청된 갱신질의어 실행시간 할당을 위해 목표 갱신 비율을 일정한 스케줄링 주기마다 재 계산한다. 본 논문에서 제안된 알고리즘을 사용함에 따라 데이터들의 공정성과 신선도를 유지 할 수 있다. 동적, 반-동적, 정적 데이터의 갱신처리 결과를 보여주기 위해 통합 웹사이트를 구현하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.716-719
• /
• 1999

In this paper, a real-time control system for robot manipulator is implemented using real-time operating system with capabilities of multitasking, intertask communication and synchronization, event-driven, priority-driven scheduling, real-time clock control, etc. The hardware system with VME bus and related devices is developed and applied to implement a dynamic learning control scheme for robot manipulator. Real-time performance of the proposed dynamic learning controller is tested for tasks of tracking moving objects and compared with the conventional servo controller.

• Journal of Computing Science and Engineering
• /
• 제7권1호
• /
• pp.44-52
• /
• 2013

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

• Journal of Computing Science and Engineering
• /
• 제7권1호
• /
• pp.30-43
• /
• 2013

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs.

• 산업경영시스템학회지
• /
• 제22권52호
• /
• pp.297-309
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling(RCDMPS) is intended to minimize the total processing time(makespan) of two or more projects sequentially arriving at the shop under restricted resources. The aim of this paper is to develop the new Tabu Search heuristic for RCDMPS to minimize makespan. We propose the insertion method to generate the neighborhood solutions in applying the Tabu Search for the RCDMPS and the diversification strategy to search the solution space diversely. The proposed diversification strategy apply the dynamic tabu list that the tabu list size is generated and renewed at each iteration by the complexity of the project, and change the proposed tabu attribute. In this paper, We use the dynamic tabu list for the diversification strategy and intensification strategy in the tabu search, and compare with other dispatching heuristic method to verify that the new heuristic method minimize the makespan of the problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5780-5802
• /
• 2017

Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• 한국시뮬레이션학회논문지
• /
• 제8권3호
• /
• pp.67-76
• /
• 1999

The study of the optimization of operating policy of AGV system, which is used in many factory automation environments has been proceeded by many researchers. The major operating policy of AGV system consists of routing and scheduling policy. AGV routing is composed with collision avoidance and minimal cost path find algorithm. To allocate jobs to the AGV system, AGV scheduling has to include AGV selection rules, parking rules, and recharging rules. Also in these rules, the key time parameters such as processing time of the device, loading/unloading time and charging time should be considered. In this research, we compare and analyze several operating policies of multiple loop-multiple AGV system by making a computer model and simulating it to present an appropriate operating policy.