• Journal of Industrial Convergence
• /
• v.16 no.1
• /
• pp.21-26
• /
• 2018

The Seaborne Trade Volume accounts for 97% of the total. This means that the port operation management system can improve port efficiency, reducing operating costs, and the manager who manages all operations at the port needs to check and respond quickly when delays of work and equipment support is needed. Based on the real-time location information confirmation of yard automation equipment used the existing system GPS, the real-time location information confirmation system is a GPS system of the tablet, rather than a port operation system that monitors location information for the entered information, depending on the completion of the task or the start of the task. Network configurations also reduce container processing delays by using commercial LTE services that do not have shading due to containers in the yard also reduce container processing delays. Trough introduction of smart devices using Android or IOS and container processing scheduling utilizing artificial intelligence, we will build a minimum delay system with Smart Device usage of container processing applications and optimization of container processing schedule. The adoption of smart devices and the minimization of container processing delays utilizing artificial intelligence are expected to improve the quality of port services by confirming the processing containers in real time to consumers who are container information demanders.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.1-16
• /
• 2011

The real-time ubiquitous environment is required to be able to process a series of sensor data within limited time. The whole sensor data processing consists of several phases : getting data out of sensor, acquiring context and responding to users. The ubiquitous computing middleware is aware of the context using the input sensor data and a series of data from database or knowledge-base, makes a decision suitable for the context and shows a response according to the decision. When the real-time ubiquitous environment gets a set of sensor data as its input, it needs to be able to estimate the delay-time of the sensor data considering the available resource and the priority of it for scheduling a series of sensor data. Also the sensor data of higher priority can stop the processing of proceeding sensor data. The research field for such a decision making is not yet vibrant. In this paper, we propose a queuing time computation algorithm for sensor data processing in real-time ubiquitous environment.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.639-648
• /
• 1997

As the areas of computer application are expanded, the real-time applicition enviroments that must process as many transactions as possible within their deadlines have been increased recently. Conventional disk based databaes system is not appropriate in real-time transaction processing due to delying time for disk I/O processing. When the system is overloaede, the performance of transaction scheduling technique using earliest deadline first deteriorates rapidly because it can assign the highest priority ot a transaction that has already missed or is about to miss tis deadline. Therfore, the performance of suggested transaction secheduling technique is made to improved by propos-ing the doule locking mechanism based on priority. Finally, in order to evaluate the performance of the proposed priority-based double locking techniques under single proessor and main memory database system environments, the simulation model was developed using the SLAM II language.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.4
• /
• pp.302-307
• /
• 2012

Real-time systems perform periodic tasks and real-time aperiodic tasks such as alarm processing. Especially the periodic tasks included in control systems such as robots have precedence relationships among them. This paper proposes a new scheduling algorithm based on topological sort and residual time. The precedence relationships among periodic tasks are translated to the priorities of the tasks using topological sort algorithm. During the execution of the system the proposed scheduling algorithm decides on whether or not a newly arrived real-time aperiodic task is accepted based on residual time whenever the aperiodic task such as alarm is arrived. The proposed algorithm is validated using examples.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.124-129
• /
• 2004

Recently, the demand for the optical cable is rapidly growing because the number of internee user increases and high speed internet data transmission is required. But the present optical cable winding systems has some serious problems such as pile-up and collapse of cable usually near the flange of the bobbin in the process of the cable winding. To reduce the pile-up collapse in a cable winding systems, a new guiding system is developed for a high-speed self-align cable winding. First of all, the winding mechanism was analyzed and synchronization logics for the motions of winding, traversing, and the guiding were created. A prototype cable winding systems was manufactured to validate the new guiding system and the suggested logic. Experiment results showed that the winding system with the developed guiding system outperformed the system without the guiding system in reducing pile-up and collapse in the high-speed winding.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.153-161
• /
• 2009

