• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.345-354
• /
• 2004

In these days, such services are popularized as E-commerce, E-government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of server resources when heavy requests reach the web server Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.781-786
• /
• 2004

In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• Journal of IKEEE
• /
• v.27 no.3
• /
• pp.265-272
• /
• 2023

In this paper, a GPU-accelerated kernel of range Doppler algorithm (RDA) was developed for real-time image formation based on frequency modulated continuous wave (FMCW) synthetic aperture radar (SAR). A pinned memory was used to minimize the data transfer time between the host and the GPU device, and the kernel was configured to perform all RDA operations on the GPU to minimize the number of data transfers. The dataset was obtained through the FMCW drone SAR experiment, and the GPU acceleration effect was measured in an intel i7-9700K CPU, 32GB RAM, and Nvidia RTX 3090 GPU environment. Including the data transfer time between host and devices, it was measured to be accelerated up to 3.41 times compared to the CPU, and when only the acceleration effect of operation was measured without including the data transfer time, it was confirmed that it could be accelerated up to 156 times.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.51-59
• /
• 2011

Intelligent service robots leading the future market are robots which assist humans physically, mentally, and emotionally. Since intelligent service robots operate in a tightly coupled manner with humans, their safe operation should be an inevitable consideration. For this safety, real-time capabilities are necessary to execute certain services periodically. Currently, most robot components are being developed based on Windows for the sake of development convenience. However, since Windows does not support real-time, there is no option but to use expensive third-party software such as RTX and INTime. Also since most robot components are usually execute in user-level, we need to research how to support real-time in user-level. In this paper, we design and implement how to support real-time for components running in user-level on Windows using RTiK which actually supports real-time in kernel level on Windows.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.159-168
• /
• 2002

Real-time(RT) object-oriented(OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the Real Time Simulation Programing(RTSP) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The RTSP scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The RTSP structuring scheme is a syntactically simple but semantically Powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established OO programming languages such as C+ + and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.483-488
• /
• 2004

For real-time applications, the underlying operating system (0S) should support timeliness guarantees of real-time tasks. However, most of current operating systems do not provide timely management facilities in an efficient way. There could be two approaches to support timely management facilities for real-time applications: (1) by modifying 0S kernel and (2) by Providing a middleware without modifying 0S. In our approach, we adopted the middleware approach based on the TMO (Time-triggerred Message-triggered Object) model which is a well-known real-tine object model. The middleware, named TMSOM (TMO Support Middleware) has been implemented on various OSes such as Linux and Windows XP/NT/98. In this paper, we mainly consider TMOSM implemented on Linux(TMOS/Linux). Although the real-time schedul-ing aIgorithm used in current TMOSM/Linux can produce an efficient real-time schedule, it can be improved for periodic real-time tasks by considering several factors. In this paper, we discuss those factors and propose an improved real-time scheduling algorithm for periodic real-time tasks, In order to simulate the performance of our algorithm, we measure timeliness guarantee rate for periodic real-time tasks. The result shows that the performance of our algorithm is superior to that of existing algorithm. Additionally, the proposed algorithm can improve system performance by making the structure of real-time middleware simpler.

• The Journal of the Korea Contents Association
• /
• v.13 no.3
• /
• pp.22-31
• /
• 2013

For the case of test equipments requiring data accuracy, real-time is highly required in acceptance test for performance evaluation of developed weapons. For convenience' sake, test equipments are usually developed using Windows. However Windows does not support real-time in itself. Thus, in this paper, so as to reduce development time and expenses, we design and implement an integrated middleware for real-time device drivers using RTiK-MP. Using DLL, we also support user API's for the sake of development convenience without details of the complex RTiK-MP structure. We evaluate the performance of the proposed integrated middleware using the RDTSC command which returns the number of CPU clock ticks. The evaluation results show that it operates correctly within error ranges in the periods of 1ms and 4ms for the cases of TCP/IP and RS-232, respectively.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.187-196
• /
• 1997

This paper presents a semi-automatic methodology to synthesize executable digital controller saftware in a multi-loop control system. A digital controller is described by a task graph and end-to-end timing requirements. A task graph denotes the software structure of the controller, and the end-to-end requirements establish timing relationships between external inputs and outputs. Our approach translates the end-to-end requirements into a set of task attributes such as task periods and deadlines using nonlinear optimization techniques. Such attributes are essential for control engineers to implement control programs and schedule them in a control system with limited resources. In current engineering practice, human programmers manually derive those attributes in an ad hoc manner: they often resort to radical over-sampling to safely guarantee the given timing requirements, and thus render the resultant system poorly utilized. After task-specific attributes are derived, the tasks are scheduled on a single CPU and the compiled kernel is synthesized. We illustrate this process with a non-trivial servo motor control system.

• Structural Engineering and Mechanics
• /
• v.18 no.5
• /
• pp.591-607
• /
• 2004

The substance of the use of the derived non-linear creep constitutive equations under variable stress levels (see first part of the paper, Kmet 2004) is explained and the strategy of their application is outlined using the results of one-step creep tests of the steel spiral strand rope as an example. In order to investigate the creep strain increments of cables an experimental set-up was originally designed and a series of tests were carried out. Attention is turned to the individual main steps in the production and application procedure, i.e., to the one-step creep tests, definition of loading history, determination of the kernel functions, selection and definition of constitutive equation and to the comparison of the resulting values considering the product and the additive forms of the approximation of the kernel functions. To this purpose, the parametrical study is performed and the results are presented. The constitutive equations of non-linear creep of cable under variable stress history offer a strong tool for the real simulation of stochastic variable load history and prediction of realistic time-dependent response (current deflection and stress configuration) of structures with cable elements. By means of suitable stress combination and its gradual repeating various loads and times effects can be modelled.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2094-2112
• /
• 2019

Focusing on the issue that the conventional Kernel Correlation Filter (KCF) algorithm has poor performance in handling scale change and obscured objects, this paper proposes an anti-occlusion and scale adaptive tracking algorithm in the basis of KCF. The average Peak-to Correlation Energy and the peak value of correlation filtering response are used as the confidence indexes to determine whether the target is obscured. In the case of non-occlusion, we modify the searching scheme of the KCF. Instead of searching for a target with a fixed sample size, we search for the target area with multiple scales and then resize it into the sample size to compare with the learnt model. The scale factor with the maximum filter response is the best target scaling and is updated as the optimal scale for the following tracking. Once occlusion is detected, the model updating and scale updating are stopped. Experiments have been conducted on the OTB benchmark video sequences for compassion with other state-of-the-art tracking methods. The results demonstrate the proposed method can effectively improve the tracking success rate and the accuracy in the cases of scale change and occlusion, and meanwhile ensure a real-time performance.