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 10A, Issue 6 - Dec 2003
Volume 10A, Issue 5 - Oct 2003
Volume 10A, Issue 4 - Oct 2003
Volume 10A, Issue 3 - Aug 2003
Volume 10A, Issue 2 - Jun 2003
Volume 10A, Issue 1 - Mar 2003
Volume 10, Issue 6 - 00 2003
Volume 10, Issue 4 - 00 2003
Volume 10, Issue 3 - 00 2003
Volume 10, Issue 2 - 00 2003
Volume 10, Issue 1 - 00 2003
Selecting the target year
IRIS Task Scheduling Algorithm Based on Task Selection Policies
심재홍 ; 최경희 ; 정기현 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 181~181
We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant) W´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only W´s selected tasks, the computation complexity of proposed algorithm can be reduced to O(
). However, simulation results for various cases show that it is closed to O(W) on the average.
A Analysis of Heavy Tailed Distribution for Files in Web Servers Using TTT Plot Technique
정성무 ; 이상용 ; 장중순 ; 송재신 ; 유해영 ; 최경희 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 189~189
In this paper, we propose a method of analysis to show the heavy-tailed statistical distribution of file sizes in web servers, using TTT plot technique. TTT plot technique, a well-known method in the area of reliability engineering, determines that a distribution of samples fellows a heavy tailed one when their TTT statistical plots are lied on a straight line. We performed an intensive simulation using data gathered from real web servers. The simulation indicates that the proposed method is superior to Hill estimation technique or LLCD plot method in efficiency of data analysis. Moreover, the proposed method eliminates the possible decision error, which Pareto distribution or traditional method might cause.
High Level Object Oriented Real-Time Simulation Programming and TMO Scheme
송선희 ; 나상동 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 199~199
The object-oriented (OO) distributed real-time (RT) programming movement started in 1990´s and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented (OO) RT programming scheme is called the time-triggered message triggered object(TMO) programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.
Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees
김경훈 ; 우진운 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 207~207
Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional
processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of
An Algorithm For Load-Sharing and Fault-Tolerance In Internet-Based Clustering Systems
최인복 ; 이재동 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 215~215
Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.
A study of the load distributing algorithm on the heterogeneously clustered web system
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 225~225
In this paper, we develope algorithms that distribute the load on the heterogeneously clustered web system, The response time based on the concurrent user is examined for the suggested algorithms. Simulation experience shows that the response time using the dynamically weighted methods seems to have a good results compare to that with the fixed weighted methods. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases.
Design and Implementation of CORBA Inter-ORB Protocol Based on Shared Memory for Communication Systems
장종현 ; 이동길 ; 최완 ; 한치문 ; 장익현 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 231~231
Distributed systems present new system architecture for solving interoperability problem in heterogeneous system. This paper presents CORBA Inter-ORB protocol model based on shared memory to support communication software through analysis of existing CORBA IIOP protocol performance and Inter-Process Communication techniques. In the same host environment, proposed model applied standard CORBA mechanism to minimize message transfer overhead can develop software independently to hardware architecture of target communication system. This communication software that has flexibility and extensibility can improve productivity, duality and reusability of software.
The Design and Implementation of Verilog-2001 Parser
김영수 ; 김태석 ; 김상필 ; 조한진 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 239~239
The Verilog parser libary for IEEE Verilog 1364-2001 Standard is developed in the paper. The lexer and scanner are developed and tested to handle ″Verilog-2001″ which is the first major update to the Verilog language since its inception in 1984. Also the newly developed XML intermediate format for Verilog-2001 is presented. By using the XML intermediate, it allows the portable and scalable development of various kinds of verilog applications that are mainly focused on semantic manipulation.
Design of Low Voltage 1.8V, Wide Range 50∼500MHz Delay Locked Loop for DDR SDRAM
구인재 ; 정강민 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 247~247
This paper describes a Delay Locked Loop (DLL) with low supply voltage and wide lock range for Synchronous DRAM which employs Double Data Rate (DDR) technique for faster data transmission. To obtain high resolution and fast lock-on time, a new type of phase detector is designed. The new counter and lock indicator structure are suggested based on the Dual-clock dual-data Flip Flop (DCDD FF). The DCDD FF reduces the size of counter and lock indicator by about 70%. The delay line is composed of coarse and fine units. By the use of fast phase detector, the coarse delay line can detect minute phase difference of 0.2 nsec and below. Aided further by the new type of 3-step vernier fine delay line, this DLL circuit achieves unprecedented timing resolution of 25psec. This DLL spans wide locking range from 50MHz to 500MHz and generates high-speed clocks with fast lock-on time of less than 5 clocks. When designed using 0.25 um CMOS technology with 1.8V supply voltage, the circuit consumes 32mA at 500MHz locked condition. This circuit can be also used for other applications as well, such as synchronization of high frequency communication systems.
Design and Implementation of Embedded Contactless (Type-B) Protocol Module for RFID
전용성 ; 박지만 ; 주홍일 ; 전성익 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 255~255
In recent, as a typical example of RFID, the contactless IC card is widely used in traffic, access control system and so forth. And its use becomes a general tendency more and more because of the development of RF technology and improvement of requirement for user convenience. This paper describes the hardware module to process embedded contactless protocol for implementation contactless IC card. And the hardware module consists of analog circuits and specific digital logic circuits. This paper also describes more effective design method of contactless IC card, which method separates into analog circuit parts, digital logic circuit part, and software parts according to the role of the design parts.
Forecasted Popularity Based Lazy Caching Strategy
박철 ; 유해영 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 261~261
In this paper, we propose a new caching strategy for web servers. The proposed strategy collects only the statistics of the requested file, for example the popularity, when a request arrives. At a point of time, only files with higher forecasted popularity are cached all together. Forecasted popularity based lazy caching (FPLC) strategy uses exponential smoothing method for forecast popularity of web files. And, FPLC strategy shows that the cache hit ratio and the cache transfer ratio are better than those produced by other caching strategy. Furthermore, the experiment that is performed with real log files built from web servers shows our study on forecast method for popularity of web files improves cache efficiency.
A Development of Query-Answer Learning Tool based on LTSA
김행곤 ; 김정수 ;
The KIPS Transactions:PartA, volume 10, issue 3, 2003, Pages 269~269
The popularity of the web based education has come the need for variety learning methods and for business to exploit the web not only for interoperability but also standardization. This way of standardization has come to researched for environments, contents and practical uses in ISO. The IEEE has special]y established five technical classes for LTSA which provide advanced e-learning environments. Feedback functions would not be supported and specified in standardization for Query Answer on LTSA. In this paper, we describe the query and answer model which we have developed on layer three of LTSA. We develop the redefined model for transforming data flow oriented into object or component based model. We have developed the Query Answer Metadata (QAM) based on Learning Object Metadata (LOM). We design and showed things a prototyping implementation the Query Answer Learning Tool (QALT). We have used the QALT to address the problem of efficiency of web based education. We also used it to develop the related tools with quality and productivity.