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 8A, Issue 4 - Dec 2001
Volume 8A, Issue 3 - Sep 2001
Volume 8A, Issue 2 - Jun 2001
Volume 8A, Issue 1 - Mar 2001
Selecting the target year
Implementation of Component Support Statechart Tool for a Rapid Design of the Embedded System
Park, Hong-Jin ; Kim, Yeong-Chan ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 75~80
The rapid design of the embedded system is crucial for improving the product’s competitiveness. Existing statechart tools used for designing the embedded system rely on the copy and paste of the statechart for reuse. However, such method has a major drawback of wasting both time and cost of the system developer. This paper implements the component supporting tool. A tool that makes efficient reuse of a statechart by adding a component function to the existing functions is implemented in this paper. Also, to add a component function, this paper restructured the contract as protocol of the inter-component. The implemented tool helps not only reduce the life cycle of a product, but also enhance a product’s competitiveness by supporting the product’s time-to-market.
Switchover Time Analysis of Primary-Backup Server Systems Based on Software Rejuvenation
Lee, Jae-Sung ; Park, Kie-Jin ; Kim, Sung-Soo ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 81~90
As the rapid growth of Internet, computer systems are growing in its size and complexity. To meet high availability requirements for the systems, one usually uses both hardware and software fault tolerance techniques. To prevent failures of computer systems from software-aging phenomenon that come from long mission time, we adopt software rejuvenation method that stops and restarts the software in the servers intentionally. The method makes the systems clean and healthy state in which the probability of fault occurrence is very low. In this paper, we study how switchover time affects software rejuvenation of primary-backup server systems. Through experiments, we find that switchover time is an essential factor for deciding the rejuvenation policy.
Remote Resource Control System based on Web Environment
Lee, Gi-Jun ; Jeong, Guk-Yeong ; Jeong, Chae-Yeong ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 91~98
TCP/IP based remote system using internet presented the method to access and control all the types of resources connected to network system over time and space. In this paper, We studied a resource control method through a mutual communication of a system association composed of service user, provider, and manager of the network system for the web based remote control system. The service users require the resources, and its providers are a variety of devices and digital electronic products which can provide the services in a network system. The service manager who operates the whole system performs the role to interconnect its users with its providers. Through an experiment, an implemented system confirmed flexibility, stability, and extensibility of the method presented in this paper.
Fault-Tolerant Multicasting in MIN-based Multicomputers using Cube Encoding Scheme
Kim, Jin-Soo ; Park, Jae-Hyung ; Kim, Myung-Kyun ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 99~106
In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks (MIN’s). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.
A Register-Based Caching Technique for the Advanced Performance of Multithreaded Models
Go, Hun-Jun ; Gwon, Yeong-Pil ; Yu, Won-Hui ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 107~116
A multithreaded model is a hybrid one which combines locality of execution of the von Neumann model with asynchronous data availability and implicit parallelism of the dataflow model. Much researches that have been made toward the advanced performance of multithreaded models are about the cache memory which have been proved to be efficient in the von Neumann model. To use an instruction cache or operand cache, the multithreaded models must have cache memories. If cache memories are added to the multithreaded model, they may have the disadvantage of high implementation cost in the mode. To solve these problems, we did not add cache memory but applied the method of executing the caching by using available registers of the multithreaded models. The available register-based caching method is one that use the registers which are not used on the execution of threads. It may accomplish the same effect as the cache memory. The multithreaded models can compute the number of available registers to be used during the process of the register optimization, and therefore this method can be easily applied on the models. By applying this method, we can also remove the access conflict and the bottleneck of frame memories. When we applied the proposed available register-based caching method, we found that there was an improved performance of the multithreaded model. Also, when the available-register-based caching method is compared with the cache based caching method, we found that there was the almost same execution overhead.
Refined fixed granularity algorithm on Networks of Workstations
Gu, Bon-Geun ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 117~124
At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the
matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.
Benchmarks for Performance Testing of MPI-IO on the General Parallel File System
Park, Seong-Sun ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 125~132
IBM developed the MPI-IO, we call it MPI-2, on the General Parallel File System. We designed and implemented various Matrix Multiplication Benchmarks to evaluate its performances. The MPI-IO on the General Parallel File System shows four kinds of data access methods : the non-collective and blocking, the collective and blocking, the non-collective and non-blocking, and the split collective operation. In this paper, we propose benchmarks to measure the IO time and the computation time for the data access methods. We describe not only its implementation but also the performance evaluation results.
Reducing the frequency of processor thrashing using guarantee/reservation in process migration
Lee, Jun-Yeon ; Im, Jae-Hyeon ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 133~146
In a dynamic load distribution policies, each node gathers the current system sates information before making a decision on load balancing. Load balancing policies based on this strategy can suffer from processor thrashing. In this paper, we propose a new algorithm which attempts to decrease the frequency of the processor thrashing, the algorithm is based on the integration of three components. The first, the algorithm of which determine the size of jobs be transferred. The second, negotiation protocol with obtains a mutual agreement between a sender and a receiver on the transferring job size. And the third, a symmetrically-initiated location policy. The algorithm proposed in this paper used Siman IV as simulation tool to prove the improvement of performance. I analyzed the result of simulation, and compared with related works. The mean response time shows that there are no difference with existing policy, but appear a outstanding improvement in high load. The thrashing coefficient that shows the average response time, CPU overhead and the thrashing ratio at both the receiving and sending node has been used in the analysis. A significant improvement in the average response time and the CPU overhead ratio was detected using our algorithm when an overhead occurred in the system over other algorithm. The thrashing coefficient differed in the sending node and the receiving node of the system. Using our algorithm, the thrashing coefficient at the sending node showed more improvement when there was an overhead in the system, proving to be more useful. Therefore, it can be concluded that the thrashing ratio can be reduce by properly setting the maximum and minimum value of the system’s threshold queue.
Study on High Speed Routers(I)-Labeling Algorithms for STC104
Lee, Hyo-Jong ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 147~156
A high performance routing switch is an essential device to either the high performance parallel processing or communication networks that handle multimedia transfer systems such as VOD. The high performance routing chip called STC104 is a typical example in the technical aspect which has 32 bidirectional links of 100Mbps transfer sped. It has exploited new technologies, such as wormhole routing, interval labeling, and adaptive routing method. The high speed router has been applied into some parallel processing system as a single chip. However, its performance over the various interconnection networks with multiple routing chips has not been studied. In this paper, the strucrtures and characteristics of the STC104 have been investigated in order to evaluate the high speed router. Various topology of the STC104, such as meshes, torus, and N-cube are defined and constructed. Algorithms of packet transmission have been proposed based on the interval labeling and the group adaptive routing method implemented in the interconnected network. Multicast algorithms, which are often requited to the processor networks and broadcasting systems, modified from U-mesh and U-torus algorithms have also been proposed overcoming the problems of point-to-point communication.
Study on High Speed Routers(II)-Performance Analysis on Various Network Topology of STC104
Lee, Hyo-Jong ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 157~166
A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.
Motion Control on Animation Space
Park, Ji-Heon ; Park, Seong-Heon ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 167~178
This paper presents a new methodology for specification and control of the motion of an articulated rigid body for the purposes of animation by coordinate transformations. The approach is to formulate the problem as a coordinate transformation from the joint space of the body to a user-defined animation space which is chosen for convenience in constraining the motion. Constraints are applied to the resulting coordinate transformation equations. It is sufficiently general so that it can be applied to all common types of control problems, including closed loop as well as open loop mechanisms. We also provided a new approach to simulate a closed loop mechanism, which is using animation space transformation technique. The method is formulated in detail and is demonstrated by animating the motion of an inchworm.
Shortest Path-Finding Algorithm using Multiple Dynamic-Range Queue(MDRQ)
Kim, Tae-Jin ; Han, Min-Hong ;
The KIPS Transactions:PartA, volume 8A, issue 2, 2001, Pages 179~188
We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.