Improving system performance for stochastic activity network: A simulation approach

An activity network with returning loop activities has a wide variety of applications, but can cause a heavy computational burden for large networks. Moreover, if an activity processing time and/or the probability of taking a particular activity changes when the number of activity visits is added, the computation is very complicated and difficult. We propose a simulation approach to deal with stochastic activity networks consisting of multiple terminal nodes, no limit on looping activities, non-constant activity selection probabilities, and non-deterministic activity times following arbitrary distributions. Probability and time control functions are introduced to reflect the acceleration, or learning effect, of repeated activities. Performance measures such as system success/failure probabilities, time to completion/success/failure times, time between success/failure, and the pth percentile times of a project are obtained. A series of sensitivity analysis was performed to understand the trend and behavior of system performance. A cost function is developed to find an optimal strategy by manipulating control factors. To illustrate the efficacy of this simulation approach a new drug discovery and development project was analyzed. The Promodel simulation language was used for performance evaluations, and the SimRunner optimization tool for obtaining the optimal solution.     

A simulation sequencing algorithm

In the course of developing a programming project for a course in operating systems, a general purpose language (Burroughs B6700 Algol) possessing concurrency and semaphores was used to provide a process oriented simulation sequencing facility. This facility has been used successfully to simulate several simple operating systems. The facility comprises three procedures along with ‘simulation semaphore’ variables. The first procedure, when called, inserts a simulated time delay into the progress of a simulation model process: the latter two procedures provide a P and a V operation on simulation semaphores, and are used to synchronize processes in a simulation model. The P operation may insert a simulated time delay into the progress of a process. These procedures are explained and presented along with a simple example to show their use.     

A high performance simulation methodology for multilevel grid-connected inverters

To design a high reliability multilevel grid-connected inverter,a high performance simulation methodology based on Saber is proposed.The simulation methodology with optimized simulation speed can simulate the factors that have significant impacts on the stability and performance of the control system,such as digital delay,dead band,and the quantization error.The control algorithm in the simulation methodology is implemented using the C language,which facilitates the future porting to an actual system since most actual digital controllers are programmed in the C language.The modeling of the control system is focused mainly on diode-clamped three-level grid-connected inverters,and simulations for other topologies can be easily built based on this simulation.An example of designing a proportional-resonant (PR) controller with the aid of the simulation is introduced.The integer scaling effect in fixed-point digital signal processors (DSPs) on the control system is demonstrated and the performance of the controller is validated through experiments.     

A generic simulation model for evaluating concurrency control protocols in native XML database systems

In this paper we propose a generic simulation model, named XSM, with which researchers can construct standard platforms and evaluate their proposed concurrency control protocols for native XDBMSs. The system environment, the performance metrics, and the protocol rules of various types of XML protocols are all considered by the model. To facilitate the implementation of XSM, the state diagrams, the sequence diagrams, the component diagram, and the class diagram of XSM are depicted using UML 2.0 notations. We also show a simulation platform constructed from XSM to fairly and comprehensively evaluate the performance of various XML protocols.     

A benchmarking system for MBS simulation software: Problem standardization and performance measurement

Despite the importance given to the computational efficiency of multibody system (MBS) simulation tools, there is a lack of standard benchmarks to measure the performance of these kinds of software applications. Benchmarking is done on an individual basis: different sets of problems are used, and the procedures and conditions considered to measure computational efficiency are also different. In this scenario, it becomes almost impossible to compare the performance of the different available simulation methods in an objective and quantitative way.This work proposes a benchmarking system for MBS simulation tools. The structure of the benchmark problem collection is defined, and a group of five problems involving rigid bodies is proposed. For these problems, documentation and validated reference solutions in standard formats have been generated, and a procedure to measure the computational efficiency of a given simulation software is described.Finally, the benchmarking system has been applied to evaluate the performance of two different simulation tools: ADAMS/Solver, a popular general-purpose commercial MBS simulation tool, and a custom Fortran code implementation of an Index-3 augmented Lagrangian formulation with projections combined with the implicit single-step trapezoidal rule as integration scheme. Results show that the proposed problems are able to reach the limits of the tested simulation methods, and therefore they can be considered good benchmark problems.     

A concurrent lambda calculus with futures

