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 9A, Issue 4 - Dec 2002
Volume 9A, Issue 3 - Sep 2002
Volume 9A, Issue 2 - Jun 2002
Volume 9A, Issue 1 - Mar 2002
Volume 9, Issue 4 - 00 2002
Volume 9, Issue 3 - 00 2002
Volume 9, Issue 2 - 00 2002
Volume 9, Issue 1 - 00 2002
Selecting the target year
Dynamic Buffer Partitioning Technique for Efficient Continuous Media Service in VOD Servers
권춘자 ; 최창열 ; 최황규 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 137~137
In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.
A Study on Buffer and Shared Memory Optimization for Multi-Processor System
김종수 ; 문종욱 ; 임강빈 ; 정기현 ; 최경희 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 147~147
Multi-processor system with fast I/O devices improves processing performance and reduces the bottleneck by I/O concentration. In the system, the Performance influenced by shared memory used for exchanging data between processors varies with configuration and utilization. This paper suggests a prediction model for buffer and shared memory optimization under interrupt recognition method using mailbox. Ethernet (IEEE 802.3) packets are used as the input of system and the amount of utilized memory is measured for different network bandwidth and burstiness. Some empirical studies show that the amount of buffer and shared memory varies with packet concentration rate as well as I/O bandwidth. And the studies also show the correlation between two memories.
Considering Data Reference Pattern in Buffer Cache for Continuous Media File System
조경운 ; 류연승 ; 고건 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 163~163
Previous buffer cache schemes for continuous media file system only exploited the sequentiality of continuous media accesses and didn′t consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a novel buffer cache scheme for continuous media file system that sequential and looping references exist together. Proposed scheme increases the cache hit ratio by detecting reference pattern of files and appling an appropriate replacement policy to each file.
Delayed Reduction Algorithms of DJ Graph using Path Compression
심손권 ; 안희학 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 171~171
The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian′s path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.
Software Architecture of IEEE1394 Based Home Network for Guaranteeing Real-Time Characteristics of Isochronous Service and Event
박동환 ; 오봉진 ; 강순주 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 181~181
IEEE1394 is a de facto standard for the home network interfaces of digital multimedia home devices including digital A/V systems, digital camcorders, and PCs. Recently, it has been used in applications to guarantee the real-time characteristics such as home automation system and IICP (Instrument and Industrial Control Protocol). In order to guarantee real-time requirements in these IEEE1394-based real-time applications, this thesis proposes the software architecture of an IEEE1394 based home network that supports the guarantee for service′s react-time characteristics. The proposed architecture has a real-time IEEE1394 device driver and event service architecture for guarantee real-time characteristics. The real-time device driver supports priority-based queueing of packets and mechanism to reduce the interrupt latency time in ISR. The event service architecture supports a real-time events delivery based on home network service using real-time event channel. This architecture can accommodate the real-time requirements of various applications and services such as digital multimedia services with QoS guarantees. home automation system required real-tine characteristics.
Embedding between Hypercube and HCN(n, n), HFN(n, n)
김종석 ; 이형옥 ; 허영남 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 191~191
It is one of the important measures in the area of algorithm design that any interconnection network should be embedded into another interconnection network for the practical use of algorithm. A HCN(n, n), HFN(n, n) graph also has such a good properties of a hypercube and has a lower network cost than a hypercube. In this paper, we propose a method to embed between hypercube
and HCN(n, n), HFN(n, n) graph. We show that hypercube
can be embedded into an HCN(n, n) and KFN(n, n) with dilation 3, and average dilation is smaller than 2. Also, we has a result that the embedding cost, a HCN(n, n) and KFN(n, n) can be embedded into a hypercube, is O(n)
Overlapping Effects of Circular Shift Communication and Computation
김정환 ; 노정규 ; 송하윤 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 197~197
Many researchers have been interested in the optimization of parallel programs through the latency hiding by overlapping the communication with the computation. We ana1yzed overlapping effects in the circular shift communication which is one of the collective communications being frequently used In many data parallel programs. We measured the time which can be possibly overlapped and the time which cannot be overlapped in over all circular shift communication period on an Ethernet switch-based clustered system. The result from each platform nay be used for the input of optimizing compilers. The previous performance models usually have two kinds of drawbacks one is only based on point-to-point communication, so it is not appropriate for analyzing the overall effects of collective communications. The other provides the performance of collective communication, but no overlapping effect. In this paper we extended the previous models and analyzed the experimental results of the extended model.
Design and Implementation of a Distributed Audio/Video Stream Service Framework based on CORBA
김종현 ; 노영욱 ; 정기동 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 207~207
This paper present a design and implementation of a distributed audio, Video stream service framework based on CORBA for efficient processing and control of audio/video stream. We design software components which support processing, control and transmission of audio/video streams as distributed objects. For optimization of stream transmission performance, we separate the transmission path of control data and media data. Distributed objects are defined by IDL and implemented using JAVA. And device dependent facilities like media capturing, playing and communication channels are implemented using JMF (Java Media Framework) components. We show a connection establishment and control procedure of streams communication. And for evaluation, we implement a test system and experiment a system performance. Our experiments show that test system has somewhat longer connection latency time compared to TCP connection establishment, but has optimized media transmission time compared to CORBA IIOP. Also test system show acceptable service quality of media transmission.
A Parallel Algorithm for 3D Geographic Information System
조정우 ; 김진석 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 217~217
Many systems handle 3D-image were used. High-performance computer systems and techniques of compressing images to handle 3D-image were used. But there will be cost Problems, if GIS system is implemented, using the high-performance system. And if GIS system is implemented, using the techniques of compressing images, there will be some loss of a image. It will take a long processing time to handle 3D-images using a general PC because the size of 3D-image files are very huge. The parallel algorithm presented in the paper can improve speed to handle 3D-image using parallel computer system. The system uses the method of displacing images from nodes to screens, dividing a 3D-image into multiple sub images on multiple nodes. The performance of the presented algorithm showers improving speed by experiments.
An AT² Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 225~225
The constrained off-line competitive deletion problem is a simple form of the set manipulation operations problem. It excludes the insertion operation from the off-line competitive deletion problem. An optimal sequential algorithm and a CREW PRAM algorithm which runs O(log²nloglogn) time using O(n/loglogn) processors were already presented in the literature. In this paper, we present a reconfigurable mesh algorithm for the constrained off-line competitive deletion problem. The proposed algorithm is executed in a constant time on an n×n reconfigurable mesh, and the result is AT² optimal.
Performance Improvement Through Aggressive Instruction Packing
지승현 ; 김석일 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 231~231
This paper proposes balancing scheduling effort more evenly between the compiler and the processor, by introducing independently scheduled VLIW instructions. Aggressively Packed VLIW (APVLIW) processor is aimed specifically at independent scheduling Very Long Instruction Word(VLIW) instructions with dependency information. The APVLIW processor independently schedules earth instruction within long instructions using functional unit and dynamic scheduler pairs. Every dynamic scheduler dynamically checks far data dependencies and resource collisions while scheduling each instruction. This scheduling is especially effective in applications containing loops. We simulate the architecture and show that the APVLIW processor performs significantly better than the VLIW processor for a wide range of cache sizes and across various numerical benchmark applications.
A Study on Integrated Binding Service Strategy Based on Name/property in Wide-Area Object Computing Environments
정창원 ; 오성권 ; 주수종 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 241~241
With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.
A Device of Parallelism Control in POSIX Based Parallelization of Recursive Algorithms
이형봉 ; 백청호 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 249~249
One of the jai or purposes of multiprocessor system is to get a high efficiency in performance improvement. But in most cases, it is unavoidable to use some special programming languages or tools for full use of multiprocessor system. In general, loop and recursive call statements of algorithms are considered as typical parts for parallelization. Especially, recursive call statements are easy to parallelize conceptually without support of any special languages or tools. But it is difficult to control the degree of parallelism caused by high depth of recursive call leading to execution crash. This paper proposes a device to control Parallelism in the process of POSIX thread bated parallelization of recursive algorithms. For this, we define the concept of thread and process in UNIX system, and analyze the results of experimental application of the device to quick sorting algorithm.
A Study on the Pixel-Parallel Usage Processing Using the Format Converter
김현기 ; 이천희 ;
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 259~259
In this paper we implemented various image processing filtering using the format converter. This design method is based on realized the large processor-per-pixel array by integrated circuit technology. These two types of integrated structure are can be classify associative parallel processor and parallel process DRAM (or SRAM) cell. Layout pitch of one-bit-wide logic is Identical memory cell pitch to array high density PEs in integrate structure. This format converter design has control path implementation efficiently, and can be utilize the high technology without complicated controller hardware. Sequence of array instruction are generated by host computer before process start, and instructions are saved on unit controller. Host computer is executed the pixel-parallel operation starting at saved instructions after processing start. As a result, we obtained three result that 1) simple smoothing suppresses higher spatial frequencies, reducing noise but also blurring edges, 2) a smoothing and segmentation process reduces noise while preserving sharp edges, and 3) median filtering may be applied to reduce image noise. Median filtering eliminates spikes while maintaining sharp edges and preserving monotonic variations in pixel values.
An Effective Algorithm for the Noncentral Chi-Squared Distribution Function
The KIPS Transactions:PartA, volume 9, issue 2, 2002, Pages 267~267
The evaluation of the cumulative distribution function of the noncentral χ² distribution is required in approximate determination of the power of the χ² test. This article provides an algorithm for evaluating the noncentral χ² distribution function in terms of a single ″central″ χ² distribution function and compared various approximations.