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 13A, Issue 7 - Dec 2006
Volume 13A, Issue 6 - Dec 2006
Volume 13A, Issue 5 - Oct 2006
Volume 13A, Issue 4 - Aug 2006
Volume 13A, Issue 3 - Jun 2006
Volume 13A, Issue 2 - Apr 2006
Volume 13A, Issue 1 - Feb 2006
Selecting the target year
A SoC design and implementation for JPEG 2000 Floating Point Filter
Chang Jong-Kwon ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 185~190
DOI : 10.3745/KIPSTA.2006.13A.3.185
JPEG 2000 is used as an alternative to solve the blocking artifact problem with the existing still image compression JPEG algorithm. However, it has shortcomings such as longer floating point computation time and more complexity in the procedure of enhancing the image compression rate and decompression rate. To compensate for these we implemented with hardware the JPEG 2000 algorithm`s filter part which requires a lot of floating point computation. This DWT Filter chip is designed on the basis of Daubechies 9/7 filter and is composed of 3-stage pipeline system to optimize the performance and chip size. Our implemented Filter was 7 times faster than software based Filter in the floating point computation.
Low-Power Data Cache Architecture and Microarchitecture-level Management Policy for Multimedia Application
Yang Hoon-Mo ; Kim Cheong-Gil ; Park Gi-Ho ; Kim Shin-Dug ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 191~198
DOI : 10.3745/KIPSTA.2006.13A.3.191
Today`s portable electric consumer devices, which are operated by battery, tend to integrate more multimedia processing capabilities. In the multimedia processing devices, multimedia system-on-chips can handle specific algorithms which need intensive processing capabilities and significant power consumption. As a result, the power-efficiency of multimedia processing devices becomes important increasingly. In this paper, we propose a reconfigurable data caching architecture, in which data allocation is constrained by software support, and evaluate its performance and power efficiency. Comparing with conventional cache architectures, power consumption can be reduced significantly, while miss rate of the proposed architecture is very similar to that of the conventional caches. The reduction of power consumption for the reconfigurable data cache architecture shows 33.2%, 53.3%, and 70.4%, when compared with direct-mapped, 2-way, and 4-way caches respectively.
Kernel Hardening by Recovering Kernel Stack Frame in Linux Operating System
Jang Seung-Ju ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 199~204
DOI : 10.3745/KIPSTA.2006.13A.3.199
The kernel hardening function is necessary in terms of kernel stability to reduce the system error or panic due to the kernel code error that is made by program developer. But, the traditional kernel hardening method is difficult to implement and consuming high cost. The suggested kernel hardening function that makes high availability system by changing the panic() function of inside kernel code guarantees normal system operation by recovering the incorrect address of the kernel stack frame. We experimented the kernel hardening function at the network module of the Linux by forcing panic code and confirmed the proposed design mechanism of kernel hardening is working well by this experiment.
A Thread Monitoring System for Java
Moon Se-Won ; Chang Byeong-Mo ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 205~210
DOI : 10.3745/KIPSTA.2006.13A.3.205
To assist developing robust multithreaded software, we develop a thread monitoring system for multithreaded Java programs, which can trace or monitor running threads and synchronization. We design a monitoring system which has options to select interesting threads and synchronizations. Using this tool, programmers can monitor only interesting threads and synchronization in more details by selecting options. It also provides profile information after execution, which summarizes behavior of running threads and synchronizations during execution. We implement the system based on code inlining, and presents some experimental results.
The Streaming Method using Multiple Description Coding for cluster-based server with shared-nothing storage
Bak Yu-Hyeon ; Kim Hag-Young ; Kim Myung-Joon ; Kim Kyong-Sok ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 211~222
DOI : 10.3745/KIPSTA.2006.13A.3.211
The cluster system with shared-nothing storage cannot escape from the problem of skewed request toward specific contents. This paper, therefore, suggests streaming method using MDC (Multiple Description Coding) instead of using single original content; this method is able to cope with skewed request in shared-nothing storage server as well as to continue to provide services in case of the system failure. Also, the system can support adaptive streaming service according to user player type, network status, the load of server, and client.
A Dynamic Map Partition for Load Balancing of MMORPG based on Virtual Area Information
Kim Beob-Kyun ; An Dong-Un ; Chung Seung-Jong ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 223~230
DOI : 10.3745/KIPSTA.2006.13A.3.223
A MMORPG(Massively Multiplayer Online Role-Playing Game) is an online role-playing game in which a large number of players can interact with each other in the same world at the same time. Most of them require significant hardware requirements(e.g., servers and bandwidth), and dedicated support staff. Despite the efforts of developers, users often cite overpopulation, lag, and poor support as problems of games. In this paper, a dynamic load balancing method for MMORPGS is proposed. It tries to adapt to dynamic change of population by using dynamic map-partition method with VML(Virtual Map Layer) which consists of fields, sector groups, sectors, and cells. From the experimental results, our approach achieves about
lower loads for each field server. By the modification to Virtual Area Layer, we can easily manage problems that come from changes of map data, resources` status, and users` behavior pattern.
A Consolidated Wireless Internet Proxy Server Cluster Architecture
Kwak Hu-Keun ; Chung Kyu-Sik ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 231~240
DOI : 10.3745/KIPSTA.2006.13A.3.231
In this paper, wireless internet proxy server clusters are used for the wireless internet because their caching, distillation, and clustering functions are helpful to overcome the limitations and needs of the wireless internet. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the CD-A structure which can be scalable in a systematic way but it also has disadvantages; its communication structure among modules is partly complex. In this paper, we proposed a consolidated scheme which has a systematic scalability and an efficient communication structure among modules. We performed experiments using 16 PCs and experimental results show 196% and 40% performance improvement of the proposed system compared to the TranSend and the CD-A system, respectively.
HA-PVFS : A PVFS File System supporting High Data Availability Adaptive to Temporal Locality
Sim Sang-Man ; Han Sae-Young ; Park Sung-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 241~252
DOI : 10.3745/KIPSTA.2006.13A.3.241
In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.
A Hamiltonian Property of Pyramid Graphs
Chang Jung-Hwan ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 253~260
DOI : 10.3745/KIPSTA.2006.13A.3.253
In this paper, we analyze the Hamiltonian property of Pyramid graphs. We prove that it is always possible to construct a Hamiltonian cycle of length
by applying the proposed algorithm to construct series of cycle expansion operations into two adjacent cycles in the Pyramid graph of height N.
Insertion/Deletion algorithms on M-heap with an array representation
Jung Hae-Jae ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 261~266
DOI : 10.3745/KIPSTA.2006.13A.3.261
Priority queues can be used in applications such as scheduling, sorting, and shortest path network problem. Fibonacci heap, pairing heap, and M-heap are priority queues based on pointers. This paper proposes a modified M-heap with an way representation, called MA-heap, that resolves the problem mentioned in . The MA-heap takes O(1) amortized time and O(logn) time to insert an element and delete the max/min element, respectively. These time complexities are the same as those of the M-heap. In addition, it is much easier to implement an MA-heap than a heap proposed in  since it is based on the simple traditional heap.
Volume Modeling of Scattered Data based on Weighted Alpha Shapes
Paik Jung-Min ; Lee Kun ;
The KIPS Transactions:PartA, volume 13A, issue 3, 2006, Pages 267~274
DOI : 10.3745/KIPSTA.2006.13A.3.267
This paper describes a method to achieve different level of detail for the given volumetric data by assigning weight for the given data points. The relation between wavelet transformation and alpha shape was investigated to define the different level of resolution. Scattered data are defined as a collection of data that have little specified connectivity between data points. The quality of interpolant in volumetric trivariate space depends not only on the distribution of the data points in
, but also on the data value (intensity). We can improve the quality of an approximation by using wavelet coefficient as weight for the corresponding data points.