We introduce a new lambda calculus with futures, λ(fut)$\lambda (\mathsf{fut})$, that models the operational semantics of concurrent statically typed functional programming languages with mixed eager and lazy threads such as Alice ML, a concurrent extension of Standard ML. λ(fut)$\lambda (\mathsf{fut})$ is a minimalist extension of the call-by-value λ$\lambda$-calculus that is sufficiently expressive to define and combine a variety of standard concurrency abstractions, such as channels, semaphores, and ports. Despite its minimality, the basic machinery of λ(fut)$\lambda (\mathsf{fut})$ is sufficiently powerful to support explicit recursion and call-by-need evaluation.     

A concurrent abstract interpreter

Abstract interpretation [6] has been long regarded as a promising optimization and analysis technique for high-level languages. In this article, we describe an implementation of aconcurrent abstract interpreter. The interpreter evaluates programs written in an expressive parallel language that supports dynamic process creation, first-class locations, list data structures and higher-order procedures. Synchronization in the input language is mediated via first-class shared locations. The analysis computes intra- and inter-threadcontrol anddataflow information. The interpreter is implemented on top of Sting [12], a multi-threaded dialect of Scheme that serves as a high-level operating system for modern programming languages.     

EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

We investigate the simulation preorder between finite-state systems and a simple subclass of BPP-nets (communication-free nets). We show EXPSPACE lower bounds for the simulation problems, in both directions, as well as for the simulation equivalence. Our results improve PSPACE and co-NP lower bounds for the simulation between finite-state systems and BPP-nets, given by Ku?era and Mayr in [A. Ku?era, R. Mayr, Simulation preorder over simple process algebras, Information and Computation 173 (2) (2002) 184-198].     

A tactic language for refinement of state-rich concurrent specifications

Circus is a refinement language in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and calculus are distinctive, but since refinements may be long and repetitive, the practical application of this technique can be hard. Useful strategies have been identified, described, and used, and by documenting them as tactics, they can be expressed and repeatedly applied as single transformation rules. Here, we present ArcAngelC, a language for defining such tactics; we present the language, its semantics, and its application in the formalisation of an existing strategy for verification of Ada implementations of control systems specified by Simulink diagrams. We also discuss its mechanisation in a theorem prover, ProofPower-Z.     

A high performance crashworthiness simulation system based on GPU

Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system.     

A comparison of simulation techniques and algebraic techniques for verifying concurrent systems

Simulation-based assertional techniques and process algebraic techniques are two of the major methods that have been proposed for the verification of concurrent and distributed systems. It is shown how each of these techniques can be applied to the task of verifying systems described as input/output automata; both safety and liveness properties are considered. A small but typical circuit is verified in both of these ways, first using forward simulations, an execution correspondence lemma, and a simple fairness argument, and second using deductions within the process algebra DIOA for I/O automata. An extended evaluation and comparison of the two methods is given.Supported by NSF grant CCR-89-15206, by DARPA contracts N00014-89-J-1988 and N00014-92J-4033, and by ONR contract N00014-91-J-1046.     

A systematic modelling and simulation approach for JIT performance optimisation

Robust computer aided simulation and modelling tools help to visualise, analyse and optimise complex production processes with a reasonable amount of time and investment. A review of the literature shows that simulation and modelling have not been extensively applied in just-in-time (JIT) manufacturing environments. Also there remains a lack of a comprehensive mechanism to identify the most significant JIT drivers for the purpose of system process optimisation. The prime objective of this study is to close this gap by applying computer based simulation tools and linear mathematical modelling to identify the impact of selected key JIT parameters on performance in an automotive component-manufacturing environment. Research shows that variables such as inconsistent task distribution, variation on operator performance, misconception of total quality management philosophy and lack of set-up time elimination plans disrupt ideal JIT production. In this study, ProModel simulation and modelling software is used to model and simulate different experimental scenarios in order to understand and quantify the impact of selected input key JIT variables on objective functions (i.e. process time and takt time). The outcome is a robust mathematical model that highlights the significance of JIT drivers in the manually operated mixed-model assembly lines.     

Manufacturing cell performance improvement: a simulation study

This paper reports on the study of the “underbody front”-automated welding cell at Opel Belgium, a major automobile manufacturer of General Motors International Operations. It employs the use of simulation in an experimental design framework to identify potential improvements in average daily output through management of buffer sizes at key buffer locations within the cell. Many practical applications of animated computer simulation stop at the modeling and displaying of the process under study. Simulation as a tool for process reengineering or enhancement can only reach its full potential if incorporated in a comprehensive statistical study, so as to attain statistically significant results. The paper also reports on the reactions of, and issues raised by, management when the experimental design methodology was presented as a tool for process enhancement and productivity improvement.     