In this paper, we designed and implemented realtime DID(digital information display) system based on web server that displayed multimedia contents. The contents are weather, news information on the internet web sites and public relations or advertisements data on local systems. The DID system has client/server architecture that the server send to client that schedule informations and multimedia contents received form web server and the client displayed the contents though scheduled information. Therefore the systems overcome network fault for the mean time. Also, the system has realtime services of web page filtering function that extract the partial information of specific web pages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.409-412
• /
• 2011

본 논문에서는 Xen-ARM 기반의 가상화 환경에서 실시간 게스트 운영체제의 I/O를 지원하기 위한 방법을 제안한다. Xen-ARM 하이퍼바이저는 서버 환경에서 주로 사용되는 Xen 가상화 기법을 모바일 구조인 ARM에서 구현한 것으로, 분할 드라이버 모델과 크레딧 스케줄러를 지원한다. 하지만, 이러한 두 가지 특성은 I/O 처리 지연의 주요 원인이 된다. 특히, 장치 드라이버와 사용자 태스크의 실행 중에 하이퍼바이저의 도메인 간 스위칭이 필요하므로, 특정 시간으로 I/O 처리 지연을 제한하기 대단히 어렵다. 본 논문에서는 게스트 운영체제의 수정을 통해 I/O 처리 지연을 제한하는 기법을 제안한다. 게스트 운영체제는 현재 실행되는 태스크의 특성을 Xen-ARM 하이퍼바이저에게 간접적으로 전달하여, 전체 시스템의 모든 태스크에 대하여 우선순위를 부여하며, 하이퍼바이저의 스케줄러에서 인터럽트 처리를 위해 가장 응급한 태스크 실행을 스케줄링 할 수 있도록 한다. 제안하는 기법은 실험을 통해, I/O를 처리하는 도메인의 1ms 이상의 처리시간이 84%에서 99%까지 줄어들 수 있음을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1507-1514
• /
• 2016

Full-image guided filter reflects all pixels of image in filtering by using weight propagation and two-pass model, whereas the existing guide filter is processed based on the kernel window. Therefore the computational complexity can be improved while maintaining characteristics of guide filter, such as edge-preserving, smoothing, and so on. In this paper, we propose an efficient VLSI architecture for the full-image guided filter by analyzing the data dependency, the data frequency and the PSNR analysis of the image in order to achieve enough speed for various applications such as stereo vision, real-time systems, etc. In addition, the proposed efficient scheduling enables the realtime process by minimizing the idle period in weight computation. The proposed VLSI architecture shows 214MHz of maximum operating frequency (image size: 384*288, 965 fps) and 76K of gates (internal memory excluded).

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.378-389
• /
• 1999

Parallel tasks in distributed real-time systems can be divided into several subtasks and be executed in parallel according to their real-time attributes. But, it is difficult to gain the optimal solution which is to allocate a tasks deadline into the subtasks deadline while minimizing the subtasks deadline miss. Tn this Paper, we propose the algorithm that allocates deadlines into each subtask, according to the attributes of each subtask(i.e. using communication time and execution time to periodic tasks). Also, we suggest a processor mapping algorithm that considers the communication time among the processors and the effective duplication algorithm which is allocated to the identical processor for the purpose of improving the communication time between the subtasks. We can obtain a result that reduces IPC(Inter-Processor Communication) time and uses the idle processor through applying effective real-time attributes to FUTD(Fully connected, Unbounded Task Duplication) algorithms. As a result, we can improve the average processor utilization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.191-194
• /
• 2001

멀티미디어 응용의 확산에 따라 MOD와 같은 서비스와 이를 뒷받침하기 위해 네트웍 환경이 급증하고 있다. 이러한 서비스는 네트웍을 이용하므로 실시간성과 최적의 스케줄링 알고리즘이 필요하다. 본 논문에서는 가변적인 네트웍 상황을 고려한 전역시간 동기화 방법을 제안한다. 제안한 알고리즘은 UDP환경 하에서의 설계 및 구현하였다. 성능 측정은 여러 가지 네트웍 환경에서 측정하였다. 제안한 알고리즘을 통해 측정된 데이터분석에 의해 서버 시간에 근접한 시간동기화를 얻을 수 있으므로 클라이언트의 QoS를 높일 수 있다.