• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.852-854
• /
• 2010

MCM-ERC32 는 우주 환경에서 동작하는 시스템에 사용할 목적으로 유럽에서 개발된 집약 프로세서 모듈이다. MCM (Multi Chip Module)은 크게 ERC32 single chip 과 VASI (Very Advanced Sparc Interface) 및 6MByte 의 SRAM, 32MByte 의 DRAM 으로 구성되어 있다. VASI 의 경우 각종 I/O 처리 및 timer 의 기능을 수행하며 특히 VASI RTC 의 경우 VASI cycle, slot 을 이용하여 다양한 형태의 timer 구현이 가능하다. Timer 의 경우 각종 태스크의 관리와 스케줄링에 사용되는 가장 기본적이며 매우 중요한 요소이다. 위성의 고유 시간 역시 timer 를 활용하여 설계하게 되는데 이 부분이 잘 구현 되어야 정확한 임무 수행 및 위성의 제어가 가능하다. 본 논문에서는 VASI RTC 의 구조와 기능에 대해 설명하고 이를 위성의 고유 시간 운영에 적용하는 방법에 대해 다루도록 하겠다.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.827-834
• /
• 2006

In distributed virtual environment, system response time to users' interactions is an importance factor to determine the degree of contentment with the system. Generally, response time is affected by the efficiency of event message processing algorithm, and most of previous systems use FCFS algorithm, which processes message traffic sequentially based only on the event occurrence time. Since this method totally depends on the order of occurrence without considering the priorities of events, it has a problem that might drop the degree of system response time by causing to delay processing message traffic when a bottleneck phenomenon happens in the server side. To overcome this limitation of FCFS algorithm, this paper proposes a concurrent event scheduling algorithm, which is able to process event messages concurrently by assigning the priorities to the events. It is also able to satisfy the two goals of system together, consistency and responsiveness through the combination of occurrence time with priority concept of events.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.89-99
• /
• 2005

HPI system provides 1-3 Mbps data transmission speed to terminals moving up to 60 km/sec. Since HPI supports rtPS, nrtPS, and BE services requiring different QoS, it needs an efficient scheduling method based on those different QoSs. This paper suggests an uplink scheduling method which gives priority to services in the order of rtPS, nrtPS and BE services but which reserves some bandwidth for the low priority services before it allocates the bandwidth to higher priority services. Simulation results show that it can improve the uplink performance by reserving mean transmission rate to each nrtPS terminal and by reserving bandwidth, which amounts to about 1.5 times the mean transmission rate of the whole BE terminals, to the whole BE terminals.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.11-17
• /
• 2012

In recent years, there has been a popularity rose up on Smart TV (Smart Television) usage at home. Therefore, it is also have increase the demand on grid computing system. Smart TV has a variety of platform and usage compare to PC (Personal computer). Base on this, it is difficult to apply a traditional grid system on Smart TV. One major reason are concerning the small idle time compare to PC. To overcome this problem, this paper will propose a Javascript grid system and introducing a new scheduling policy that best suit for a smart TV. We have conduct an experiment on the proposed method. The result provides an average of 1.78 percent, which is improved compare to the traditional method which is only provides an average of 0.09 percent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.798-803
• /
• 2006

An opportunistic scheduling is adopted to improve the capacity of the system by exploiting the multiuser diversity of multiuser MIMO(MU-MIMO) systems. However it requires the large amount of feedback carrying the channel quality information(CQI) of each user to the transmitter, The considered per user unitary and rate control(PU2RC) needs to feedback the preferred preceding index and its CQIs, and it has a defect in scheduling the streams for the grouped user. In order to overcome these drawbacks, a novel feedback reduction scheme is proposed in this paper. It employs transmitter controlled preceding and opportunistic feedback(TCP-OFB). The simulation results demonstrate that TCP-OFB shows comparable performance to PU2RC while it only requires far reduced feedback load.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.493-505
• /
• 2016

Among modern computer vision and video surveillance systems, the pedestrian counting system is a one of important systems in terms of security, scheduling and advertising. In the field of, pedestrian counting remains a variety of challenges such as changes in illumination, partial occlusion, overlap and people detection. During pedestrian counting process, the biggest problem is occlusion effect in crowded environment. Occlusion and overlap must be resolved for accurate people counting. In this paper, we propose a novel pedestrian counting system which improves existing pedestrian tracking method. Unlike existing pedestrian tracking method, proposed method shows that average filter tracking method can improve tracking performance. Also proposed method improves tracking performance through frame compensation and outlier removal. At the same time, we keep various information of tracking objects. The proposed method improves counting accuracy and reduces error rate about S6 dataset and S7 dataset. Also our system provides real time detection at the rate of 80 fps.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.184-191
• /
• 2010

In the environment of 450mm wafers production known as the next-generation semiconductor production process, one of the most significant features is the full automation over the whole manufacturing processes involved. The full automation system for 450mm wafer production will minimize the human workers' involvement in the manufacturing process as much as possible. In addition, since the importance of an individual wafer processing increases noticeably, it is necessary to develop more robust scheduling systems in the whole manufacturing process than so ever. The scheduling systems for the next-generation semiconductor production processes also should be capable of monitoring individual wafers and collecting useful data on them in real time. Based on the information gathered from these processes, the system should finally have a real-time scheduling functions controlling whole the semiconductor manufacturing processes. In this study, preliminary investigations on the requirements and needed functions for constructing the real time scheduling system and transforming manufacturing environments for 300mm wafers to those of 400mm are conducted and through which the next generation semiconductor processes for efficient scheduling in a clustered production system architecture of the scheduler is proposed. Our scheduling architecture is composed of the modules for real-time scheduling, the clustered production type supporting, the optimal scheduling and so on. The specifications of modules to define the major required functions, capabilities, and the relationship between them are presented.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.183-192
• /
• 2006

This paper analyzes the price-selection problem under priority-based scheduling for QoS (Quality of Service) network services, i.e., how to determine the price associated with each service level. In particular, we focus on the problems with the pricing mechanism based on equilibrium analysis. We claim that the assumptions needed to produce equilibrium nay not hold in some important environments. Specifically, (a) the individual user's impact on the system is not infinitesimal and (b) users do not always have up-to-date global system-status knowledge crucial for optimal user decisions required for equilibrium. These may make the equilibrium models inaccurate in realistic environments. We examine the accuracy of some existing equilibrium methods by using a dynamic model that we have developed for system behavior analysis. The analysis indicates that equilibrium methods fail to model accurately the system behavior in some realistic environments.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.113-130
• /
• 2006

Recently with the explosive growth of Internet applications, the attacks of hackers on network are increasing rapidly and becoming more seriously. Thus information security is emerging as a critical factor in designing a network system and much attention is paid to Network Intrusion Detection System (NIDS), which detects hackers' attacks on network and handles them properly However, the performance of current intrusion detection system cannot catch the increasing rate of the Internet speed because most of the NIDSs are implemented by software. In this paper, we propose a new high performance network intrusion using Network Processor. To achieve fast packet processing and dynamic adaptation of intrusion patterns that are continuously added, a new high performance network intrusion detection system using Intel's network processor, IXP1200, is proposed. Unlike traditional intrusion detection engines, which have been implemented by either software or hardware so far, we design an optimized architecture and algorithms, exploiting the features of network processor. In addition, for more efficient detection engine scheduling, we proposed task allocation methods on multi-processing processors. Through implementation and performance evaluation, we show the proprieties of the proposed approach.