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 15A, Issue 6 - Dec 2008
Volume 15A, Issue 5 - Oct 2008
Volume 15A, Issue 4 - Aug 2008
Volume 15A, Issue 3 - Jun 2008
Volume 15A, Issue 2 - Apr 2008
Volume 15A, Issue 1 - Feb 2008
Selecting the target year
Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks
Seo, Jung-Hyun ; Lee, Hyeong-Ok ; Jang, Moon-Suk ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 189~198
DOI : 10.3745/KIPSTA.2008.15-A.4.189
In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.
A Distributed Layer 7 Server Load Balancing
Kwon, Hui-Ung ; Kwak, Hu-Keun ; Chung, Kyu-Sik ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 199~210
DOI : 10.3745/KIPSTA.2008.15-A.4.199
A Clustering based wireless internet proxy server needs a layer-7 load balancer with URL hashing methods to reduce the total storage space for servers. Layer-4 load balancer located in front of server cluster is to distribute client requests to the servers with the same contents at transport layer, such as TCP or UDP, without looking at the content of the request. Layer-7 load balancer located in front of server cluster is to parse client requests in application layer and distribute them to servers based on different types of request contents. Layer 7 load balancer allows servers to have different contents in an exclusive way so that it can minimize the total storage space for servers and improve overall cluster performance. However, its scalability is limited due to the high overhead of parsing requests in application layer as different from layer-4 load balancer. In order to overcome its scalability limitation, in this paper, we propose a distributed layer-7 load balancer by replacing a single layer-7 load balancer in the conventional scheme by a single layer-4 load balancer located in front of server cluster and a set of layer-7 load balancers located at server cluster. In a clustering based wireless internet proxy server, we implemented the conventional scheme by using KTCPVS(Kernel TCP Virtual Server), a linux based layer-7 load balancer. Also, we implemented the proposed scheme by using IPVS(IP Virtual Server), a linux-based layer-4 load balancer, installing KTCPVS in each server, and making them work together. We performed experiments using 16 PCs. Experimental results show scalability and high performance of the proposed scheme, as the number of servers grows, compared to the conventional scheme.
A Study on Characteristics of Wet Oxide Gate and Nitride Oxide Gate for Fabrication of NMOSFET
Kim, Hwan-Seog ; Yi, Cheon-Hee ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 211~216
DOI : 10.3745/KIPSTA.2008.15-A.4.211
In this paper we fabricated and measured the
NMOSFET with wet gate oxide and nitride oxide gate to compare that the charateristics of hot carrier effect, charge to breakdown, transistor Id_Vg curve, charge trapping, and SILC(Stress Induced Leakage Current) using the HP4145 device tester. As a result we find that the characteristics of nitride oxide gate device better than wet gate oxide device, especially hot carrier lifetime(nitride oxide gate device satisfied 30 years, but the lifetime of wet gate oxide was only 0.1 year), variation of Vg, charge to breakdown, electric field simulation and charge trapping etc.
Branch Prediction with Speculative History and Its Effective Recovery Method
Kwak, Jong-Wook ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 217~226
DOI : 10.3745/KIPSTA.2008.15-A.4.217
Branch prediction accuracy is critical for system performance in modern microprocessor architectures. The use of speculative update branch history provides substantial accuracy improvement in branch prediction. However, speculative update branch history is the information about uncommitted branch instruction and thus it may hurts program correctness, in case of miss-speculative execution. Therefore, speculative update branch history requires suitable recovery mechanisms to provide program correctness as well as performance improvement. In this paper, we propose recovery logics for speculative update branch history. The proposed solutions are recovery logics for both global history and local history. In simulation results, our solution provides performance improvement up to 5.64%. In addition, it guarantees the program correctness and almost 90% of additional hardware overhead is reduced, compared to previous works.
A Mode Switching Protocol between RVOD and NVOD for Efficient VOD Services
Kim, Myoung-Hoon ; Park, Ho-Hyun ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 227~238
DOI : 10.3745/KIPSTA.2008.15-A.4.227
Recently, as network environment has broadened, the demands on VOD have been increased. The VOD services can be categorized into two types, RVOD and NVOD. Practical VOD services adopt one of them exclusively. Since a method using only one of RVOD and NVOD is not able to deal with frequently variable demand of clients, it leads to a result of overload on a server and a waste of server bandwidth. The efficiency of the network resource usage becomes lower. Hence this paper presents a study on the protocol for efficient VOD services. We propose a new protocol appliable for the existing VOD service algorithm, analyze its performance through simulation, and developed server/client systems applying the new protocol. We propose a mode switching protocol combined with protocols used in RVOD and NVOD. The proposed protocol is not able only to control both RVOD and NVOD but also to change the mode between RVOD and NVOD. As a result of using the proposed protocol to meet frequently variable demand, server bandwidth can be used efficiently. Especially, it can be applied to the existing VOD service algorithms. Therefore, we expect that the proposed protocol in this paper will be widely used in emerging VOD markets.
Efficient External Memory Algorithm for Finding the Maximum Suffix of a String
Kim, Sung-Kwon ; Kim, Soo-Cheol ; Cho, Jung-Sik ;
The KIPS Transactions:PartA, volume 15A, issue 4, 2008, Pages 239~242
DOI : 10.3745/KIPSTA.2008.15-A.4.239
We study the problem of finding the maximum suffix of a string on the external memory model of computation with one disk. In this model, we are primarily interested in designing algorithms that reduce the number of I/Os between the disk and the internal memory. A string of length N has N suffixes and among these, the lexicographically largest one is called the maximum suffix of the string. Finding the maximum suffix of a string plays a crucial role in solving some string problems. In this paper, we present an external memory algorithm for computing the maximum suffix of a string of length N. The algorithm uses four blocks in the internal memory and performs at most 4(N/L) disk I/Os, where L is the size of a block.