• 한국컴퓨터정보학회논문지
• /
• 제6권1호
• /
• pp.67-73
• /
• 2001

본 논문에서는 광대역 가입자 엑세스망의 인프라 기술인 ATM 노드에서의 셀 스케줄링 알고리즘을 제안한다. 기존의 트레인 스케줄링 알고리즘(Train scheduling algorithm)이나 챠오 스케쥬링 알고리즘(Chao scheduling algorithm), 동적 스케줄링 알고리즘(Dynamic scheduling algorithm) 등의 ATM 스케줄링 알고리즘들은 셀 손실률이 높고 전송 채널의 낭비가 많은 단점이 있다. 본 연구에서는 다양한 멀티미디어 서비스 제공을 위해 입력 소스 트래픽의 QoS 등급에 기초를 둔 제어 방식을 제안한다. 먼저 다양한 서비스 품질을 만족시키기 위한 스케줄링 알고리즘과 기능적 구조를 설계하고. 모의실험을 통해 패킷 손실율과 평균지연 측면에서 알고리즘의 성능을 고찰한다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
• /
• pp.249-257
• /
• 1992

An automated machining system involves concurrent use of manufacturing resources, alternative process plans, and flexible routings. High investment in the installation of automated facilities requires an efficient scheduling system that is able to allocate the resources specified for operations over a scheduling horizon. The primary emphasis of this paper is to generate schedules that accurately reflect details of the automated environment and the objectives stated for the system. In this paper, a scheduling algorithm for automated machining is presented. Using the previous simulation research for this topic, a rule-based scheduling system is constructed. An architecture for an intelligent scheduling system is proposed, and the system has a high potential to provide efficient schedules based on the task-specific knowledge for the dynamic scheduling environment

• Journal of Multimedia Information System
• /
• 제3권4호
• /
• pp.149-154
• /
• 2016

Wireless mesh networks (WMNs) are used for metropolitan area network that requires high network throughput for handling many users. TDMA-based access is a common solution for this problem and several scheduling methods have been proposed. However, existing heuristic methods have room for improvement at network throughput although they are low complexity. In this paper, we propose a novel divided scheduling method based on structural characteristics in order to improve network throughput in WMNs. It separately schedules neighbor links of gateways and that of the other links by different scheduling algorithms. Simulation-based evaluations show that our proposal improves up to 14% of network throughput compared with conventional scheduling algorithm script.

• 한국멀티미디어학회논문지
• /
• 제22권4호
• /
• pp.515-526
• /
• 2019

DOOH(Digital Out Of Home) advertising targets for reaching consumers through outdoor digital display medias. Traditionally, scheduling of advertisement contents over DOOH medias is usually done by operator's strategy, but an efficient ad scheduling strategy is not easy to find under various advertising contexts. In this paper, we present a context-aware factorization machine-based recommendation model for the scheduling under various advertising contexts, and provide analysis for understanding of the contexts' effects on advertising based on the recommendation model. Through simulation results on the dataset adapted from a real dataset of RecSys challenge 2015, it is shown that the proposed model and analysis based on the model will be effective for better scheduling of ad contents under advertising contexts over DOOH networks.

• Journal of Electrical Engineering and Technology
• /
• 제10권6호
• /
• pp.2406-2412
• /
• 2015

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4^th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

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

The switched Ethernet has many features for real-time communications such as providing traffic isolation, large bandwidth, and full-duplex links, and so on. The switched Ethernet, however, cannot guarantee the timely delivery of a real-time message because message delay increases when collisions occurs at the output ports and message loss can even occur due to the overflow at the output buffer. Recently, many research efforts have been done to use the switched Ethernet as an industrial control network. In the industrial control network, sensors periodically sense the physical environment and transmit the sensed data to an actuator, and the periodic messages from sensors to actuators have typically real-time requirements such that those messages must be transmitted within their deadlines. This paper first suggests a feasible condition for EDF (Earliest Deadline First)-based scheduling of periodic messages on a synchronized switched Ethernet and a message scheduling algorithm which satisfies the proposed feasible condition. Pedreiras, et al. [10] suggested a feasible condition for message scheduling on the Ethernet (shared media Ethernet), but there has been no research result on the scheduling condition on the switched Ethernet until now. We compared the real-time message scheduling capacity between the Ethernet and the switched Ethernet by simulation. The simulation result shows that the message scheduling capacity of the Ethernet has almost remained constant as the number of nodes on the network increases, but, in the case of the switched Ethernet, the message scheduling capacity has increased linearly according to the number of nodes on the network.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.808-811
• /
• 1996

A mathematical model was developed for the simulation of a Pressure Swing Adsorption process with dehydrogenation reaction. The minimum number of beds and optimum operating sequence were determined using MINLP under the given operating conditions. Based on these results, we estimated the minimum annual cost.

• 한국시뮬레이션학회논문지
• /
• 제12권2호
• /
• pp.13-24
• /
• 2003

In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system Into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.

• Journal of Information Processing Systems
• /
• 제19권4호
• /
• pp.450-464
• /
• 2023

To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.