Developments in the field of supercomputing during the last couple of years showed that new classes of applications (The Grand Challenges) gain in importance that demand for new dimensions in computing power. The deve...
详细信息
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.< >
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.< >
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...
详细信息
ISBN:
(纸本)0818671203
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.< >
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 large number of variations of distributedsimulation protocols have been proposed in the literature. Their performances, however, could not be compared directly, due to different implementation strategies, different...
In the present paper, we present some experimental results about the parallel numerical simulation of a time dependent partial differential equation, the two dimensional nonlinear Schrodinger equation, on a message pa...
详细信息
In the present paper, we present some experimental results about the parallel numerical simulation of a time dependent partial differential equation, the two dimensional nonlinear Schrodinger equation, on a message passing parallel machine and using PVM on a cluster of Sparc-stations. An implicit finite difference method has been used to carry out the simulation. Some features about the different scaling models are explained. In spite of the fact that it is difficult to compare the two parallel computing environments, we give some results of the two implementations. We reach the conclusion that PVM on a workstation cluster is a good solution to solve large-scale problems.< >
This paper presents the results of an experimental study to evaluate the effectiveness of parallelsimulation in reducing the execution time of gate-level models of VLSI circuits. Specific contributions of this paper ...
详细信息
This paper presents the results of an experimental study to evaluate the effectiveness of parallelsimulation in reducing the execution time of gate-level models of VLSI circuits. Specific contributions of this paper include (i) the design of a gate-level parallel simulator that can be executed, without any changes on both distributed memory and shared memory parallel architectures, (ii) demonstrated speedups with both conservative and optimistic simulation protocols (almost all previous studies on circuit simulation have failed to extract speedups with conservative protocols); in particular we showed that a speedup of about 3 was obtained on 8 processors of a Sparc1000 for conservative algorithms and about 2 for optimistic algorithms for circuits in the ISCAS85 benchmark suite; and (iii) performance comparison between shared memory and distributed memory implementations of the simulator.< >
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.< >
An implementation of a conservative parallel simulator with deadlock avoidance is presented. Its performance when working with a realistic model of a message routing network is evaluated and contrasted against a seque...
详细信息
An implementation of a conservative parallel simulator with deadlock avoidance is presented. Its performance when working with a realistic model of a message routing network is evaluated and contrasted against a sequential simulator. Different factors that improve the performance of the parallelsimulation are discussed, focusing in the model under study and the available computer: a network of transputers. These factors are the load of the model being simulated, the grain size of the simulator and the simulator ability to exploit the lookahead property of the model.< >
暂无评论