Robustness of the simulation mechanism is a requirement for acceptability of distributedsimulation environments. We consider complex and erratic distributed conservative simulations, using colliding pucks as a guidin...
详细信息
ISBN:
(纸本)1565550277
Robustness of the simulation mechanism is a requirement for acceptability of distributedsimulation environments. We consider complex and erratic distributed conservative simulations, using colliding pucks as a guiding example. A new mechanism is introduced which allows logical processes to cooperate locally and advance. Advance is made through the collective selection of the next event in a group of logical processes. the algorithm demonstrates scalability through the locality of its determination. A description and proof of correctness is given. the effectiveness of the cooperative acceleration mechanism is illustrated with measurements on road traffic and colliding pucks simulations.
the field of parallel discrete event simulation is entering a period of self-assessment. Fifteen years of investigation has witnessed great strides in techniques for efficiently executing discrete event simulations on...
详细信息
ISBN:
(纸本)1565550277
the field of parallel discrete event simulation is entering a period of self-assessment. Fifteen years of investigation has witnessed great strides in techniques for efficiently executing discrete event simulations on parallel and distributed machines. Still, the discrete event simulation community at large has failed to recognize many of these results. the central question is, why has this occurred? One possible reason is an apparent disagreement in boththe focus and objectives of the parallel discrete event simulation research community (primarily computer scientists) and the discrete event simulation community (a widely diverse group including, operations researchers, management scientists, mathematicians, and statisticians, as well as computer scientists). An examination of parallel discrete event simulation from a modeling methodological perspective illustrates some of these differences and reveals potentials for their resolution.
Accelerating discrete event simulation can be achieved by using parallel architectures. the use of dedicated hardware is a possible alternative in some special domains like logic simulation. However, few studies have ...
详细信息
ISBN:
(纸本)1565550277
Accelerating discrete event simulation can be achieved by using parallel architectures. the use of dedicated hardware is a possible alternative in some special domains like logic simulation. However, few studies have focused on general *** paper presents an innovative solution using a recent hardware technology called FPGA (Field Programmable Gate Array), that enables dynamic synthesis of application specific hardware. Each node of an MIMD parallel machine is tightly coupled to an FPGA ring. this ring allows us to synthesize application specific global operatorsand control or communication circuits and complements the possibilities of the original machine on a wide application spectrum. We present the first results obtained in the simulation field with an eight node prototype.
One of the significant difficulties in partitioning logic circuits for distributedsimulation is the lack of a priori knowledge concerning the evaluation frequency of individual circuit elements. A number of researche...
详细信息
ISBN:
(纸本)1565550277
One of the significant difficulties in partitioning logic circuits for distributedsimulation is the lack of a priori knowledge concerning the evaluation frequency of individual circuit elements. A number of researchers have resorted to pre-simulation to estimate these evaluation frequencies. In this paper we empirically investigate the wisdom of relying on presimulation results, and evaluate the degree to which early evaluation frequencies predict later evaluation frequencies. the results show that, for simulations that use random input vectors, pre-simulation has clear merit in predicting circuit element evaluation frequency. this supports the use of pre-simulation as an input to circuit partitioning algorithms.
A great deal of research in the area of distributed discrete event simulation has focussed on evaluating the performance of variants of conservative and optimistic methods on different types of applications. Applicati...
详细信息
ISBN:
(纸本)1565550277
A great deal of research in the area of distributed discrete event simulation has focussed on evaluating the performance of variants of conservative and optimistic methods on different types of applications. Application characteristics like lookahead, communication patterns, etc. have been found to affect the suitability of a specific protocol to simulate a given model. For many systems, it may be the case that different subsystems possess contradictory characteristics such that whereas some subsystems may be simulated efficiently using a conservative protocol, others may be more amenable to optimistic methods. Furthermore, the suitability of a protocol for a given subsystem may change dynamically. We propose a parallelsimulation protocol that allows different parts of a system to be simulated using different protocols, allowing these protocols to be switched dynamically. A proof of correctness is presented, along with some preliminary performance discussion.
In this paper we discuss the application of domain decomposition methods to circuit simulation. this coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a works...
详细信息
ISBN:
(纸本)1565550277
In this paper we discuss the application of domain decomposition methods to circuit simulation. this coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a workstation cluster. Our results show that with a cluster of ten powerful RISC workstations comparable turn around times to a supercomputer can be achieved. Furthermore a workstation cluster offers the possibility to simulate electric circuits with a size of new magnitude. On a cluster of 27 workstations we succeeded in simulating a circuit with 135000 transistors, while we failed to simulate the same circuit on our supercomputer because of a lack of memory.
In this contribution an implemented prototype of an object server on a parallel computer is described. In the first phase a model iras been proposed and simulated in Ada'95. Based on obtained experiences with run-...
详细信息
ISBN:
(纸本)0818681489
In this contribution an implemented prototype of an object server on a parallel computer is described. In the first phase a model iras been proposed and simulated in Ada'95. Based on obtained experiences with run-time features of the simulation program a corresponding prototype has been implemented in C++, tested, and the obtained results have been compared with results of the simulation.
In Time Warp optimistic discrete event simulation, there exists a need to occasionally save the states of the logical processes. the state saving often constitutes a substantial overhead. However it is not necessary t...
详细信息
ISBN:
(纸本)1565550277
In Time Warp optimistic discrete event simulation, there exists a need to occasionally save the states of the logical processes. the state saving often constitutes a substantial overhead. However it is not necessary to save each state of a logical process since states can be restored from earlier states by re-executing intermediate events. In this paper, we analyse the effects of doing the state saving less frequently and present a method that allows each logical process to adapt its state saving interval to its rollback behaviour. Experimental results indicate that the proposed method improves performance of the Time Warp system.
distributed systems deliver a cost-effective and scalable solution to the increasing performance intensive applications by utilizing several shared resources. Gang scheduling is considered to be an efficient time-spac...
详细信息
distributed systems deliver a cost-effective and scalable solution to the increasing performance intensive applications by utilizing several shared resources. Gang scheduling is considered to be an efficient time-space sharing scheduling algorithm for parallel and distributed systems. In this paper we examine the performance of scheduling strategies of jobs which are bags of independent gangs in a heterogeneous system. A simulation model is used to evaluate the performance of bag of gangs scheduling in the presence of high priority jobs implementing migrations. the simulation results reveal the significant role of the implemented migration scheme as a load balancing factor in a heterogeneous environment. Another significant aspect of implementing migrations presented in this paper is the reduction of the fragmentation caused in the schedule by gang scheduled jobs and the alleviation of the performance impact of the high priority jobs. (C) 2010 Elsevier Inc. All rights reserved.
暂无评论