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 16A, Issue 6 - Dec 2009
Volume 16A, Issue 5 - Oct 2009
Volume 16A, Issue 4 - Aug 2009
Volume 16A, Issue 3 - Jun 2009
Volume 16A, Issue 2 - Apr 2009
Volume 16A, Issue 1 - Feb 2009
Selecting the target year
A Transparent Monitor Based on JDI for Scalable Race Detection of Concurrent Java Programs
Kim, Young-Joo ; Kuh, In-Bon ; Bae, Byoung-Jin ; Jun, Yong-Kee ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 55~60
DOI : 10.3745/KIPSTA.2009.16-A.2.55
Race conditions in current Java programs must be detected because it may cause unexpected result by non-deterministic executions. For detecting such races during program execution, execution flows of all threads and all access events can be monitored. It is difficult for previous race detection techniques to monitor all threads and access events in actuality because these techniques analyze the files traced during program execution or modify original source programs and then monitor these programs. This paper presents a transparent scalable monitoring tool to detect races using JDI(Java Debug Interface) where JDI is 100% pure java interface to provide in JDPA(Java Platform Debugger Architecture) and is able to provide information corresponding to events occurred in run-time of programs. This tool thus can monitor execution flows of all threads and all access events without program modification. We prove transparency of the presented tool and grasp the efficiency of it using a set of published benchmark programs. As a result of this, the suggested tool can monitor all threads and accesses of these programs without their modification, and their monitoring time is increased to more than 20 times.
Fast and Rigid 3D Shape Deformation Based on Moving Least Squares
Lee, Jung ; Kim, Chang-Hun ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 61~68
DOI : 10.3745/KIPSTA.2009.16-A.2.61
We present a fast 3D shape deformation method that achieves smoothly deformed result by approximating a rigid transformation based on moving least squares (MLS). Our modified MLS formulation reduces the computation cost for computing the optimal transformation of each point and still keeps the rigidity of the deformed results. Even complex geometric shapes are easily, intuitively, and interactively deformed by manipulating point and ellipsoidal handles.
Data Cache System based on the Selective Bank Algorithm for Embedded System
Jung, Bo-Sung ; Lee, Jung-Hoon ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 69~78
DOI : 10.3745/KIPSTA.2009.16-A.2.69
One of the most effective way to improve cache performance is to exploit both temporal and spatial locality given by any program executive characteristics. In this paper we present a high performance and low power cache structure with a bank selection mechanism that enhances exploitation of spatial and temporal locality. The proposed cache system consists of two parts, i.e., a main direct-mapped cache with a small block size and a fully associative buffer with a large block size as a multiple of the small block size. Especially, the main direct-mapped cache is constructed as two banks for low power consumption and stores a small block which is selected from fully associative buffer by the proposed bank selection algorithm. By using the bank selection algorithm and three state bits, We selectively extend the lifetime of those small blocks with high temporal locality by storing them in the main direct-mapped caches. This approach effectively reduces conflict misses and cache pollution at the same time. According to the simulation results, the average miss ratio, compared with the Victim and STAS caches with the same size, is improved by about 23% and 32% for Mibench applications respectively. The average memory access time is reduced by about 14% and 18% compared with the he victim and STAS caches respectively. It is also shown that energy consumption of the proposed cache is around 10% lower than other cache systems that we examine.
Development of Continuous Capture Test Architecture in the Boundary Scan
Jhang, Young-Sig ; Lee, Chang-Hee ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 79~88
DOI : 10.3745/KIPSTA.2009.16-A.2.79
In boundary scan architecture, test stimuli are shifted in one at a time and applied to the on-chip system logic. The test results are captured into the BSR and are examined by subsequent shifting. In this paper, we developed a continuous capture test architecture and test procedure using TPG based on boundary scan is used to performance test. In this architecture, test patterns of TPG are applied to CUT with system clock rate, and response of CUT is continuously captured by CBSR(Continuous Capture Boundary Scan Register) at the same rate and the captured results is shifted to TDO at the same rate. The suggested a continuous capture test architecture and test procedure is simulated by Altera Max+Plus 10.0. The simulation results shows the accurate operation and effectiveness of the proposed test architecture and procedure.
A Fast Writing Technique of Large-sized Edited Multimedia Files based on the Ext3 File System
Jung, Seung-Wan ; Nam, Young-Jin ; Seo, Dae-Wha ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 89~100
DOI : 10.3745/KIPSTA.2009.16-A.2.89
With the advance in digital technologies and the increasing prevalence of high quality multimedia contents, there is a growing user demand for multimedia devices, such as mobile phones, digital TV, PMP, digital camcoders, digital cameras. Such devices provide various services associated with multimedia file manipulation, including multimedia contents playback, multimedia file editing, etc. Conventional file systems exhibit a performance-related drawback that requires considerable amount of time and disk I/Os in order to store large-sized edited multimedia files. This paper proposes a fast, efficient writing technique for large-sized edited multimedia files by using data block sharing with adjustment of inode block pointers. Our experiments show that the proposed scheme not only improves write performance of the Ext3 file system on average by 16 times with various types of edited multimedia files, but also reduces consumed disk space dramatically through the data block sharing.
Design and Implementation of Autonomic De-fragmentation for File System Aging
Lee, Jun-Seok ; Park, Hyun-Chan ; Yoo, Chuck ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 101~112
DOI : 10.3745/KIPSTA.2009.16-A.2.101
Existing techniques for defragmentation of the file system need intensive disk operation for some periods at specific time such as disk defragmentation program. In this paper, for solving this problem, we design and implement the automatic and continuous defragmentation free system by distributing the disk operation. We propose the Automatic Layout Scoring(ALS) mechanism for measuring defragmentation degree and suggest the Lazy Copy mechanism that copies the defragmented data at idle time for scattering the disk operation. We search the defragmented file by Automatic Layout Scoring mechanism and then find for empty spaces for that searched file. After lazy copy of searched fils to empty space for preventing that file from being lost, the algorithm solves the defragmentation problem by updating the I-node of that file. We implement these algorithms in Linux and evaluate them for small and defragmented file to get the layout scoring. We outperform the Linux EXT2 file system by
in layout scoring evaluation. And the performance of read and write for various file size is better than the EXT2 by
for write performance and by
for read performance. We suggest this system for solving the problem of defragmentation automatically without disturbing the I/O task and manual management.
A Performance Improvement of Linux TCP/IP Stack based on Flow-Level Parallelism in a Multi-Core System
Kwon, Hui-Ung ; Jung, Hyung-Jin ; Kwak, Hu-Keun ; Kim, Young-Jong ; Chung, Kyu-Sik ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 113~124
DOI : 10.3745/KIPSTA.2009.16-A.2.113
With increasing multicore system, much effort has been put on the performance improvement of its application. Because multicore system has multiple processing devices in one system, its processing power increases compared to the single core system. However in many cases the advantages of multicore can not be exploited fully because the existing software and hardware were designed to be suitable for single core. When the existing software runs on multicore, its performance improvement is limited by the bottleneck of sharing resources and the inefficient use of cache memory on multicore. Therefore, according as the number of core increases, it doesn`t show performance improvement and shows performance drop in the worst case. In this paper we propose a method of performance improvement of multicore system by applying Flow-Level Parallelism to the existing TCP/IP network application and operating system. The proposed method sets up the execution environment so that each core unit operates independently as much as possible in network application, TCP/IP stack on operating system, device driver, and network interface. Moreover it distributes network traffics to each core unit through L2 switch. The proposed method allows to minimize the sharing of application data, data structure, socket, device driver, and network interface between each core. Also it allows to minimize the competition among cores to take resources and increase the hit ratio of cache. We implemented the proposed methods with 8 core system and performed experiment. Experimental results show that network access speed and bandwidth increase linearly according to the number of core.
A System for Change Management of Sensor Network Applications based on Version Synchronization
Kim, Jae-Cheol ; Kim, Ju-Il ; Chong, Ki-Won ; Lee, Woo-Jin ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 125~134
DOI : 10.3745/KIPSTA.2009.16-A.2.125
This paper proposes a change management system of sensor network applications based on version synchronization that supports to effectively manage defect correction of applications, change of functions for applications or improvement of applications without suspending the sensor network. The proposed change management system consists of the NADE which is an application development environment, the Node Management Server, and the Node Agent. NADE is an Eclipse-based development environment for developing applications which are installed into nodes. NADE is also connected with CVSNT which is a version management tool and performs application version management using the CVSNT. Node Management Server manages nodes to maintain latest versions of applications by synchronizing versions of applications which are performed on the nodes with the versions of applications which are developed in the NADE. Node Agent which is loaded into the node periodically sends the version information of the application to the server, and stores and updates the version information of the application. Through the proposed change management system, applications of nodes are automatically updated when versions of applications are changed by correcting defects, changing functions or improving applications. Therefore, the user can effectively manage the execution of sensor network system without suspending or delaying the sensor network. Also, visibility of change management for sensor network applications will be improved.
An Integrated Context Generation Scheme based on Ant Colony System
Kang, Dong-Hyun ; Jang, Hyun-Su ; Song, Chang-Hwan ; Eom, Young-Ik ;
The KIPS Transactions:PartA, volume 16A, issue 2, 2009, Pages 135~142
DOI : 10.3745/KIPSTA.2009.16-A.2.135
With the development of ubiquitous computing technology, the number of HCI applications is increasing, where they utilize various contexts to provide adaptive services to users according to the change of contexts, and also, technologies for collecting various sensor data and generating integrated contexts get more important. However, the research on the collection and integration of multi-sensor data is not sufficient when we consider the various utilization areas of the integrated contexts. In particular, they have some problems to be solved such as duplication of the context data and the high system load. In this paper, we propose an integrated context generation scheme based on Ant Colony System. Proposed scheme generates the context data as a form of XML and avoids the generation of unnecessary context information by detecting the repeated sensor information based on the ant colony system. As a result of detections, we reduce wasted resources and repositories when the integrated context is created. We also reduce the overhead for reasoning.