• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.796-799
• /
• 2004

최근 반도체 기술과 회로 설계 기술이 발달하면서, 하드웨어와 소프트웨어 부분을 별도로 분리하여 설계하지 않고, 통합하여 설계함으로써 적은 비용으로 고성능의 시스템을 구축할 수 있는 통합설계 기반이 구축되었다. 그러나, 하드웨어와 소프트웨어가 혼재할 경우에는 두 영역 사이에서의 통신 부담이 비교적 큰 편으로 발생하여 오히려 소프트웨어로만 설계한 경우보다 성능이 떨어질 소지가 있다. 본 논문에서는 이러한 통신 부담을 줄일 수 있는 방안에 대해 세 가지를 간략히 소개하고 있다.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.126-131
• /
• 2015

As flash-based storage systems have been actively employed in large-scale servers and data centers, reliability has become an indispensable element. One promising technique for enhancing reliability is static wear-leveling, which distributes erase operations evenly among blocks so that the lifespan of storage systems can be prolonged. However, increasing the capacity makes the processing overhead of this technique non-trivial, mainly due to searching for blocks whose erase count would be minimum (or maximum) among all blocks. To reduce this overhead, we introduce a new randomized block selection method in static wear-leveling. Specifically, without exhaustive search, it chooses n blocks randomly and selects the maximal/minimal erased blocks among the chosen set. Our experimental results revealed that, when n is 2, the wear-leveling effects can be obtained, while for n beyond 4, the effect is close to that obtained from traditional static wear-leveling. For quantitative evaluation of the processing overhead, the scheme was actually implemented on an FPGA board, and overhead reduction of more than 3 times was observed. This implies that the proposed scheme performs as effectively as the traditional static wear-leveling while reducing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.614-622
• /
• 2006

In this paper, we propose an efficient packetization method to reduce the packetization overhead. For the purpose, we firstly verify the relationship between packet length and packet loss rate. The empirical results show that as the packet length is larger than the path MTU, the packet loss rate is drastically increased, producing poor visual quality at the receiver side. However, as the length of the packet is reduced, we should transmit more packets per frame and the packetization overhead will be increased. This increase in the packetization overhead reduces the number of bits allocated to the video data, resulting in the low visual quality. Therefore, each packet should be packetized to have the packet length close to the path MTU. In this paper, we show that the this process of the packetization with the constraint on the packet length is very similar to the dynamic storage allocation in the operating system. We had thoroughly surveyed the dynamic storage allocation methods used in the recent operating systems and propose to use the allocation methods for the video packetization. We empirically show that the proposed method can reduce the packetization overhead upto 28.3%, compared with the conventional sequential packetization method which have been widely used in Internet video transmission.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.877-878
• /
• 2008

We suggest a feature reduction method to classify mouse function data sets, which integrate several biological data sets represented as high dimensional vectors. To increase classification accuracy and decrease computational overhead, it is important to reduce the dimension of features. To do this, we employed Hybrid Huberized Support Vector Machine with kernels used for a kernel logistic regression method. When compared to support vector machine, this a pproach shows the better accuracy with useful features for each mouse function.

• The Journal of the Korea Contents Association
• /
• v.12 no.6
• /
• pp.48-55
• /
• 2012

The number of digital content used in mobile devices such as smartphones or tablet PCs has been rapidly increasing along with the development of IT industry. At the same time, studies on digital content management are actively conducted. One of the previous studies defined CTI(Content Tracking Information) for efficient management of the information on digital content usage between mobile devices in an area in which the internet is inaccessible, and suggested ways to deal with CTI management, reduction of the overhead and a technique of collecting as many CTIs as possible within a short time. This paper presents the design and implementation of a simulator capable of verifying the logic and the performance of the CTI management method. This tool simulates a mobile environment where devices move around in the internet inaccessible area and propagates digital contents each other. It shows several advantages including the efficient synchronization of CTI management and overhead reduction.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.6
• /
• pp.43-50
• /
• 2000

Design and experiments of a nondestructive testing system with a solenoid eddy current sensor to inspect deterioration of ASCR-OC (ACSR Outdoor Cross-linked Polyethylene Insulated Wires) usually used in HV overhead distribution lines in domestic areas in presented in this paper. Through corrosion mechanisms and deterioration results for ACSR-OC conductors are examined, it is shown that corrosion may lead to the reduction of the effective cross section area of conductors is proposed. The measurement system consisting of a constant current source with a RF frequency, a signal processing unit and a motor driver/ controller is designed and implemented. This instrument has such capabilities as detecting the sensor output and estimating diameter change of the testing conductors, continuously. As a result, it was verified that such corrosion detector system with an eddy current sensor can be shown good effectiveness for estimating the serious faults due to deterioration in overhead distribution lines and giving an early warming before severe aged conductor may lead to fail.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.32-39
• /
• 2006

MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.823-829
• /
• 2011

Recently, wireless body area network (WBAN) has received much attention as an application for the ubiquitous healthcare system. In WBAN, each sensor nodes and a personal base station such as PDA have an energy constraint and computation overhead should be minimized due to node's limited computing power and memory constraint. The reliable data transmission also must be guaranteed because it handles vital signals. In this paper, we propose a systematic network coding scheme for WBAN to reduce the network coding overhead as well as total energy consumption for completion the transmission. We model the proposed scheme using Markov chain. To minimize the total energy consumption for completing the data transmission, we made the problem as a minimization problem and find an optimal solution. Our simulation result shows that large amount of energy reduction is achieved by proposed systematic network coding. Also, the proposed scheme reduces the computational overhead of network coding imposed on each node by simplify the decoding process.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1058-1065
• /
• 2004

Embedded system is widely used in various applications from simple monitor to a set-top box with CPU, memory and hard disk drives. Specially, embedded OS is ported in moveable or small machinery since it ordinarily transmits multimedia data. In this paper, we propose Null copy scheme on the embedded linux system for multimedia service, which can reduce memory copy overhead from user address space to kernel one, and vice versa. Since embedded system for networked multimedia service has low level computing power as well as memory, the Null copy scheme can provide more improved QoS. Our image transmission experiment results on embedded linux target board(CPU utilization an Deadline miss rates) installed a web camera have shown that the proposed scheme can increase fast response and lower CPU overhead.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.1
• /
• pp.15-24
• /
• 2004

'The delay and control overhead during route discovery for destinations outside ad hoc networks are major obstacle to achieving scalability in the Internet. To solve this issue, we propose a novel route discovery scheme equipped with two augmented functions. In this paper, the Internet gateway maintains an address cache of Internet nodes frequently accessed from the ad hoc network and replies with an extended Route Response (RREP) message to the Route Request (RREQ) message based on its routing table and the address cache called EXIT(EXternal node Information Table). These augmented functions make the source node determine the location of the destination as fast as possible. Through simulations, the proposed route discovery scheme using both EXIT and extended RREP message shows considerable' reduction in both route discovery time and control message overhead.