Automatic synthesis of uncertain models for linear circuit simulation: A polynomial chaos theory approach

A generalized and automated process for the evaluation of system uncertainty using computer simulation is presented. Wiener–Askey polynomial chaos and generalized polynomial chaos expansions along with Galerkin projections, are used to project a resistive companion system representation onto a stochastic space. Modifications to the resistive companion modeling method that allow for individual models to be produced independently from one another are presented. The results of the polynomial chaos system simulation are compared to Monte Carlo simulation results from PSPICE and C++. The comparison of the simulation results from the various methods demonstrates that polynomial chaos circuit simulation is accurate and advantageous. The algorithms and processes presented in this paper are the basis for the creation of a computer-aided design (CAD) simulator for linear networks containing uncertain parameters.     

A ship motion simulation system

In this article, efficient computational models for ship motions are presented. These models are used to simulate ship movements in real time. Compared with traditional approaches, our method possesses the ability to cope with different ship shapes, engines, and sea conditions without the loss of efficiency. Based on our models, we create a ship motion simulation system for both entertainment and educational applications. Our system assists users to learn the motions of a ship encountering waves, currents, and winds. Users can adjust engine powers, rudders, and other ship facilities via a graphical user interface to create their own ship models. They can also change the environment by altering wave frequencies, wave amplitudes, wave directions, currents, and winds. Therefore, numerous combinations of ships and the environment are generated and the learning becomes more amusing. In our system, a ship is treated as a rigid body floating on the sea surface. Its motions compose of 6 degrees of freedom: pitch, heave, roll, surge, sway, and yaw. These motions are divided into two categories. The first three movements are induced by sea waves, and the last three ones are caused by propellers, rudders, currents, and winds. Based on Newton’s laws and other basic physics motion models, we deduce algorithms to compute the magnitudes of the motions. Our methods can be carried out in real time and possess high fidelity. According to ship theory, the net effects of external forces on the ship hull depend on the ship shape. Therefore, the behaviors of the ship are influenced by its shape. To enhance our physics models, we classify ships into three basic types. They are flat ships, thin ships, and slender ships. Each type of ship is associated with some predefined parameters to specify their characteristics. Users can tune ship behaviors by varying the parameters even though they have only a little knowledge of ship theory.     

Implementation of neuro-fuzzy system with modified high performance genetic algorithm on embedded systems

In this paper implementation of ANFIS on embedded systems based on single-core and multi-core ARM processors is presented. A novel evolutionary optimization tool named, modified high performance genetic algorithm (mHPGA) with bacterial conjugation operator is applied to ANFIS as a training method. Fixed point and floating point number representations are applied and compared. Moreover new mutation algorithm has been proposed for fixed point numbers. The proposed method is designed to sweep numbers space to search possible solutions in large state space. Concurrency nature of mHPGA benefits implementation of multi threading feature on ARM cortex-A53 with four cores.     

PRESTO: A system for object-oriented parallel programming

PRESTO is a programming system for writing object-oriented parallel programs in a multiprocessor environment. PRESTO provides the programmer with a set of pre-defined object types that simplify the construction of parallel programs. Examples of PRESTO objects are threads, which provide fine-grained control over a program's execution, and synchronization objects, which allow simultaneously executing threads to co-ordinate their activities. The goals of PRESTO are to provide a programming environment that makes it easy to express concurrent algorithms, to do so efficiently, and to do so in a manner that invites extensions and modifications. The first two goals, which are the focus of this paper, allow a programmer to use parallelism in a way that is naturally suited to the problem at hand, rather than being constrained by the limitations of a particular underlying kernel or hardware architecture. The third goal is touched upon but not emphasized in this paper. PRESTO is written in C++; it currently runs on the Sequent shared-memory multiprocessor on top of the Dynix operating system. In this paper we describe the system model, its applicability to parallel programming, experiences with the initial implementation, and some early performance measurements.     

An action-based formal model for concurrent real-time systems

Action systems are a formalism for representing concurrent behaviours, based on interleaved atomic actions. We show how this model can be used to represent time-consuming, pre-emptible actions with real-time constraints. A development procedure is described which captures the steps programmers typically undertake in the design of real-time multi-tasking systems.