• 한국멀티미디어학회논문지
• /
• 제9권7호
• /
• pp.827-834
• /
• 2006

참여자의 수가 대규모화되고 있는 분산가상환경에서 사용자의 행위에 대한 응답성은 시스템의 만족도를 결정하는 중요한 요소 중의 하나이다. 시스템의 응답성은 서버에서 이벤트 처리 알고리즘의 효율성에 의하여 영향을 받으며 대부분의 가상환경은 이벤트 메시지를 발생순서에 따라 순차적으로 처리하는 FCFS알고리즘을 사용한다. FCFS방식은 이벤트의 우선순위는 고려하지 않고 발생시간에만 전적으로 의존함으로써 일반 이벤트 메시지의 처리로 인해 사용자의 상호작용에 의해 생성된 긴급 이벤트의 처리가 지연되어 시스템 응답성을 저하시키는 문제점을 가지고 있다. 본 연구에서는 기존의 FCFS 이벤트 처리방식의 문제점을 개선하기 위하여 이벤트에 우선순위를 부여하고 이에 기반하여 서버에서 다중 메시지의 병행 처리가 가능한 이벤트 스케줄링 알고리즘을 제안한다. 본 알고리즘은 서버에서 처리충돌을 일으키는 이벤트에 대하여 발생시간과 우선순위 정보를 상호절충하여 처리함으로써 시스템의 일관성과 응답성의 목표를 동시에 만족시키는 효과가 있다.

• 한국시뮬레이션학회논문지
• /
• 제5권2호
• /
• pp.41-58
• /
• 1996

The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.

• 융합보안논문지
• /
• 제20권5호
• /
• pp.41-52
• /
• 2020

본 논문은 보안 이벤트 위험성에 따른 능동적 대응을 위해서 우선순위 알고리즘을 구현하는 것이며, 이를 기반으로 효율적인 이벤트 처리를 수행하는 이벤트 스케줄러를 구현하고자 한다. CVE나 CVSS 같이 세계적으로 표준을 가지고 있는 기준에 따라, 보안 이벤트를 실행시켰을 때 점수를 매길 수 있는 기준을 마련하고, 정형화 하여 보다 객관적으로 우선순위를 정할 수 있도록 한다. 그래서 이를 바탕으로 보안 이벤트 데이터베이스를 구축하고, 이를 이용하여 스케줄링을 할 수 있도록 한다. 또한 보안 이벤트 스케줄링 우선순위 알고리즘을 우리나라 보안 이벤트 실정에 맞게 개발하고 적용함으로써 국내 기관 및 기업의 정보보호에 대한 신뢰성 확보와 산업 발전에 기여하게 될 것이다.

• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.323-330
• /
• 2002

최근의 내장형(embedded) 실시간 운영체제들은 응용 분야에 따라 다양하게 개발되고 있다. 이러한 운영체제들의 중요한 차이점은 시간적인 제한 사항을 제어할 수 있는 타스크 스케줄링 기능과 다양한 환경에서 사용할 수 있는 장치들의 개발에 있다. 본 연구에서는 우선순위 기반의 선점(preemption) 메커니즘을 지원하는 $\mu$C/OS-II버전 2.03에서 동일 우선 순위를 가진 다중 태스크들을 관리하기 위한 시분할 방식의 Round/Robin(R/R) 타스크 스케줄링 기능을 추가하였다. 이를 위해 본 연구에서는 $\mu$C/OS-II의 커널 구조에서 가장 중요한 이베트 대기 리스트 구조를 제안하고, 제안된 구조에 대해 동일 우선순위를 가지는 다중 타스크의 실행 결과를 제시한다.

• 한국국방경영분석학회지
• /
• 제25권1호
• /
• pp.199-214
• /
• 1999

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 real-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. Conventionally, scheduling and resource allocation activities which have timing 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 rate monotonic scheduling.

• 대한산업공학회지
• /
• 제12권1호
• /
• pp.19-30
• /
• 1986

This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model, in which new jobs with stochastic processing times arrive at the shop randomly over time and are added into the waiting jobs for processing. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported me-sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are surmmarized. These scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical dynamic flowshop problems.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.719-727
• /
• 2006

This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.116-122
• /
• 2013

This study develops a dynamic scheduling model for parallel machine scheduling problem based on genetic algorithm (GA). GA combined with discrete event simulation to minimize the makespan and verifies the effectiveness of the developed model. This research consists of two stages. In the first stage, work sequence will be generated using GA, and the second stage developed work schedule applied to a real work area to verify that it could be executed in real work environment and remove the overlapping work, which causes bottleneck and long lead time. If not, go back to the first stage and develop another schedule until satisfied. Small size problem was experimented and suggested a reasonable schedule within limited resources. As a result of this research, work efficiency is increased, cycle time is decreased, and due date is satisfied within existed resources.

• 대한기계학회논문집A
• /
• 제20권1호
• /
• pp.14-23
• /
• 1996

Scheduling jobs effectively under consideration of actual loads on machines is one of the most complicated tasks in production control. The complexity of the finite capacity scheduling often makes the conventional methods of industrial engineering fail. As an alternative, Knowledge-based approaches to job-shop scheduling have been evolved recently. This paper presents a blackboard- based scheduling expert system which combines knowledge-based scheduling with interactive scheduling. It is shown to be possible to generate the feasible schedule within a reasonable time. Flexible reaction management is also possible while keeping the changes in the generated schedule to the minimal and adjusting the schedule to tardy operations or working environmental changes. The system is equipped with a rule base with heuristics for handling conflicted event. A case study applying the implemented system is described.

• Journal of Communications and Networks
• /
• 제6권2호
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.