• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.1-10
• /
• 2014

In this paper, we propose a real-time video playback scheme for the N-Screen service based on Windows Azure. This scheme creates several playback blocks based on the performance of each node by non-uniform splitting of the original video. To reduce transcoding-time, it allocates the playback blocks to a corresponding node by transcoding the playback blocks. Through the simulation, we show that it is more effective to use real-time video playback for the N-screen service than the previous method. The proposed scheme splits an AVI format 300MB source video with non-uniform playback blocks. It allocates the playback blocks to the heterogeneous node of Windows Azure, the commercial cloud system and measures of transcoding-time by transcoding non-uniform playback blocks to mp4 and Flv format. As a result, the proposed scheme improves the performance of the N-screen service based on Windows Azure compared to the previous uniform split strategy.

• ETRI Journal
• /
• v.40 no.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.

• Journal of Korea Multimedia Society
• /
• v.24 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.179-186
• /
• 2005

This paper describes a genetic algorithm and compares three crossover operators for Rural Postman Problem with Time Windows (RPPTW). The RPPTW which is a multiobjective optimization problem, is an extension of Rural Postman Problem(RPP) in which some service places (located at edge) require service time windows that consist of earliest time and latest time. Hence, RPM is a m띤tieect optimization Problem that has minimal routing cost being serviced within the given time at each service Place. To solve the RPPTW which is a multiobjective optimization problem, we obtain a Pareto-optimal set that the superiority of each objective can not be compared. This Paper performs experiments using three crossovers for 12 randomly generated test problems and compares the results. The crossovers using in this Paper are Partially Matched Exchange(PMX) Order Exchange(OX), and Modified Order Exchange(MOX) which is proposed in this paper. For each test problem, the results show the efficacy of MOX method for RPPTW.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.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.

• IE interfaces
• /
• v.14 no.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.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.14-24
• /
• 2020

Real-time performance is to return the exact result value to the correct cycle, or to perform the specified work at a certain cycle. Windows does not support real-time performance, so it supports real-time performance using expensive third parties such as RTX and INtime. This paper aims to support real-time performance of Windows through RTiK, a real-time kernel that operates in the form of a device driver in Windows. In Windows 7, RTiK used a timer using local APIC supported by x86 hardware. However, due to the Kernel Patch Protection (KPP) on Windows 10, it became impossible to use a local APIC timer. Therefore, a timer is implemented to inform the determined cycle using Local APIC IPI, and performance measurement is performed to confirm that the cycle operates normally within the error range. This enables real-time performance on Windows 10.

• Journal of Korea Multimedia Society
• /
• v.24 no.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.

• IE interfaces
• /
• v.17 no.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.