Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartA
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 12A, Issue 7 - Dec 2005
Volume 12A, Issue 6 - Dec 2005
Volume 12A, Issue 5 - Oct 2005
Volume 12A, Issue 4 - Aug 2005
Volume 12A, Issue 3 - Jun 2005
Volume 12A, Issue 2 - Apr 2005
Volume 12A, Issue 1 - Feb 2005
Selecting the target year
Automatic Verification of the Control Flow Model for Effective Embedded Software Design
Park, Sa-Choun ; Kwon, Gi-Hwon ; Ha, Soon-Hoi ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 563~570
DOI : 10.3745/KIPSTA.2005.12A.7.563
Hardware and software codesign framework called PeaCE(Ptolemy extension as a Cod sign Environment) allows to express both data flow and control flow. To formally verify an fFSM specification which expresses control flow in PeaCE, the step semantics of the model was defined. In this paper, we introduce the automatic verification tool developed by formal semantics of previous work. This tool uses the SMV as inner model checker md, through our tool, users can formally verify some important bugs such as race condition, ambiguous transition, and circulartransition without directly writing logical formulae.
RFFS : Design of a Reliable NAND Flash File System for Embedded system
Lee Tae-hoon ; Park Song-hwa ; Kim Tae-hoon ; Lee Sang-gi ; Lee Joo-Kyong ; Chung Ki-Dong ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 571~582
DOI : 10.3745/KIPSTA.2005.12A.7.571
NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that dose not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read and write operations is a page. A NAND flash file system called YAFFS has been proposed. But YAFFS has several problems to be addressed. In this paper, the Reliable Flash File System(RFFS) for NAND flash memory is designed and evaluated. In designing a file system the following four issues must be considered in particular for the design: (i) to minimize a repairing time when the system fault occurs, (ii) to balance the number of block erase operations by offering wear leveling policy, and (iii) to reduce turnaround time of memory operations by reducing the amount of data written. We demonstrate and evaluate the performance of the proposed schemes.
Implementation of a Real-Time Tracing Tool for Remote Debugging of SoC Programs
Park Myeong-Chul ; Kim Young-Joo ; Ha Seok-wun ; Jun Yong-Kee ; Lim Chae-Deok ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 583~588
DOI : 10.3745/KIPSTA.2005.12A.7.583
To develop SoC program for embedded systems, a tool that can remotely debug from host system is needed. Because the existing remote debugging systems using GDB don`t offer information of the SoC program execution in real-time, it is difficult to observe condition of the program execution, and also they have limited characteristics to tools and use costly adaptors. In this paper, a real-time tracking tool that can record SoC status on the nv each execution of the assigned instructions is introduced and an economical USB-JTAG adaptor is proposed. And it is shown that this tool can track the execution of a composed program in the target system based on PXA255 processor.
Applying Practice Patterns to Improve Source Code Quality of Embedded Software
Hong Jang-Eui ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 589~596
DOI : 10.3745/KIPSTA.2005.12A.7.589
Source code quality is very Important that software embedded into product is difficult to change. In order to improve source code quality, it should be considered the quality of analysis and design models as well as the quality of source code. In this paper, we suggest `Practice Pattern` as one of practical techniques to improve embedded software source code quality. Practice pattern is a procedural pattern to guide modeling and coding activities in software development phases. We believe that applying our pattern provides the improvement of optimum performance, modularization, and portability for embedded software source code.
The Implementation of Stmart Phone Edition based on Embedded Linux
Kim Do-Hyung ; Yun Min-Hong ; Kim Sun-Ja ; Lee Cheol-Hoon ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 597~604
DOI : 10.3745/KIPSTA.2005.12A.7.597
The paper describes implementation of smartphone edition based on embedded Linux, which is composed of smartphone middleware and basic applications. Existing smartphone platforms entails loyalty expenses and has difficulties on customization due to the closed policy of their source codes. Although GPE - based on embedded Linux has solved the loyalty issues, other problems are remained unsolved. Since GPE has been designed for relatively large PDA-level devices, applications are generally inoperable under the condition of small LCD size and input methods without touch-screen; the condition is typical limitations of the smartphones. In the implemented smartphone edition of the paper no loyalty is required, because the smartphone edition is based on embedded Linux. It also supports keypad-only operating functionality such as moving between folders or running applications with operations. Besides, it provides more user-friendly environment to use the smartphone editionscreen interfaces and indicatorsto those of the regular cellular phones.
Token-Bucket-based Performance Control Techniques for Large-Scale Shared Storage Systems
Nam Young-Jin ; Park Chan-Ik ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 605~612
DOI : 10.3745/KIPSTA.2005.12A.7.605
With the increase in I/O performance and capacity, it becomes commonplace that storage systems are shared by multiple storage users. This paper proposes an efficient token-bucket-based performance control technique for the shared storage that can statistically guarantee demanded storage performance from different users. It also verifies the operational characteristics and performance of the proposed scheme under various types of I/O workloads.
A Performance Isolation Mechanism Considering SLA in High Available Heterogeneous Cluster Web Systems
Kang, Chang-Hoon ; Park, Kie-Jin ; Kim, Sung-Soo ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 613~620
DOI : 10.3745/KIPSTA.2005.12A.7.613
To provide reliable differentiated service for internet clients, many studies on differentiated service are widely done. According to the types of the request of the clients in cluster-based web systems, SLA (Service Level Agreement) between service provider and the clients is considered. In this Paper, we study primary-backup web switch in the web systems that distribute the request of clients to each of web servers and also study performance isolation and admission control schemes of heterogeneous web systems which distinguish the servers into each different function domains. We analyze the availability, the response time and the performance of admission control through various simulated experiments on the proposed web systems.
An Efficient System Software of Flash Translation Layer for Large Block Flash Memory
Chung Tae-Sun ; Park Dong-Joo ; Cho Sehyeong ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 621~626
DOI : 10.3745/KIPSTA.2005.12A.7.621
Recently, flash memory is widely used in various embedded applications since it has many advantages in terms of non-volatility, fast access speed, shock resistance, and low power consumption. However, it requires a software layer called FTL(Flash Translation Layer) due to its hardware characteristics. We present a new FTL algorithm named LSTAFF(Large State Transition Applied Fast flash Translation Layer) which is designed for large block flash memory The presented LSTAFF is adjusted to flash memory with pages which are larger than operating system data sector sizes and we provide performance results based on our implementation of LSTAFF and previous FTL algorithms using a flash simulator.
Utilizing Channel Bonding-based M-n and Interval Cache on a Distributed VOD Server
Chung, Sang-Hwa ; Oh, Soo-Cheol ; Yoon, Won-Ju ; kim, Hyun-Pil ; Choi, Young-In ;
The KIPS Transactions:PartA, volume 12A, issue 7, 2005, Pages 627~636
DOI : 10.3745/KIPSTA.2005.12A.7.627
This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of
compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.