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
WGridSP: A Web-based Scheduling Platform for Grid Computing
Kang, Oh-Han ; Kang, Sang-Seong ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 381~386
DOI : 10.3745/KIPSTA.2006.13A.5.381
In this paper, we designed and implemented a web-based grid scheduling platform(WGridSP), which can model a system and simulate scheduling scheme in grid computing. WGridSP used GridSim, a grid scheduling toolkit in java-environment, as a tool for simulation and is able to Perform resource modeling, task modeling, algorithm compiling, simulation, and Performance evaluation rapidly in web environment. WGridSP can be applied as a foundation for grid research and can be used to analyze the efficiency of scheduling algorithm.
A Study of Purity-based Page Allocation Scheme for Flash Memory File Systems
Baek, Seung-Jae ; Choi, Jong-Moo ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 387~398
DOI : 10.3745/KIPSTA.2006.13A.5.387
In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of Purity, which is defined as the fraction of blocks where valid Pages and invalid Pages are coexisted. The Pity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases
A Visualization System for Permission Check in Java using Static Analysis
Kim, Yun-Kyung ; Chang, Byeong-Mo ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 399~404
DOI : 10.3745/KIPSTA.2006.13A.5.399
In Jana 2, to enforce a suity policy of a program, programmer writes permission sets required by the code at the policy file, sets Security Manager on system and executes the program. Then Security Manager checks by stack inspection whether an access request to resource should be granted or denied whenever code tries to access critical resource. In this paper, we develop a visualization tool which helps programmers enforce security policy effectively into programs. This system is based on the static permission check analysis which analyzes permission checks which must succeed or fail at each method. Based on this analysis information, programmer can examine visually how permission checks and their stack inspection are performed. By modifying program or policy file if necessary and examining analysis information repeatedly, programmer can enforce security policy correctly.
Design and Implementation of a Protocol for Solving Priority Inversion Problems in Real-time OS
Kang, Seong-Goo ; Gyeong, Gye-Hyeon ; Ko, Kwang-Sun ; Eom, Young-Ik ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 405~412
DOI : 10.3745/KIPSTA.2006.13A.5.405
Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.
Run-time Memory Optimization Algorithm for the DDMB Architecture
Cho, Jeong-Hun ; Paek, Yun-Heung ; Kwon, Soo-Hyun ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 413~420
DOI : 10.3745/KIPSTA.2006.13A.5.413
Most vendors of digital signal processors (DSPs) support a Harvard architecture, which has two or more memory buses, one for program and one or more for data and allow the processor to access multiple words of data from memory in a single instruction cycle. We already addressed how to efficiently assign data to multi-memory banks in our previous work. This paper reports on our recent attempt to optimize run-time memory. The run-time environment for dual data memory banks (DBMBs) requires two run-time stacks to control activation records located in two memory banks corresponding to calling procedures. However, activation records of two memory banks for a procedure are able to have different size. As a consequence, dual run-time stacks can be unbalanced whenever a procedure is called. This unbalance between two memory banks causes that usage of one memory bank can exceed the extent of on-chip memory area although there is free area in the other memory bank. We attempt balancing dual run-time slacks to enhance efficiently utilization of on-chip memory in this paper. The experimental results have revealed that although our algorithm is relatively quite simple, it still can utilize run-time memories efficiently; thus enabling our compiler to run extremely fast, yet minimizing the usage of un-time memory in the target code.
A Time-Redundant Recovery Scheme of TMR failures Using Retry and Rollback Techniques
Kang, Myung-Seok ; Son, Byoung-Hee ; Kim, Hag-Bae ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 421~428
DOI : 10.3745/KIPSTA.2006.13A.5.421
This paper proposes an integrated recovery approach applying retry and rollback techniques to recover the TMR failure. Combining the time redundancy techniques with W system is apparently effective to recover the TMR failure(or masked error) primarily caused by transient faults. These policies need fewer reconfigurations at the cost of extra time required for the time redundant schemes. The optimal numbers of retry and rollback to minimize the mean execution time of tasks are derived for the proposed method through computing the likelihoods of all possible states of the failed system. The effectiveness of the proposed method is validated through examining certain numerical examples and simulations conducted with a variety of parameters governing environmental characteristics.
Nonlinear Deblurring Algorithm on Convex-Mirror Image for Reducing Occlusion
Lee, In-Jung ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 429~434
DOI : 10.3745/KIPSTA.2006.13A.5.429
A CCTV system reduces some number of cameras if we use convex-mirror. In this case, convex-mirror Image distorted, we need transformation to flat images. In the center of mirror images, a transformed image has no distortion, but at near boundary image has plentiful distortion. This distortion is caused by occlusion of angled ray and diffraction. We know that the linear filtering approach cannot separate noise from signal where their Fourier spectra overlap. But using a non-linear discretization method, we shall reduce blurred noise. In this paper, we introduce the backward solution of nonlinear wave equation for reducing blurred noise and biased expansion of equilibrium contour. We propose, after applying the introduced method, and calculate with discretization method. To analysis the experimental result, we investigate to PSNR and get about 4dB better than current method.
Techniques of Multilevel Location Trigger for Location-based Services
Min, Kyoung-Wook ; Kim, Do-Hyun ; Nam, Kwang-Woo ; Kim, Ju-Wan ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 435~444
DOI : 10.3745/KIPSTA.2006.13A.5.435
Recently, various applications of location trigger service have been required and developed as users of location-based services are increasing. The location trigger is detecting event of entering in, existing in or leaving from pre-specified area, and then alerting by short message service, an e-mall or servicing other pre-defined action to mobile subscribers. The conventional methodology of supporting location trigger is detecting location trigger events as periodical requesting location of mobile communication terminal to location gateway server in mobile communication network. But these conventional methods cause mobile communication interruption when the location trigger services are overloaded; thereby inducing performance of core server to be fell off. So in this paper, we have studied a new location trigger technology, named multilevel location trigger, to reduce mobile core network sewer triggering bottleneck and power consumption caused embedded GPS device of mobile phone. Actually, as design and evaluating the performance of location trigger after building test-bed environment, we contribute toward improving echnology of location trigger.
A Methodology to Simulate I/O-Intensive Applications
Eom, Hyeon-Sang ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 445~454
DOI : 10.3745/KIPSTA.2006.13A.5.445
We introduce a family of simulators for I/O-intensive distributed or parallel applications, and a methodology that permits selecting the most efficient simulator meeting a given user-defined accuracy requirement. This methodology consists of a series of tests to choose an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: the minimum expected time and the maximum. We present the results of applying our methodology to existing applications, and show that we can accurately simulate applications tens to hundreds of tunes faster than the application execution times.
Mobile Agent Location Management Protocol for Spatial Replication-based Approach in Mobile Agent Computing Environments
Yoon, Jun-Weon ; Choi, Sung-Jin ; Ahn, Jin-Ho ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 455~464
DOI : 10.3745/KIPSTA.2006.13A.5.455
In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker`s failure.
Structural Segmentation for 3-D Brain Image by Intensity Coherence Enhancement and Classification
Kim, Min-Jeong ; Lee, Joung-Min ; Kim, Myoung-Hee ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 465~472
DOI : 10.3745/KIPSTA.2006.13A.5.465
Recently, many suggestions have been made in image segmentation methods for extracting human organs or disease affected area from huge amounts of medical image datasets. However, images from some areas, such as brain, which have multiple structures with ambiruous structural borders, have limitations in their structural segmentation. To address this problem, clustering technique which classifies voxels into finite number of clusters is often employed. This, however, has its drawback, the influence from noise, which is caused from voxel by voxel operations. Therefore, applying image enhancing method to minimize the influence from noise and to make clearer image borders would allow more robust structural segmentation. This research proposes an efficient structural segmentation method by filtering based clustering to extract detail structures such as white matter, gray matter and cerebrospinal fluid from brain MR. First, coherence enhancing diffusion filtering is adopted to make clearer borders between structures and to reduce the noises in them. To the enhanced images from this process, fuzzy c-means clustering method was applied, conducting structural segmentation by assigning corresponding cluster index to the structure containing each voxel. The suggested structural segmentation method, in comparison with existing ones with clustering using Gaussian or general anisotropic diffusion filtering, showed enhanced accuracy which was determined by how much it agreed with the manual segmentation results. Moreover, by suggesting fine segmentation method on the border area with reproducible results and minimized manual task, it provides efficient diagnostic support for morphological abnormalities in brain.
Design and Implementation of a Customized Courseware using Agents
Heo, Sun-Young ; Kim, Eun-Gyung ;
The KIPS Transactions:PartA, volume 13A, issue 5, 2006, Pages 473~480
DOI : 10.3745/KIPSTA.2006.13A.5.473
Recently, remote education systems for web-based teaching-studying are rapidly increased. Also, a request for customized courseware suitable for individual learner`s level and learning pattern is increasing. But, most remote education systems do not provide customized learning service fit for each learner`s level and lots of learners easily lose their interest in studying. Therefore, a lot of researchers have tried to provide personalized customized learning service by analyzing leaner`s level and learning pattern automatically with agents. In this paper, we designed and implemented a customized courseware for studying the computer application. There are four agents such as professor, assistant, student, and monitor agent in CCA and they cooperate with each other to provide learning contents suited to each learner`s level.