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
A Ranking Cleaning Policy for Embedded Flash File Systems
김정기 ; 박승민 ; 김채규 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 399~399
Along the evolution of information and communication technologies, manufacturing embedded systems such as PDA (personal digital assistant), HPC (hand -held PC), settop box. and information appliance became realistic. And RTOS (real-time operating system) and filesystem have been played essential re]os within the embedded systems as well. For the filesystem of embedded systems, flash memory has been used extensively instead of traditional hard disk drives because of embedded system's requirements like portability, fast access time, and low power consumption. Other than these requirements, nonvolatile storage characteristic of flash memory is another reason for wide adoption in industry. However, there are some technical challenges to cope with to use the flash memory as an indispensable component of the embedded systems. These would be relatively slow cleaning time and the limited number of times to write-and-clean. In this paper, a new cleaning policy is proposed to overcome the problems mentioned above and relevant performance comparison results will be provided. Ranking cleaning policy(RCP) decides when and where to clean within the flash memory considering the cost of cleaning and the number of times of cleaning. This method will maximize not only the lifetime of flash memory but also the performance of access time and manageability. As a result of performance comparison, RCP has showed about 10 ~ 50% of performance evolution compared to traditional policies, Greedy and Cost-benefit methods, by write throughputs.
Design of Virtual Memory Compression System on the Embedded System
정진우 ; 장승주 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 405~405
The embedded system has less fast CPU and lower memory than PC(personal Computer) or Workstation system. Therefore embedded operating is system is designed to efficiently use the limited resource in the system. Virtual memory management or the embedded linux have a low efficiency when page fault is occurred to get a data from I/O device. Because a data is moving from the swap device to main memory. This paper suggests virtual memory compression algorithm for improving in virtual memory management and capacity of space. In this paper, we present a way to performance implement a virtual memory compression system that achieves significant improvement for the embedded system.
Design and Implementation of Location Management System of Stock Keeping Unit with High Mobility Using Embedded System and Wireless LAN
이재현 ; 권경희 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 413~413
It it essential to get the exact location information of products for a warehouse management. It is very hard, however, to know the location of products which change their location in warehouse frequently This causes the effective warehouse management to be almost impossible. In this paper, we suggest a new location management system for such a SKU(Stock Keeping Unit) with high mobility. The system is composed of RFID (Radio Frequency IDentification), a management terminal with wireless LAN, mobile devices (Cellular Phone & PDA), and a central management system. As a model of a SKU with high mobility, we selected a used-car stored in a large-scale warehouse. We designed and implanted used-car location management system. After analyzing the operations of each position in used-car warehouse where the system will run, we implemented each function. This research shows that an embedded system with wireless LAN is able to know the status of coming in and cut and location of a SKU with high mobility in warehouse very accurately in real time. Therefore, it makes the warehouse to be controlled systematically.
Development of an E-Book Reader System for EBKS on Embedded Linux System
김정원 ; 노영욱 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 421~421
In this paper, we have developed an E-book reader for EBKS XML documents on the embedded Linux environment. This reader operated on a Linux target board parses the EBKS XML documents using the Qt SAX interface and displays the parsed pages through the QWS (Qt Windows System) which is a cross-platform windows toolkit. This reader can be easily and rapidly developed on Linux as well as MS windows and requires less memory than DOM interfaces because it parses with SAX interface.
An Implementation of EMV Specifications for Smartcard Terminals
박창현 ; 두명택 ; 이백순 ; 권오규 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 429~429
Smartcard is a kind of computing device with it's own processor and memory Thus, the international money market is going to accomodate the use of smartcards instead of traditional magnetic cards for the future money market. EMV is a standard protocol for smartcards, proposed by Europay, Mastercard, and Visa, which are three famous international settlement organizations. This paper presents the implementation of EMV specifications for the smartcard terminals for supporting various application programs. This paper shows that the implemented EMV terminal passes the international approval tests.
An Explicit Free Method for the Garbage Objects in Java-based Embedded System
배수강 ; 이승룡 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 441~441
As the size of embedded system software increase bigger and bigger, and it's complexity is grower and grower, the usage of dynamic memory management scheme such collector also has been increased. Using the garbage collector, however, inherently lead us performance degradation. In order to resolve this kind of performance problem in the Java based embedded system. we introduce an explicit dynamic memory free method to the automated dynamic memory management environment. which can be performed by a programmer. In the worst case, the prosed scheme shows the same performance as the case of that only garbage collector is working, since the unclaimed garbage objects will eventually be collected later by the garbage collector. In the best case. our method is free from any runtime overhead because the applications can be implemented without any intervention of the garbage collector. Although the proposed method can be facilitated with all the existing garbage collection algorithms, it shows an outperform in the case of mark-and-sweep algorithm.
An Implementation and Performance Evaluation of a RAID System Based on Embedded Linux
백승훈 ; 박종원 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 451~451
In this article, we present, design, and implement a software and hardware for an embedded RAID system. The merits and drawbacks of our system are presented by performance evaluation. The proposed hardware system consists of three fibre channel controllers for the interface with fibre channel disks and hosts. Embedded Linux in which a RAID software is implemented is ported to the hardware. A SCSI target mode device driver and a target mode SCSI module are designed for that our RAID system is considered as a block device to a host computer. Linux Multi-device is used as RAID functions of this system. A data cache module is implemented for high performance and the interconnection between Linux Multi-device and the target mode SCSI module. The RAID 5 module of Multi-device is modified for improvement of read performance. The benchmark shows that the new RAID 5 module is superior to the original one in overall performance.
A Design and Implementation of a Timing Analysis Simulator for a Design Space Exploration on a Hybrid Embedded System
안성용 ; 심재홍 ; 이정아 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 459~459
Modern embedded system employs a hybrid architecture which contains a general micro processor and reconfigurable devices such as FPGAS to retain flexibility and to meet timing constraints. It is a hard and important problem for embedded system designers to explore and find a right system configuration, which is known as design space exploration (DSE). With DES, it is possible to predict a final system configuration during the design phase before physical implementation. In this paper, we implement a timing analysis simulator for a DSE on a hybrid embedded system. The simulator, integrating exiting timing analysis tools for hardware and software, is designed by extending Y-chart approach, which allows quantitative performance analysis by varying design parameters. This timing analysis simulator is expected to reduce design time and costs and be used as a core module of a DSE for a hybrid embedded system.
EmXJ : A Framework of Configurable XML Processor for Flexible Embedding
정원호 ; 강미연 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 467~467
With the rapid development of wired or wireless Internet, various kinds of resource constrained mobile devices, such as cellular phone, PDA, homepad, smart phone, handhold PC, and so on, have been emerging into personal or commercial usages. Most software to be embedded into those devices has been forced to have the characteristic of flexibility rather than the fixedness which was an inherent property of embedded system. It means that recent technologies require the flexible embedding into the variety of resource constrained mobile devices. A document processor for XML which has been positioned as a standard mark-up language for information representation on the Web, is one of the essential software to be embedded into those devices for browsing the information. In this paper, a framework for configurable XML processor called EmXJ is designed and implemented for flexible embedding into various types of resource constrained mobile devices, and its advantages are compared to conventional XML processors.
Integration Mechanism of SDL and CORBA System using Method/Signal Mapping Rules
백의현 ; 허재두 ; 이형호 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 479~479
This paper presents the model that integrates an SDL system and a CORBA system using mapping rules between method and signal for developing embedded systems connected with internet. In order to support communication between the two different systems (SDL and CORBA), it is essential to secure the conversion interface between SDL communication protocol and CORBA communication protocol. In this paper, IDL is adopted for the communication interface and the conversion of the communication protocol between the two systems, and the IDL compiler automatically generates the interface for protocol interoperability. The proposed model adopts middleware on the subpart of the SDL based legacy system, and hence, supports the service on the distributed system, regardless of the environment and location of the server system.
The Design and Implementation of EL/LX level3 C Standard Library for RTOS Qplus-P
김도형 ; 신창민 ; 박승민 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 485~485
As the products of internet appliance, such as digital TV, internet set-top box, and internet phone, are continually produced, the market of real time operating system which controls those products is being highly increased. ETRI developed the extensible real time operating system, Qplus-P, which can be used from PDA to internet set-top box and home server. This paper describes the design and implementation of C standard library for real-time operating system Qplus-P. The Qplus-P C standard library follows EL/IX API level, which is proposed to the real-time operating system international standard by the RedHat. And, the C standard library functions, which are needed to support the Tiny-X and Kaffe, are also implemented. The implemented C standard library can reduce the size of library about 30% compare to the C library that does not follow EL/IX API level.
Performance Improvement of Force-directed Partitioning Algorithm for HW/SW Codesign
오주영 ; 이면재 ; 이준용 ; 박도순 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 491~491
Most partitioning algorithms for hardware- software codesign do not consider scheduling. Therefore, partitioning should be performed again if time constraints art not satisfied in scheduling the partitioned results. Existing FDS-applied methods which consider scheduling in partitioning decide the control step of the node to schedule while selecting nodes for partitioning. In selecting nodes for partitioning, several aspects should be considered together such as added cost or time due to the partition of the node, or the degree of interference due to the scheduling of the node. At this time, the induced force, which means the degree of intereference of scheduling other nodes, is computed all over the control step of the corresponding node and other depending nodes. In this paper, a new FDS-applied partitioning algorithm is proposed, where partitioning is performed using the defined scheduling urgency and relative scheduling urgency of the nodes. Since the nodes are partitioned by the computation of relative scheduling urgencies only at the earliest control step and the latest control step among the assignable steps, the time complexity for the computation of induced force could be improve. Experimental result on the benchmarks show the improvement of execution time of the proposed algorithm compared to the existing FDS-applied methods.
2-Level Adaptive Branch Prediction Based on Set-Associative Cache
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 497~497
Conditional branches can severely limit the performance of instruction level parallelism by causing branch penalties. 2-level adaptive branch predictors were developed to get accurate branch prediction in high performance superscalar processors. Although 2 level adaptive branch predictors achieve very high prediction accuracy, they tend to be very costly. In this paper, set-associative cached correlated 2-level branch predictors are proposed to overcome the cost problem in conventional 2-level adaptive branch predictors. According to simulation results, cached correlated predictors deliver higher prediction accuracy than conventional predictors at a significantly lower cost. The best misprediction rates of global and local cached correlated predictors using set-associative caches are 5.99% and 6.28% respectively. They achieve 54% and 17% improvements over those of the conventional 2-level adaptive branch predictors.
Implementation of a general purpose embedded computer system
장위식 ; 조병헌 ; 성영락 ; 오하령 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 503~503
In this paper, a general purpose embedded computer system is designed and implemented. The most crucial points of the system are extensibility and flexibility. The hardware of the developed system is composed of three modules and the software provides hardware independent application program interfaces. Moreover, uC/OS-Ⅱ, a well-known open realtime kernel. is extended and ported onto the system. The extended uC/OS-Ⅱsupports that multiple processes can have the same priority and such processes are scheduled in a round-robin manner.
A Task Scheduling Scheme for Bus-Based Symmetric Multiprocessor Systems
강오한 ; 김시관 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 511~511
Symmetric Multiprocessors (SMP) has emerged as an important and cost-effective platform for high performance parallel computing. Scheduling of parallel tasks and communications of SMP is important because the choice of a scheduling discipline can have a significant impact on the performance of the system. In this paper, we present a task duplication based scheduling scheme for bus-based SMP. The proposed scheme pre-allocates network communication resources so as to avoid potential communication conflicts. The performance of the proposed scheme has been observed by comparing the schedule length under various number of processors and the communication cost.
Quality of Coverage Analysis on Distributed Stochastic Steady-State Simulations
이종숙 ; 박형우 ; 정해덕 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 519~519
In this paper we study the qualify of sequential coverage analysis under a scenario of distributed stochastic simulation known as MRIP(Multiple Replications In Parallel) in terms of the confidence intervals of coverage and the speedup. The estimator based in the F-distribution was applied to the sequential coverage analysis of steady-state means. in simulations of the M/M/1/∞,M/D/I/∞and M/H₂/1/∞queueing systems on a single processor and multiple processors. By using multiple processors under the MRIP scenario, the time for collecting many replications needed in sequential coverage analysis is reduced. One can also easily collect more replications by executing it in distributed computers or clusters linked by a local area network.
A Labeling Scheme for Efficient On-the-fly Detection of Race Conditions in Parallel Programs
박소희 ; 우종정 ; 배종민 ; 전용기 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 525~525
Race conditions, races in short, need to be detected for debugging parallel programs, because the races result in unintended non-deterministic executions. To detect the races in an execution of program, previous techniques use a centralized data structure which may incur serious bottleneck in generating concurrency information, or show inefficient time complexity which depends on the degree of nested parallelism in comparing any two of them. We propose a new labeling scheme in this paper, which is scalable in generating the concurrency information without bottleneck by using private data structure, and improves time complexity into constant in checking concurrency. The scalability and time efficiency therfore makes on-the-fly race detection efficient not only for programs with either shared-memory or message-passing, but also for programs with mixed model of the two.
The SZIT based-mapping method for on-line adding disks in software RAID
박유현 ; 김창수 ; 강동재 ; 김영호 ; 신범주 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 535~535
According as the users can connect to remote hosts at anytime by using internet, the demand of non-stop system is increased. Also, the research about on-line adding/deleting disks and hosts are progressed. This paper suggests that the method of reducing additional operation when we add disks to the stripping system. That method can fast mapping like equation based mapping method because of using so-called SZIT(Striping Zone Information Table) and equations. And that method can reduce the relocation overhead in striping system at adding disks.
A Dynamic Routing Algorithm Adaptive to Traffic for Multistage Bus Networks in Distributed Shared Memory Environment
홍강운 ; 전창호 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 547~547
This paper proposes an efficient dynamic routing algorithm for Multistage Bus Networks(MBN's) in distributed shared memory environment. Our algorithm utilizes extra paths available on MBN and determines routing paths adaptively according to switch traffic in order to distribute traffic among switches. Precisely, a packet is transmitted to the next switch on an extra path having a lighter traffic. As a consequence the proposed algorithm reduces the mean response time and the average number of waiting tasks. The results of simulations, carried out with varying numbers of processors and varying switch sizes, show that the proposed algorithm improves the mean response time by 9% and the average number of waiting tasks by 21.6%, compared to the existing routing algorithms which do not consider extra paths on MBN.
Design of the Agent Migration Information System for Shortest Migration Order
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 555~555
The total processing time nay vary according to the order of visit when a mobile agent is sequentially migrated to another node. An effective migration algorithm is one in which the processing time is kept to its minimum from the initial state to the destination state by ordering the process. The total time spend for the process can be minimized by adopting an effective migration algorithm. Existing mobile agents such as Aglets. Voyager, and Odyssey do not guarantee the effectiveness by not taking the status of the network and the node to be moved into upon the migration. This paper proposes AMIS as the method used for the migration of the mobile agent. AMIS minimizes the total migration time of the mobile agent, and provides a firm and safe order for the migration of the mobile agent.
The Design and Implementation of On-Line Performance Monitor for JaNeC
김명호 ; 김남훈 ; 최재영 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 563~563
A performance monitor is indispensable to trace and evaluate performance of a program under distributed processing environment. A performance monitor il classified as off-line and on-line according to its output method. An off-line performance monitor analyzes its performance after a program terminates, and an on-line performance monitor analyzes its one while a program runs. Therefore, the on-line function is essential to analyzing and debugging the program fast. JaNeC, distributed processing environment that is implemented in Java, contains an off-line performance monitor for this. However, this performance monitor may not analyze the program running on JaNeC efficiently. Consequently, this paper explains that an on-line performance monitor is designed and implemented for fast analysis and debugging of the program running on JaNeC. This on-line performance monitor is designed to minimize effects on a program to analyze, and provides various forms of graphic output, to analyze the program effectively. In addition, even after a program terminates, it provides interface with the off-line performance monitor, to analyze again.
A Wrapper Design Methodology Based On IPCs
윤창열 ; 장경선 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 573~573
Reusing IPs requires interface protocol related tasks such as writing test benches and designing interface protocol conversion circuits, e.g. wrappers for IPs. The results of those tasks usually include IPC(interface protocol component)s for the corresponding IPs, similar to bus protocol components of the bus functional models. This paper proposes a methodology for the interface circuit design using synthesizable In that can be re-used. IPC recognizes or executes transactions over the given interface ports. So we present a transaction-oriented interface protocol description language, and a method to convert the description into an IPC in synthesizable VHDL code. With experiments, we show that the interface design using IPC does not cause significant area overhead compared with the interface design without IPC. The proposed IPC-based approach can be employed to reduce the interface design time since the designers can reuse IPCs without understanding the detailed interface protocols.
Efficient Data Structures and Algorithms for Terrain Data Visualization
정문주 ; 한정현 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 581~581
In implementing interactive multimedia systems, real-time visualization plays an important role. This paper presents efficient data structures and algorithms for real-time terrain navigation. Terrain data set is usually too huge to display as is. Therefore LOD (levels of detail) methods and view frustum culling are essential tools. This paper describes in detail compact hierarchical data structures, fast view frustum culling, and efficient LOD construction/rendering algorithms. Unlike previous works, we use a precise screen-space error metric for vertex removal and a strict error threshold allowing sub-pixel -sized errors only. Nevertheless, we can achieve 22 fps on average in a PC platform. The methods presented in this paper also satisfy almost all of the requirements for interactive real-time terrain Visualization.
L-system Tree with Particle Attributes
주우석 ; 박현민 ; 방순정 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 589~589
In computer graphics,L-system is primarily used for the production of such natural shapes as flowers, trees, and grass. It is possible by iteratively applying the theory of multiple-reduction-copy-machine to an arbitrary initial shape. The purpose of this paper is to modify the shape of ordinary L-system trees so that more realistic trees can be generated. Instead of applying simple iterative function system of the L-system, we regard each branch of the trees as a living thing, and endow them with corresponding attributes. Such branch attributes as lifetime, growth speed, shape variation, attraction by environment are known to belong to the attributes of the particle system. We presented modeling methods as hypotheses for each of the attributes based on parameters,and shown the resulting diverse tree shapes.
An algorithm for finding a watchman route with minimum links in the characteristic polygons
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 595~595
The watchman routes which an watchman patrols the interior of polygon moving along the route are classified to minimum length or minimum links. The watchman route with minimum links has minimum changes of direction in process. In this paper, we present an algorithm with O(n²) time for finding the watchman route with minimum links in the weakly visible polygons which have specific property.
A Study On Distributed Remote Lecture Contents for QoS Guarantee Streaming Service
최용준 ; 구자효 ; 임인택 ; 최병도 ; 김종근 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 603~603
Delivery efficiency of e-learning media can be influenced by authoring processes. Generally, a moving picture recorded by video camera can be delivered to student by multimedia streaming service, using media server technology. A e-learning media authored by lecture authoring tool is played in a student application by download-based delivery system. Recently, some animation know-how are applied to author e-learning media by hand-operation. In this paper, we suggest a client-based streaming service for the e-leaning media consists of media files and integration data The lecture of e-learning media nay be divided into some time-based small blocks. Each blocks can be located distributed site. The student system gather those blocks by download-scheduling. This is a valid method for QoS guarantee streaming services. In addition to our study, lecturers can author composite e-learning media includes media files and dynamic web pages simply, The distributed e-learning media files of our study is managed by multi-author and updated rapidly.
Inheritance Model for Reuse of Learning Contents based on SCORM
서대우 ; 이세훈 ; 왕창종 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 615~615
SCRM is international standard for sharing and reusing of learning contents as unit of SCO. But when we want to reuse this learning content by modifying a portion of it in similar knowledge domain, there is a problem that modification of original content has to be made. This paper suggests I-SCO model that enables to develop inheritable contents to solve this problem. The I-SCO model increases the reusability of contents based on SCORM by means of supporting inheritance that includes overloading and overriding. In this paper, we design and implement the I-SCO model, and execute on the runtime environment which is distributed by ADL. This experimentation shows the inheritability of contents and proves the validity of I-SCO model.
Design and implementation of a web-based learner-oriented project system
정용기 ; 최은만 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 621~621
Web based lecture & learning system has changed the conventional learner-oriented educational environment by adding mutual interactions. From the learner competency-based education. the necessity of the learner-oriented education and the mutual cooperation among the learners has been increased. A project-based education system will achieve a progressive development in understanding and the competency for the job to be performed by the mutual interactions between the learners and between the learners and the lecturer. This paper presents the project-based learning system in order to facilitate and achieve the goals of the industrial business processing system implementations in the ongoing popular Internet environments. In the proposed project-based system, the lecturer presents a problem to be solved and leads the education as a supervisor The learner can maximize the efficiency for study by taking advantage of the learner-oriented comparison study and the patterning.
Design and Development of a Web-based education system
고일석 ; 나윤지 ; 윤용기 ; 임춘성 ;
The KIPS Transactions:PartA, volume 9, issue 4, 2002, Pages 631~631
We have many difficult problems to efficient development and management of a Web-based education system because of the various requirements of various demanders. A Web-based education system consists of instructors and operation managers of system and learners. Those three factors are the most important elements of a Web-based education system and we must consider those elements for design and development. In constructivist approach. acquiring knowledge is made by experiences among each members or elements. So we can say that the constructivist elements of a Web-based education system is learners and instructors, operation managers. In this study, we design and implement a Web-based education system, based on the interactions of extended demanders of Web-based education system in constructivist approach and object oriented modeling. In this study we can improve portability and reduce cost because of platform independence from presented system. And in experiment, we compare and analyse two platform web-based education system a point of effectiveness, cost, convenience.