• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.64-71
• /
• 2010

Recently, to achieve high performance of the processor, the cache is splits physically into two parts, one for instruction and one for data. This paper proposes an architecture of asynchronous instruction cache based on mixed-delay model that are DI(delay-insensitive) model for cache hit and Bundled delay model for cache miss. We synthesized the instruction cache at gate-level and constructed a test platform with 32-bit embedded processor EISC to evaluate performance. The cache communicates with the main memory and CPU using 4-phase hand-shake protocol. It has a 8-KB, 4-way set associative memory that employs Pseudo-LRU replacement algorithm. As the results, the designed cache shows 99% cache hit ratio and reduced latency to 68% tested on the platform with MI bench mark programs.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.201-214
• /
• 2014

In this paper, we propose a test case generation method adequate to destructive test of the BLDC(Brush Less Direct Current) motor controller used for the MDPS(Motor Driven Power Steering) system embedded in an automobile. The proposed method is a modified CTM(Classification Tree Method). CTM generates test cases assuming that all inputs are equally important. Therefore, it is very hard to generate test cases for extreme situations. To overcome the drawback and generate test cases specialized for destructive test. a modified CTM that compensates the limitation of traditional CTM is proposed. The proposed method has an advantage that it can intensively generate the test scenarios adequate to extreme situations by combining the test cases generated by the transitional CTM the while keeping the merit of the traditional CTM. The test scenarios for destructive test for the MDPS system embedded in a commercial automobile are generated utilizing the proposed method. The effectiveness of the proposed algorithm is verified through the test.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.127-130
• /
• 2005

Internal cities such as gray level been enclosed to building forest are paying a lot of efforts and expenses to change to green city that park and street tree get put together. By the example, 'GREEN CITY of PUSAN 21' progress to decorate army facilities like the park, and to plant street trees in several places of city plan in Pusan. And urban environment that big cities of advanced nation are agreeable is making in the large park and road street trees at several places in downtown. Because price of tree for the park is very expensive, tree management system was all-important. In this paper, Motes deliver the sensor information in each tree through radio sensor network by server side. This information can use in state grasping of tree, harmful insects courtesy call etc and this system design was suggested to inform to mode of life administration scholars.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1851-1856
• /
• 2013

An XML is widely used for web services, such as SOAP(Simple Object Access Protocol) and REST (Representational State Transfer), and also de facto standard for representing data. Since the XML parser using DOM(Document Object Model) requires a preprocessing task creating a DOM-tree, and then storing it into memory, embedded systems with limited resources typically employ a streaming XML parser without preprocessing. In this paper, we propose a new architecture for the streaming XML parser using an APSearch(Adaptive Parallel Search) on FPGA(Field Programmable Gate Array). Compared to other approaches, the proposed APSearch parser dramatically reduces overhead on the software side and achieves about 2.55 and 2.96 times improvement in the time needed for an XML parsing. Therefore, our APSearch parser is suitable for systems to speed up XML parsing.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.48-62
• /
• 2006

In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.13-25
• /
• 2005

In these days, there are various uses of Linux such as small embedded systems, routers, and huge servers, because Linux gives several advantages to system developers by allowing to use the open source code of the Linux kernel. On the other hand, the open source nature of the Linux kernel gives a bad influence on system security. If someone wants to exploit Linux-based systems, the attacker can easily do it by finding vulnerabilities of their Linux kernel sources. There are many kinds of existing methods for lading source-level vulnerabilities of softwares, but they are not suitable for finding source-level vulnerabilities of the Linux kernel which has an enormous amount of source code. In this paper, we propose the Onion mechanism as a methodology of finding source-level vulnerabilities of Linux kernel variables. The Onion mechanism is made up of two steps. The Int step is to select variables that may be vulnerable by using pattern matching mechanism and the second step is to inspect vulnerability of each selected variable by constructing and analyzing the system call trees. We also evaluate our proposed methodology by applying it to two well-known source-level vulnerabilities.