A Federated Approach to Parallel and Distributed Simulation of Complex Systems

A Federated Approach to Parallel and Distributed Simulation of Complex SystemsThe paper describes a Java-based framework called ASimJava that can be used to develop parallel and distributed simulators of complex real-life systems. Some important issues associated with the implementation of parallel and distributed simulations are discussed. Two principal paradigms for constructing simulations today are considered. Particular attention is paid to an approach for federating parallel and distributed simulators. We describe the design, performance and applications of the ASimJava framework. Two practical examples, namely, a simple manufacturing system and computer network simulations are provided to illustrate the effectiveness and range of applications of the presented software tool.

Download Full-text

LOAD BALANCING FOR PARALLEL PCS NETWORK SIMULATIONS

Journal of Interconnection Networks ◽

10.1142/s0219265900000123 ◽

2000 ◽

Vol 01 (03) ◽

pp. 173-193 ◽

Cited By ~ 2

Author(s):

AZZEDINE BOUKERCHE

Keyword(s):

Load Balancing ◽

Distributed Simulation ◽

Simulation Experiments ◽

Time Warp ◽

Conservative Scheme ◽

Simulation Techniques ◽

Parallel And Distributed Simulation ◽

Pcs Networks ◽

Network Simulations ◽

Stage 1

Parallel and distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS network simulations. In this paper, we consider distributed simulation of PCS models using a two-state PCS simulation testbed which makes use of a conservative scheme at Stage 1, and of Time Warp at Stage 2, and focus upon the load balancing issue. We investigate and study several load balancing schemes for TDMA systems. Extensive simulation experiments were conducted on a cluster of workstations using a real suburban area serviced by an FCA-based PCS networks. Our results indicate clearly that careful load balancing scheme is important in the success of the PCS simulation model.

Download Full-text

Parallel Network Simulation With OMNeT++

Research and Development on Information and Communication Technology ◽

10.32913/mic-ict-research.v3.n5.320 ◽

2009 ◽

Author(s):

András Varga ◽

Ahmet Y. Şekercioğlu Şekercioğlu

Keyword(s):

Communication Networks ◽

Large Scale ◽

Distributed Simulation ◽

Discrete Event ◽

Rare Event ◽

Telecommunication Networks ◽

Event Simulation ◽

Parallel And Distributed Simulation ◽

Simulation Protocol ◽

Parallel Network

This paper reports a new parallel and distributed simulation architecture for OMNeT++, an open-source discrete event simulation environment. The primary application area of OMNeT++ is the simulation of communication networks. Support for a conservative PDES protocol (the Null Message Algorithm) and the relatively novel Ideal Simulation Protocol has been implemented.Placeholder modules, a novel way of distributing the model over several logical processes (LPs) is presented. The OMNeT++ PDES implementation has a modular and extensible architecture, allowing new synchronization protocols and new communication mechanisms to be added easily, which makes it an attractive platform for PDES research, too. We intend touse this framework to harness the computational capacity of highperformance cluster computersfor modeling very large scale telecommunication networks to investigate protocol performance and rare event failure scenarios.

Download Full-text

Parallel and distributed simulation

Winter Simulation Conference Proceedings, 1995. ◽

10.1109/wsc.1995.478713 ◽

2005 ◽

Cited By ~ 4

Author(s):

R.M. Fujimoto

Keyword(s):

Distributed Simulation ◽

Parallel And Distributed Simulation

Download Full-text

Heuristic algorithm for optimal redundancy allocation in complex systems

Journal of Quality in Maintenance Engineering ◽

10.1108/jqme-01-2018-0003 ◽

2019 ◽

Vol 25 (1) ◽

pp. 54-64 ◽

Cited By ~ 1

Author(s):

Sudhanshu Aggarwal

Keyword(s):

Complex Systems ◽

Heuristic Algorithm ◽

Communication Systems ◽

Heuristic Algorithms ◽

Real Life ◽

Optimal Solution ◽

Systems Design ◽

Computational Time ◽

Coherent System ◽

Content Type

PurposeThe purpose of this paper is to present an efficient heuristic algorithm based on the 3-neighborhood approach. In this paper, search is made from sides of both feasible and infeasible regions to find near-optimal solutions.Design/methodology/approachThe algorithm performs a series of selection and exchange operations in 3-neighborhood to see whether this exchange yields still an improved feasible solution or converges to a near-optimal solution in which case the algorithm stops.FindingsThe proposed algorithm has been tested on complex system structures which have been widely used. The results show that this 3-neighborhood approach not only can obtain various known solutions but also is computationally efficient for various complex systems.Research limitations/implicationsIn general, the proposed heuristic is applicable to any coherent system with no restrictions on constraint functions; however, to enforce convergence, inferior solutions might be included only when they are not being too far from the optimum.Practical implicationsIt is observed that the proposed heuristic is reasonably proficient in terms of various measures of performance and computational time.Social implicationsReliability optimization is very important in real life systems such as computer and communication systems, telecommunications, automobile, nuclear, defense systems, etc. It is an important issue prior to real life systems design.Originality/valueThe utilization of 3-neighborhood strategy seems to be encouraging as it efficiently enforces the convergence to a near-optimal solution; indeed, it attains quality solutions in less computational time in comparison to other existing heuristic algorithms.

Download Full-text