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
Real-Time Functional Reactive Program Translator for Embedded Systems
Lee, Dong-Ju ; Woo, Gyun ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 481~488
DOI : 10.3745/KIPSTA.2006.13A.6.481
FRP(Functional Reactive Programming) is a kind of embedded language in Haskell, it declaratively program reactive system based on two essential high-order types named behavior and events. This Paper design and implementation RT-FRP(Real-time Functional Reactive Programming) translator for using FRP in embedded systems with many constraints. The RT-FRP translator generates a C Program from an RT-FRP program according to the operational semantics of the RT-FRP language. To show the effectiveness of the RT-FRP translator, we loaded and executed the test program generated by the translator onto a real embedded system, LEGO Mindstorm. According to the experimental result, the reactive system software can be programmed more concisely using RT-FRP than using an imperative counter part although the size of the binary code is rather increased.
An Algorithm of Solution for the Exceptional Field Problem in the Speculative Partial Redundancy Elimination(SPRE) Optimization
Shin, Hyun-Deok ; Ahn, Heui-Hak ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 489~494
DOI : 10.3745/KIPSTA.2006.13A.6.489
This paper improves the algorithms for Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. This research brings up an issue concerning a field to which SPRE cannot be applied, and suggests a solution to the problem. The Improved SPRE algorithm performs the execution speed optimization based on the information on the execution frequency from profiling and the memory space optimization.
The Methodology for Interoperability between Agent Framework and Information Bus Adapter for Ubiquitous Computing Environments
Park, Sang-Yong ; Han, Seung-Wok ; Youn, Hee-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 495~500
DOI : 10.3745/KIPSTA.2006.13A.6.495
The role of autonomic and intelligent agents in various environments is getting more important as demand on ubiquitous computing grows. The agents exchange information using the ACL (Agent Communication Language) to autonomously solve the problems. In this paper we propose a way of efficient interoperability technique between the agent framework built based on the international standard FIPA(Foundation for Intelligent Physical Agents) and the CORBA event service-based information bus adapter developed by us. The design and implementation of EMTI (Efficient Message Transport Interface) allowing communication between the information bus adapter which is non-agent platform and JADE platform are presented and its performance is evaluated by letting them exchange a large amount of messages.
Adaptive Control of Super Peer Ration using Particle Swarm Optimization in Self-Organizing Super Peer Ring Search Scheme
Jang, Hyung-Gun ; Han, Sae-Young ; Park, Sung-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 501~510
DOI : 10.3745/KIPSTA.2006.13A.6.501
The self-organizing super peer ring P2P search scheme improves search performance of the existing unstructured peer-to-peer systems, in which super peers with high capacity constitute a ring structure and all peer in the system utilize the ring for publishing or querying their keys. In this paper, we further improves the performance of the self-organizing ring by adaptively changing its super peer ratio according to the status of the entire system. By using PSO, the optimized super peer ratio can be maintained within the system. Through simulations, we show that our self-organizing super peer ring optimized by PSO outperforms not only the fixed super peer ring but also the self-organizing super ring with fixed ratio in the aspect of query success rate.
A Study of File Replacement Policy in Data Grid Environments
Park, Hong-Jin ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 511~516
DOI : 10.3745/KIPSTA.2006.13A.6.511
The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used) LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.
Implementation and Performance Analysis of Single I/O Space Service for Cluster Computers
Kim, Tae-Kyu ; Kim, Bang-Hyun ; Kim, Jong-Hyun ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 517~524
DOI : 10.3745/KIPSTA.2006.13A.6.517
In cluster computers, it is essential to Implement the single I/O space(SIOS) supporting integrated I/O substructure to efficiently process I/O intensive applications. SIOS service provides with global I/O address space to directly access peripherals and hard disks in its own or remote nodes from any node in the cluster computer In this thesis, we propose the implementation method of SIOS in Linux clusters by using only freewares. This method is implemented at device driver level that uses Enhanced Network Block Device(ENBD) and file system level that uses S/W RAID and NFS. The major strengths of this method are easiness of implementation and almost no cost due to using freewares. In addition, since freewares used are open sources, it is possible to apply this method to other platforms with only slight modification. Moreover, experiments show that I/O throughputs are up to 5.5 times higher in write operations and approximately 2.3 times higher in read operations than those of CDD method that uses the device driver developed at kernel level.
Low-Cost Causal Message Logging based Recovery Algorithm Considering Asynchronous Checkpointing
Ahn, Jin-Ho ; Bang, Seong-Jun ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 525~532
DOI : 10.3745/KIPSTA.2006.13A.6.525
Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%
2.1% of the recovery information collection time compared with the latter.
Design and Implementation of a Grid System META for Executing CFD Analysis Programs on Distributed Environment
Kang, Kyung-Woo ; Woo, Gyun ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 533~540
DOI : 10.3745/KIPSTA.2006.13A.6.533
This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.
Algorithm for finding a length-constrained heaviest path of a tree
Kim, Sung-Kwon ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 541~544
DOI : 10.3745/KIPSTA.2006.13A.6.541
In a tree with each edge associated with a length and a weight (positive, negative, or zero are possible) we develop an O(nlognloglogn) time algorithm for finding a path such that its sum of weights is maximized and its sum of lengths does not exceed a given value. The previously best-known result is O(
), where n is the number of nodes in the tree.
An Elementary Educational Contents Retrieval System Using Semantic Web
Lee, Hee-Kyoung ; Jun, Woo-Chun ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 545~554
DOI : 10.3745/KIPSTA.2006.13A.6.545
Although the current Web search engines provide tremendous information, it is hard to find right information among the huge information. Users need to spend extra time to filter out unnecessary information. In order to overcome the limit of current Web search engines, Semantic Web was developed to provide efficient search, integration, and reuse of information by structuring semantic information from Web resources. In this paper, an elementary education contents retrieval system using Semantic Web is proposed. The proposed system emphasizes history contents that have high relevancy among data. For construction of the proposed system, ontology is proposed first for elementary study contents and ontology for historical contents is proposed for easy access to those contents using semantic relation among them. Based on the ontology, the proposed system is designed and implemented. The proposed system has the following characteristics. First, the system provides various query formats in detail so that search results can be refined efficiently. Second, the system presents only semantically information connected with key words or including key words using study contents ontology. Finally, the proposed system can increase study effects by presenting various contents that are related with query by users.
Media-oriented e-Learning System supporting Execution-File Demonstration
Jou, Wou-Seok ; Lee, Kang-Sun ; Meng, Je-An ;
The KIPS Transactions:PartA, volume 13A, issue 6, 2006, Pages 555~560
DOI : 10.3745/KIPSTA.2006.13A.6.555
In contrast with the earlier remote education that simply recorded off-line classes, modern remote education emphasizes on offering additional functions that could maximize learning efficiency. Usage of such multimedia information as the texts, graphics, sounds, animations is considered fundamental element in offering the additional functions. This paper designs and implements an encoder/decoder that could accommodate the multimedia information with emphasis on demonstrating execution files. Instructors can demonstrate my type of execution files or application data files, and the remote learners can freely try running the corresponding execution files by themselves. Consequently, a high-level of learning efficiency can be achieved by the proposed encoder/decoder.