• 제어로봇시스템학회논문지
• /
• 제17권1호
• /
• pp.38-46
• /
• 2011

The OPRoS (Open Platform for Robotic Service) framework provides uniform operating environment for service robots. As an OPRoS-based service robot has to support real-time as well as non-real-time applications, application of Windows NT kernel based operating system can be restrictive. On the other hand, various benefits such as rich library and device support and abundant developer pool can be enjoyed when service robots are built on Windows NT. The paper presents a user-mode component scheduler of OPRoS, which can provide near real-time scheduling service on Windows NT based on the restricted real-time features of Windows NT kernel. The component scheduler thread with the highest real-time priority in Windows NT system acquires CPU control. And then the component scheduler suspends and resumes each periodic component executors based on its priority and precedence dependency so that the component executors are scheduled in the preemptive manner. We show experiment analysis on the performance limitations of the proposed scheduling technique. The analysis and experimental results show that the proposed scheduler guarantees highly reliable timing down to the resolution of 10ms.

• 한국컴퓨터정보학회논문지
• /
• 제19권6호
• /
• pp.1-10
• /
• 2014

본 논문에서는 Windows Azure 기반의 N-스크린 서비스를 위한 실시간 동영상 재생 기법을 제안한다. 이 기법은 각 노드의 성능에 따라 원본 동영상을 차등 분할하여 재생 블록을 생성한다. 그리고 차등 분할한 재생 블록을 해당 노드에 할당하여 트랜스 코딩함으로써 트랜스 코딩 소요시간을 줄인다. 본 논문에서는 시뮬레이션을 통하여 제안한 동영상 재생기법이 기존의 기법에 비해 N-스크린 서비스를 위한 실시간 동영상재생에 효과적임을 보인다. 시뮬레이션에서는 상용화된 클라우드 시스템인 Windows Azure 기반에서 AVI 포맷 300MB 원본 동영상을 각 노드의 성능에 따라 차등 분할한다. 그리고 Windows Azure의 이기종 노드에 분산 할당하여 mp4와 Flv 포맷으로 트랜스 코딩하면서 트랜스 코딩 소요시간을 측정한다. 그 결과 본 논문의 제안 기법이 기존의 균등 분할 기법에 비해 Windows Azure 기반의 N-스크린 서비스의 성능을 향상시킨다.

• ETRI Journal
• /
• 제40권1호
• /
• pp.111-121
• /
• 2018

To find the emerging patterns (EPs) in streaming transaction data, the streaming is first divided into some time windows containing a number of transactions. Itemsets are generated from transactions in each window, and then the emergence of itemsets is evaluated between two windows. In the tilted-time windows model (TTWM), it is assumed that people need support data with finer accuracy from the most recent windows, while accepting coarser accuracy from older windows. Therefore, a limited array's elements are used to maintain all support data in a way that condenses old windows by merging them inside one element. The capacity of elements that accommodates the windows inside is modeled using a particular number sequence. However, in a stream, as new data arrives, the current array updating mechanisms lead to many null elements in the array and cause data incompleteness and inaccuracy problems. Two models derived from TTWM, logarithmic TTWM and Fibonacci windows model, also inherit the same problems. This article proposes a novel push-front Fibonacci windows model as a solution, and experiments are conducted to demonstrate its superiority in finding more EPs compared to other models.

• 한국멀티미디어학회논문지
• /
• 제24권2호
• /
• pp.199-207
• /
• 2021

It is very important to support real-time on the inspection equipment based on Windows. In particular, in the system using MIL-STD-1553B communication, which is widely used in military weapon systems, real-time is required for inspection equipment that uses mostly platforms based on Windows such as Industrial PCs. However, in order to use a complete real-time operating system such as VxWorks, the purchase cost is expensive and the implementation is complicated on the system, so it is not suitable for inspection equipment that requires simple functions to just check go or no-go. Therefore, in this paper, a Real-Time implanted Kernel(RTiK) in the Windows kernel is implanted in order to improve these defects, and real-time performance is implemented for periodically MIL-STD-1553B communication by Deferred Procedure Call(DPC) of Windows. Also, it was verified that the period of up to 2ms was guaranteed with a RDTSC into the EDX:EAX registers for measuring the periodicity.

• 한국컴퓨터정보학회논문지
• /
• 제10권5호
• /
• pp.179-186
• /
• 2005

본 논문에서는 유전자 알고리즘을 이용한 rural Postman problem with Time windows(RPPTW) 해법을 위해 유전자 알고리즘에 사용되는 교차 연산자를 제안하고, 기존의 교차 연산자와 비교한다. RPPTW는 다중목적 최적화 문제로서, Rural Postman Problem(RPP)에 서비스 시간 제한을 위한 시간 윈도우(Time Windows)를 두고 제한된 시간 내에 서비스를 받을 수 있도록 구성된 문제이다. 따라서, RPPTW는 주어진 시간 내에 서비스를 받으면서 최소 비용으로 라우팅을 하는 다중 목적 최적화 문제이다. 다중 목적 최적화 문제인 RPPTW를 해결하기 위해서는 Pareto-optimal 집합을 구해야 한다. Pareto-optimal 집합은 각 목적값들의 우수성을 비교할 수 없는 집합이다. 본 논문에서는 12개의 임의로 생성된 문제들에 대해 3개의 교차 연산자를 사용하여 실험을 하여 그 결과를 비교하였다. 본 논문에서 사용된 교차 연산자들은 PMX(Partially Matched Exchange), OX(Order Exchange), 그리고 본 논문에서 제안한 MOX(Modified Order Exchange)이다. 각 문제들에 대한 실험 결과를 통해서 RPPTW를 위한 교차 연산자 중에 본 논문에서 제안한 MOX방법이 효율적임를 알 수 있었다.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.18-24
• /
• 2001

This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node. But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.

• 산업공학
• /
• 제14권4호
• /
• pp.365-373
• /
• 2001

It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

• 한국콘텐츠학회논문지
• /
• 제20권10호
• /
• pp.14-24
• /
• 2020

실시간 성능이란 정확한 주기에 정확한 결과값을 반환하거나, 일정 주기마다 정해진 일을 수행하는 것이다. 윈도우는 실시간 성능을 지원하지 못하므로 RTX나 INtime과 같은 고가의 서드파티를 사용하여 실시간 성능을 지원한다. 본 논문은 윈도우에 디바이스 드라이버 형태로 동작하는 실시간 커널인 RTiK을 통해 윈도우에 실시간 성능을 지원하고자 한다. 윈도우 7에서 RTiK은 x86 하드웨어에서 지원하는 Local APIC를 이용한 타이머를 사용하였다. 하지만 윈도우 10에서 KPP(Kernel Patch Protection)으로 인해 Local APIC 타이머를 사용하는 것이 불가능해졌다. 이에 Local APIC IPI를 사용하여 정해진 주기를 알리는 타이머를 구현하였고 성능 측정을 수행하여 주기가 오차범위 내에서 정상 동작함을 확인하였다. 이를 통해 윈도우 10에서 실시간 성능 제공을 가능하게 하였다.

• 한국멀티미디어학회논문지
• /
• 제24권1호
• /
• pp.95-105
• /
• 2021

In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.

• 산업공학
• /
• 제17권spc호
• /
• pp.103-110
• /
• 2004

This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.