In this paper, we present two new methods to simulate Petri Nets: a data parallelsimulation and a distributedsimulation. Both simulations use an equational representation of the net in the so called (min, +) algebra...
详细信息
In this paper, we present two new methods to simulate Petri Nets: a data parallelsimulation and a distributedsimulation. Both simulations use an equational representation of the net in the so called (min, +) algebra. The data parallelsimulation is based on the use of matrix representation of these equations, and the distributedsimulation on the decomposition of a Petri Net into marked graph components.
We describe MOSS, a small language of mobile distributed objects and system-wide references, uncommitted to any distributedsimulation protocol, but which can be executed as a distributed conservative simulation with ...
详细信息
We describe MOSS, a small language of mobile distributed objects and system-wide references, uncommitted to any distributedsimulation protocol, but which can be executed as a distributed conservative simulation with automatic deduction of lookahead. We show how the MOSS programmer can control the dynamic distribution and locality of simulation objects by simple means which provide natural modelling functions. Preliminary results show how programmed locality can reduce communication costs in simulation.
A new partitioning method for synchronous PDES simulations is proposed. The method exploits characteristics of both the simulation method and of the application domain to arrive at efficient partitionings. A performan...
详细信息
A new partitioning method for synchronous PDES simulations is proposed. The method exploits characteristics of both the simulation method and of the application domain to arrive at efficient partitionings. A performance study shows that the method outperforms existing partitioning methods in terms of four different performance metrics.
This paper proposes a critical path-like analyzer to predict the amount of memory consumed in a specific Chandy-Misra simulation: Segments of code are inserted into the existing sequential simulation program, and this...
详细信息
This paper proposes a critical path-like analyzer to predict the amount of memory consumed in a specific Chandy-Misra simulation: Segments of code are inserted into the existing sequential simulation program, and this modified simulation program is called a memory analyzer. The amount of memory needed in the corresponding Chandy-Misra simulation is computed along with the execution of the memory analyzer. Experiments to evaluate the analyzer are in progress.
A Motif based graphical tool XTracker is described. XTracker can show Gannt-like charts of the activities on each node or it can show the event messages as traffic between simulation objects. XTracker can take its dat...
详细信息
A Motif based graphical tool XTracker is described. XTracker can show Gannt-like charts of the activities on each node or it can show the event messages as traffic between simulation objects. XTracker can take its data from sequential simulation runs and simulate a parallel execution under a number of simulation methods. XTracker can act as a performance modeling tool.
Memory management issues associated with Time Warp simulation are examined. The focus is on the discussion of parallelsimulation executing on a distributed memory computer. Software developed for such systems is char...
详细信息
Memory management issues associated with Time Warp simulation are examined. The focus is on the discussion of parallelsimulation executing on a distributed memory computer. Software developed for such systems is characterized by the fact that the dynamic memory is allocated from a pool memory that is shared by all of the processes at a given processor. In this connection, a new memory management protocol, pruneback, is presented which recovers space by discarding previous states and not by changing the local virtual time of one or more processes. An empirical study which suggests that using pruneback is significantly more effective that artificial rollback on a distributed memory computer is presented.
Many simulations in the natural sciences and engineering require the numerical solution of nonlinear differential equations. For this class of numerical methods, we propose an appropriate parallel computation model on...
详细信息
Many simulations in the natural sciences and engineering require the numerical solution of nonlinear differential equations. For this class of numerical methods, we propose an appropriate parallel computation model on distributed memory machines that supports the prediction of execution times. As a case study, we investigate the parallel implementation of the diagonal-implicitly iterated Runge-Kutta method, a solution method for stiff systems of ordinary differential equations. An implementation on the Intel iPSC/860 confirms the accuracy of the prediction model.
暂无评论