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
Using a H/W ADL-based Compiler for Fixed-point Audio Codec Optimization thru Application Specific Instructions
Ahn Min-Wook ; Paek Yun-Heung ; Cho Jeong-Hun ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 275~288
DOI : 10.3745/KIPSTA.2006.13A.4.275
Rapid design space exploration is crucial to customizing embedded system design for exploiting the application behavior. As the time-to-market becomes a key concern of the design, the approach based on an application specific instruction-set processor (ASIP) is considered more seriously as one alternative design methodology. In this approach, the instruction set architecture (ISA) for a target processor is frequently modified to best fit the application with regard to code size and speed. Two goals of this paper is to introduce our new retargetable compiler and how it has been used in ASIP-based design space exploration for a popular digital signal processing (DSP) application. Newly developed retargetable compiler provides not only the functionality of previous retargetable compilers but also visualizes the features of the application program and profiles it so that it can help architecture designers and application programmers to insert new application specific instructions into target architecture for performance increase. Given an initial RISC-style ISA for the target processor, we characterized the application code and incrementally updated the ISA with more application specific instructions to give the compiler a better chance to optimize assembly code for the application. We get 32% performance increase and 20% program size reduction using 6 audio codec specific instructions from retargetable compiler. Our experimental results manifest a glimpse of evidence that a higgly retargetable compiler is essential to rapidly prototype a new ASIP for a specific application.
Taking Point Decision Mechanism of Page-level Incremental Checkpointing based on Cost Analysis of Process Execution Time
Yi Sang-Ho ; Heo Jun-Young ; Hong Ji-Man ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 289~294
DOI : 10.3745/KIPSTA.2006.13A.4.289
Checkpointing is an effective mechanism that allows a process to resume its execution that was discontinued by a system failure without having to restart from the beginning. Especially, page-level incremental checkpointing saves only the modified pages of a process to minimize the checkpointing overhead. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages. Thus, the efficient interval of checkpointing must be determined on run-time of the process. In this paper, we present an efficient and adaptive page-level incremental checkpointing facility that is based on the cost analysis of process execution time. In our simulation, results show that the proposed mechanism significantly reduced the average process execution time compared with existing fixed-interval-based page-level incremental checkpointing.
Implementation and Performance Analysis of the EVM`s Java Dynamic Memory Manager and Garbage Collector
Lee Sang-Yun ; Won Hee-Sun ; Choi Byung-Uk ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 295~304
DOI : 10.3745/KIPSTA.2006.13A.4.295
Java has been established as one of the most widely-used languages owing to its support of object-oriented concepts, safety, and flexibility. Garbage collection in the Java virtual machine is a core component that relieves application programmers of difficulties related to memory management. In this paper, we propose a memory manager and a garbage collector that is implemented on a embedded java virtual machine. The memory manager divide a heap into various-sized cells and manages it as blocks of same-sized cells. So it is possible to allocate and free memory fast. We adopted the 3-color based Mark & Sweep garbage collector as our base algorithm and we propose 4-color based Mark & Sweep garbage collector for supporting multi-threaded program. The proposed garbage collector occurs memory fragmentation but we show through a experiment that the fragmentation ratio is almost fixed according as we create objects continuously.
Design of a Parallel Rendering Processor Architecture with Effective Memory System
Park Woo-Chan ; Yoon Duk-Ki ; Kim Kyoung-Su ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 305~316
DOI : 10.3745/KIPSTA.2006.13A.4.305
Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simultaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. For the above two goals, effective memory organizations including a new pixel cache architecture are presented. The experimental results show that the proposed architecture achieves almost linear speedup at best case even in sixteen rasterizers.
Implementation of Tracking and Authentication system for Product using RFID/EPC-IS network
Shin Myeong-Sook ; Hong Seong-Pyo ; Lee Joon ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 317~322
DOI : 10.3745/KIPSTA.2006.13A.4.317
The development of RFID system is increasing rapidly by applying to variety fields recently. Especially, RFID system is used to the focus technology of the supply chain management in distribution field of the supplier. In distribution field, We have to grasp products quickly and correctly, but this has a problem to make an inventory of products in real-time because of products transfer. In this paper, to solve this problems. We grasp the state of inventory in real-time by using EPC-IS network becoming the organizational standard of RFID network. also, We offer an authentation of product service to grasp counterfeits and stolen goods in real-time. Therefore, in this paper, We show to be able to process an authentation of product service and inventory of products in distribution field in real-time.
A Content-based Load Balancing Algorithm for Metadata Servers in Cluster File System
Jang Jun-Ho ; Han Sae-Young ; Park Sung-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 323~334
DOI : 10.3745/KIPSTA.2006.13A.4.323
A metadata service is one of the important factors to affect the performance of cluster file systems. We propose a content-based load balancing algorithm that dynamically distributes client requests to appropriate metadata servers based on the types of metadata operations. By replicating metadatas and logging update messages in each server, rather than moving metadatas across servers, we significantly reduced the response time and evenly distributed client`s requests among metadata servers.
Analysis of PRC regeneration algorithm performance in dynamic environment by using Multi-DGPS Signal
Song Bok-Sub ; Oh Kyung-Ryoon ; Kim Jeong-Ho ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 335~342
DOI : 10.3745/KIPSTA.2006.13A.4.335
As PRC linear interpolation algorithm is applied after analysed and verified in this paper, the unknown location of a user can be identified by using PRC information of multi-DGPS reference station. The PRC information of each GPS satellite is not varying rapidly, which makes it possible to assume that PRC information of each GPS satellite varies linearly. So, the PRC regeneration algorithm with linear interpolation can be applied to improve the accuracy of finding a user`s location by using the various PRC information obtained from multi-DGPS reference station. The desirable PRC is made by the linear combination with the known position of multi-DGPS reference station and PRC values of a satellite using signals from multi-DGPS reference station. The RTK-GPS result was used as the reference. To test the performance of the linearly interpolated PRC regeneration algorithm, multi-channel DGPS beacon receiver was built to get a user`s position more exactly by using PRC data of maritime DGPS reference station in RTCM format. At the end of this paper, the result of the quantitative analysis of the developed navigation algorithm performance is presented.
A Shared Cache Directory based Wireless Internet Proxy Server Cluster
Kwak Hu-Keun ; Chung Kyu-Sik ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 343~350
DOI : 10.3745/KIPSTA.2006.13A.4.343
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. A wireless Internet proxy server cluster needs a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. In our former research, we proposed the CD-A structure which can be scalable in a systematic way and has a simple communication structure but it has no cooperative caching. A hash based load balancing can be used to solve the problem, but it can not deal with Hot Spot request problem. In this paper, we proposed a shared storage based wireless internet proxy server cluster which has a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. The proposed method shares one cache directory and it has advantages: advantages of the existing CD-A structure, cooperative caching, and serving Hot Spot requests. We performed experiments using 16 PCs and experimental results show high performance improvement of the proposed system compared to the existing systems in Hot Spot requests.
Adaptive Inter-Agent Communication Protocol for Large-Scale Mobile Agent Systems
Ahn Jin-Ho ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 351~362
DOI : 10.3745/KIPSTA.2006.13A.4.351
This paper proposes an adaptive inter-agent communication protocol to considerably reduce the amount of agent location information maintained by each service node and the message delivery time while avoiding the dependency of the home node of a mobile agent. To satisfy this goal, the protocol enables each mobile agent to autonomously leave its location information only on some few of its visiting nodes. Also, it may significantly reduce the agent cache updating frequency of each service node by keeping the identifier of the location manager of each agent in the smart agent location cache of the node. Simulation results show that the proposed protocol reduces about
of message delivery overhead and about
of the amount of agent location information each service node should maintain compared with the traditional one.
A Resource Access Control Mechanism Considering Grid Accounting
Hwang Ho-Joen ; An Dong-Un ; Chung Seung-Jong ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 363~370
DOI : 10.3745/KIPSTA.2006.13A.4.363
Currently, many people have been researching diverse mechansmims related to a resource access control in Grid environment. Mostly Grid user`s resource access control was designed to authorize according to their attributes and roles. But, to provide Grid with resources continuously, a resource access based on utility computing must be controlled. So, in this paper we propose and implement mechanism that intergrates Grid accounting concept with resource access control. This mechanism calcuates costs of Grid service on the basis of accounting, and determines based on user`s fund availibility whether they continue to make use of site resources or not. Grid jobs will be controlled according to a site resource access control policy only if the amount of available fund is less than its costs. If Grid job completed, resource consumer pays for the costs generated by using provider`s idle resources. Therefore, this paper provides mechansim to be able to control user`s resource access by Grid accounting, so that it is evaluated as the research to realize utility computing environment corresponding to economic principle.
2.5D Mapping Module and 3D Cloth Simulation System
Kim Ju-Ri ; Kim Young-Un ; Joung Suck-Tae ; Jung Sung-Tae ;
The KIPS Transactions:PartA, volume 13A, issue 4, 2006, Pages 371~380
DOI : 10.3745/KIPSTA.2006.13A.4.371
This paper utilizing model picture of finished clothes in fashion design field various material (textile fabrics) doing Draping directly can invent new design, and do not produce direction sample or poetic theme width and confirm clothes work to simulation. Also, construct database about model and material image and embodied system that can confirm Mapping result by real time. And propose clothes simulation system to dress to 3D human body model of imagination because using several cloth pieces first by process to do so that can do simulation dressing abstracted poetic theme width to 3D model here. Proposed system creates 3D model who put clothes by physical simulation that do fetters to mass-spring model after read 3D human body model file and 2D foundation pattern file. System of this treatise examines collision between triangle that compose human body model for realistic simulation and triangle that compose clothes and achieved reaction processing. Because number of triangle to compose human body is very much, this collision examination and reaction processing need much times. To solve this problem, treatise that see could create realistic picture by method to diminish collision public prosecutor and reaction processing number, and could dress clothes to imagination human body model within water plant taking advantage of Octree space sharing techniques.