• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.9-9
• /
• 1997

• Journal of the Korea Society for Simulation
• /
• v.5 no.2
• /
• pp.41-58
• /
• 1996

The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2230-2234
• /
• 2003

This paper proposes a distributed simulator for general control system in CEMTool. Systems can be described by SIMTool likes the simulink in Matlab. For distributed simulation, we can seperate any system into several parallel subsystems in SIMTool. The number of parallel subsystem can be determined by the system's property. After seperation, parallel simulator will do initialization, one-step-ahead simulation, block-distribution and ordering and so on. Finally, simulator will create independent C codes and executive files for each subsystem. The whole system is fulfilled by several PCs, and each PC executes one subsystem. There are communications among these subsystem using reflective memory or ethernet. We have made several experiments, and the 5-stand cold rolling mill control system is our main target. The result of parallel simulation has shown effective speedup in comparison with one pc simulation.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.1-16
• /
• 1995

The performance of a computer system depends on the system architecture and workload, and the high performance required in many applications can be achieved by the scalability of the system architecture and workload. This paper presents scalable workload, a performance metric of scalable speedup and hierarchical modeling for the scalable computer system as well as the development of the object-oriented simulator spmplC++ Which is an advanced C++ version of the discrete event-driven simulation environment smplE. In addition, this paper presents two examples of applying scalable speedup, hierarchical modeling and simulator smplC++ to analyze the performance effect of the sclcbility in a multiprocessor system and a network-based client/server system.

• Structural Engineering and Mechanics
• /
• v.32 no.1
• /
• pp.95-126
• /
• 2009

The present contribution addresses the parallelization of advanced simulation methods for structural reliability analysis, which have recently been developed for large-scale structures with a high number of uncertain parameters. In particular, the Line Sampling method and the Subset Simulation method are considered. The proposed parallel algorithms exploit the parallelism associated with the possibility to simultaneously perform independent FE analyses. For the Line Sampling method a parallelization scheme is proposed both for the actual sampling process, and for the statistical gradient estimation method used to identify the so-called important direction of the Line Sampling scheme. Two parallelization strategies are investigated for the Subset Simulation method: the first one consists in the embarrassingly parallel advancement of distinct Markov chains; in this case the speedup is bounded by the number of chains advanced simultaneously. The second parallel Subset Simulation algorithm utilizes the concept of speculative computing. Speedup measurements in context with the FE model of a multistory building (24,000 DOFs) show the reduction of the wall-clock time to a very viable amount (<10 minutes for Line Sampling and ${\approx}$ 1 hour for Subset Simulation). The measurements, conducted on clusters of multi-core nodes, also indicate a strong sensitivity of the parallel performance to the load level of the nodes, in terms of the number of simultaneously used cores. This performance degradation is related to memory bottlenecks during the modal analysis required during each FE analysis.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.258-265
• /
• 2006

DEVS formalism is advantageous in modeling large-scale complex systems and it reveals good readability, because it can specify discrete event systems in a hierarchical manner. In contrast, it has drawback in that the simulation speed of DEVS models is comparably slow since it requires frequent message passing between the component models in run-time. This paper proposes a method, called model composition, for simulation speedup of DEVS models. The method is viewed as a compiled simulation technique which eliminates run-time interpretation of communication paths between component models. Experimental results show that the simulation speed of transformed DEVS models is about 18 times faster than original ones.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.519-524
• /
• 2002

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/{\infty},\;M/D/I/{\infty}\;and\;M/H_{2}/1/{\infty}$ 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.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.11a
• /
• pp.91-97
• /
• 2002

DEVS 형식론을 비롯한 모듈러한 시스템 모델링 방법은 복잡한 시스템을 모델링 할 때 유리하다. 반면에, 모듈러한 구성요소 모델들은 타 구성요소 모델의 상태 정보를 참조, 복사함으로써 빈번한 메시지 전달을 야기 시켜 시뮬레이션 속도가 저하되는 단점이 있다. 모델 합성법(Composition)은 여러 개의 요소모델들을 하나로 통합시키는 연산으로서 시스템 검증 분야에서 많이 사용되어져 왔다. 본 논문은 모델 합성법을 이용하여 구성요소 모델들 간에 주고받는 메시지 수를 줄이고 시뮬레이션 속도를 개선시키는 방법을 제안한다. 간단한 예제를 통하여 제안한 방법을 자세히 보여주고자 한다.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.191-200
• /
• 1998

There are two types of composition systems for the Korean alphabet: a combined system and a composite system. This paper decribes an efficient coding method for both of these two types. Using this coding method with the combined system yields about 10.5% code-length savings per a Korean character while it yields about 45% savings with the composite system. In other words the coding method produces a better result(i.e. 34.5% better) with the composite system than with the combined system. The simulation has been performed on a MasPar machine having 64 processors. The results show that the combined system achieved a 45.851-fold speedup while the composite system achieved a 47.274-fold speedup.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.482-485
• /
• 2000

A modified watershed transform is proposed which is context-free marker-controlled and minima imposition-free to reduce the over-segmentation and to speedup the transform. In contrast to the conventional methods in which a priori knowledge, such as flat zones, zones of homogeneous texture, and morphological distance, is required for marker extraction, context-free marker extraction is proposed by using the attention operator based on the GST (generalized symmetry transform). By using the context-free marker, the proposed watershed transform exploit marker-constrained labeling to speedup the computation and to reduce the over-segmentation by eliminating the unnecessary geodesic reconstruction such as the minima imposition and thereby eliminating the necessity of the post-processing of region merging. The simulation results show that the proposed method can extract context-free markers inside the objects from the complex background that includes multiple objects and efficiently reduces over-segmentation and computation time.