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 11A, Issue 7 - Dec 2004
Volume 11A, Issue 6 - Oct 2004
Volume 11A, Issue 5 - Oct 2004
Volume 11A, Issue 4 - Aug 2004
Volume 11A, Issue 3 - Jun 2004
Volume 11A, Issue 2 - Apr 2004
Volume 11A, Issue 1 - Feb 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
Hardware/Software Partitioning Methodology for Reconfigurable System
Kim, Jun-Yong ; Ahn, Seong-Yong ; Lee, Jeong-A. ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 303~312
DOI : 10.3745/KIPSTA.2004.11A.5.303
In this paper, we propose a methodology solving the problem of the hardware-software partitioning in reconfigurable systems using a Y-chart design space exploration and implement a simulator according to the methodology. The methodology generates a mapping set between tasks and hardware elements using the hardware element model and the application model. We evaluate the throughput by simulating cases in each mapping set. With the throughput evaluation result, we can select the mapping case with the highest throughput. We also propose an heuristic improving the simulation time by reducing the mapping set on the basis of the relationship between workload and parallelism. Simulation results show that we can reduce the size of mapping set which poses difficulties on hardware-software partitioning by up to 80%.
A Checkpoint and Recovery Facility for the Fault-Tolerant Process on Linux Environment
Rim Seong-Rak ; Kim Sin-Ho ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 313~318
DOI : 10.3745/KIPSTA.2004.11A.5.313
In this paper, we suggest a checkpoint and recovery facility for the fault-tolerable process which is expected to be executed for a long time. The basic concept of the suggested facility is to allow the process to be executed continuously, when the process was stopped due to a System fault, by storing the execution status of the process periodically and recovering the execution status prior to the fault was occurred. In the suggested facility, it does not need to modify the source code for the fault-tolerable process. It was designed for the user to specify directly the file name and the checkpoint frequency, and two system calls(save, recover) were added. finally, it was implemented on the Linux environment(kernel 2.4.18) for checking the feasibility.
Visualized Execution Analyzer for the Java Class File
Ko, Kwang-Man ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 319~324
DOI : 10.3745/KIPSTA.2004.11A.5.319
The Java language is rapidly being adopted in the Internet. The distributed applications and their application range are being expanded beyond just a programing language and developed Into software applications. A variety of researches are going on with regard to the Java Virtual Machine runtime environment and methods of analyzing the Java class files and utilizing the information for applications. A class file is a converted file that is executable by the Java virtual machine. Analysis on the class file structure and the runtime processes will be convenient in arranging the decompilers and debugging the source programs. This paper is about the runtime process analyzer that presents the runtime processes, including class files, more visually. The content of a class file will be easily accessed and expressed as in a graphic user interface. The information in the class file displayed is divided into Constant_Pool, Class_file, Interface, Field, Method and Attribute with information on method area, operand stack and local variables expressed visually.
Multi-Source Media Streaming based Contents Distribution in P2P Network Environment
Lee, Sung-Yong ; So, Yang-Seon ; Lee, Jae-Gil ; Choi, Chang-Yeol ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 325~332
DOI : 10.3745/KIPSTA.2004.11A.5.325
For a P2P network, the contents distribution is a very important service because the contents provider is not fixed. And in the P2P media streaming, a request peer replays and saves media data simultaneously, and after streaming it acts as a new source peer providing media files to other peers. Therefore streaming and file saying operations should be simultaneously carried out in order to distribute contents through the P2P network. In this paper, a P2P multi-source media streaming system which can replay the contents data during downloading is proposed and implemented. The system reduces the user response time and the number of simultaneous user increases more than two times. Moreover, transmitting a part of media file makes fast distribution and diffusion of contents possible.
A Parallel IP Address Lookup Scheme for High-Speed Routers
Park, Jae-hyung ; Chung, Min-Young ; Kim, Jin-soo ; Won, Yong-gwan ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 333~340
DOI : 10.3745/KIPSTA.2004.11A.5.333
In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet`s destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts
Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network
Kim Jong-Seok ; Oh Eun-seuk ; Lee Hyeong-Ok ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 341~346
DOI : 10.3745/KIPSTA.2004.11A.5.341
Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.
An Efficient Location Tracking Method for Mobile Agent Communication
Song, Sang-Hoon ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 347~354
DOI : 10.3745/KIPSTA.2004.11A.5.347
The provision of location tracking for mobile agents is designed to deliver a message to a moving object in a network. Most tracking methods exploit relay stations that hold location information to forward messages to a target mobile agent. In this paper, we propose an efficient location tracking method for mobile agents using the domain-based proxy as a relay station. Mobile agents can reduce the length of their migration paths by visiting hosts in the same domain first, rather than selecting hosts randomly. The proposed method exploits the domain-based moving patterns of mobile agents and minimizes registration and message delivery costs. Since the long proxy chain can contribute to the high message delivery cost, we also propose a compressing method to reduce the message delivery cost.
High-Availability Web Server Cluster Employing Multiple Front-Ends for Small and Middle-sized Web Sites
Moon Jong-bae ; Kim Myung-ho ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 355~364
DOI : 10.3745/KIPSTA.2004.11A.5.355
These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.
Enhanced Mesh Simplification using Extended Quadric Error Metric
Han Tae-hwa ; Chun Jun-chul ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 365~372
DOI : 10.3745/KIPSTA.2004.11A.5.365
Recently, the studies for mesh simplification have been increased according to the application area of the complicate 3D mesh models has been expanded. This paper introduces a novel method for mesh simplification which uses the properties of the mesh model in addition to the geometric locations of the model. The information of the 3D mesh model Includes surface properties such as color, texture, and curvature information as well as geometic information of the model. The most of current simplification methods adopt such geometric information and surface properties individually for mesh simplification. However, the proposed simplification method combines the geometric information and solace properties and applies them to the simplification process simultaneously. In this paper, we exploit the extended geometry based quadric error metric(QEM) which relatively allows fast and accurate geometric simplification of mesh. Thus, the proposed mesh simplification utilizes the quadric error metric based on geometric information and the surface properties such as color, normal, and texture. The proposed mesh simplification method can be expressed as a simple quadric equation which expands the quadric error metric based on geometric information by adding surface properties such as color, normal, and texture. From the experimental results, the simplification of the mesh model based on the proposed method shows the high fidelity to original model in some respects such as global appearance rather than using current geometry based simplification.
Performance Enhancement of Embedded Software Using Register Promotion
Lee Jong-Yeol ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 373~382
DOI : 10.3745/KIPSTA.2004.11A.5.373
In this paper, a register promotion technique that translates memory accesses to register accesses is presented to enhance embedded software performance. In the proposed method, a source code is profiled to generate a memory trace. From the profiling results, target functions with high dynamic call counts are selected, and the proposed register promotion technique is applied only to the target functions to save the compilation time. The memory trace of the target functions is searched for the memory accesses that result in cycle count reduction when replaced by register accesses, and they are translated to register accesses by modifying the intermediate code and allocating promotion registers. The experiments on MediaBench and DSPstone benchmark programs show that the proposed method increases the performance by 14% and 18% on the average for ARM and MCORE, respectively.
Facial Expression Control of 3D Avatar using Motion Data
Kim Sung-Ho ; Jung Moon-Ryul ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 383~390
DOI : 10.3745/KIPSTA.2004.11A.5.383
This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.
Multimodal Brain Image Registration based on Surface Distance and Surface Curvature Optimization
Park Ji-Young ; Choi Yoo-Joo ; Kim Min-Jeong ; Tae Woo-Suk ; Hong Seung-Bong ; Kim Myoung-Hee ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 391~400
DOI : 10.3745/KIPSTA.2004.11A.5.391
Within multimodal medical image registration techniques, which correlate different images and Provide integrated information, surface registration methods generally minimize the surface distance between two modalities. However, the features of two modalities acquired from one subject are similar. So, it can improve the accuracy of registration result to match two images based on optimization of both surface distance and shape feature. This research proposes a registration method which optimizes surface distance and surface curvature of two brain modalities. The registration process has two steps. First, surface information is extracted from the reference images and the test images. Next, the optimization process is performed. In the former step, the surface boundaries of regions of interest are extracted from the two modalities. And for the boundary of reference volume image, distance map and curvature map are generated. In the optimization step, a transformation minimizing both surface distance and surface curvature difference is determined by a cost function referring to the distance map and curvature map. The applying of the result transformation makes test volume be registered to reference volume. The suggested cost function makes possible a more robust and accurate registration result than that of the cost function using the surface distance only. Also, this research provides an efficient means for image analysis through volume visualization of the registration result.
On the Average Case Errors of Numerical Integration Rules using Interpolation
Choi, Sung-Hee ; Hwang, Suk-Hyung ; Lee, Jeong-Bae ; Hong, Bum-Il ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 401~406
DOI : 10.3745/KIPSTA.2004.11A.5.401
Among many algorithms for the integration problems in which one wants to compute the approximation to the definite integral in the average case setting, we study the average case errors of numerical integration rules using interpolation. In particular, we choose the composite Newton-Cotes quadratures and the function values at equally spaced sample points on the given interval as information. We compute the average case error of composite Newton-Cotes quadratures and show that it is minimal(modulo a multiplicative constant).
An e-Learning System using a Combined Multimedia Content
Na, Yun-Ji ; Ko, Il-Seok ; Cho, Dong-Uk ; Yoon, Chui-Yung ;
The KIPS Transactions:PartA, volume 11A, issue 5, 2004, Pages 407~412
DOI : 10.3745/KIPSTA.2004.11A.5.407
The e-learning system uses multimedia content for efficiency of a education and learner`s convenience. With the web based e-learning, various multimedia services are difficult on account of physical factors such as network state and system performance. Also on the off line based e-learning, we have defects an insufficiency of interactions among learners and instructors, and an insufficiency of an adaptation about the latest information. In this study, we designed a multi-tier e-learning system using hybrid multimedia method, The proposed system can provide interaction and adaptability such as web based systems, and it can provide various multimedia content such as off line based systems. In experiments results, we know the proposed system improved users` convenience and an adaptability about the latest information, and interactions among learners and instructors when compare with existing e-learning system.