TWO-DIMENSIONALBEAT HAVE ACCELERATION SIMULATION*
Author(s) J. M. Kindel, D. W. Forslund, W. B. Mori et al. · 2016
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “simulation acceleration”
Author(s) J. M. Kindel, D. W. Forslund, W. B. Mori et al. · 2016
Cited by 0
Aric David Blumer, Peter Athanas, Robert Broadwater et al. · 2006
Cited by 0
M. Shoji, F. Hirose, S. Shimogori et al. · 2002
Behavioral simulation is faster than gate-level logic simulation, however the simulation speed is too slow for large systems. Simulation specific machines accelerate simulation by parallel processing. We developed the method to extract parallelism from behavioral descriptions for fast simulation utilizing these machines. We evaluated our methods utilizing CAD accelerator TP5000. By the extraction of the parallelism the simulation speed is accelerated by about 7 times.
Cited by 0
Han, Y., Paap, K.-L., Klaassen, B. · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · 1989
S.237-251
Cited by 1
W. Hintze · 1981
Cited by 0
Niklas Peinecke, Thomas Lueken, Bernd Korn · 2008
Modern enhanced and synthetic vision systems (EVS/SVS) often make use of the fusion of multi-sensor data. Thus there is a demand for simulated sensor data in order to test and evaluate those systems at an early stage. We describe an approach for simulating Lidar sensors based on using modern computer graphics hardware making heavy use of recent technologies like vertex and fragment shaders. This approach has been successfully used for simulating millimeter wave radar sensors before. It is shown that a multi sensor simulation suite integrating such different sensors like millimeter wave radar, Lidar or infrared can be realized using principally similar software techniques thus allowing for a unified comprehensive simulator. This approach allows us to use a single consistent data base for multi sensor fusion. Recent graphics hardware offers the possibility of carrying out a variety of tasks in the graphical processing unit (GPU) as opposed to the traditional approach of doing most computations in the computerpsilas CPU. Using vertex and fragment shaders makes these tasks particularly easy. We present a vertex shader solution written in GLSL, the OpenGL shading language. The program computes all necessary view transformations and shading information necessary for Lidar simulation in one pass. This allows high frame rates for real time simulations of even complex flight scenes.
Cited by 29
Byeong Min, Gwan Choi · Journal of Electronic Testing · 2000
Cited by 1
Knut Vaagsaether · Linköping electronic conference proceedings · 2018
This paper presents a combustion model and a simulation method for modeling flame acceleration (FA) and deflagration to detonation transition (DDT) in a premixed gas. The method is intended to produce the most important effects in FA and DDT without resolving the flame front on the computational mesh. The simulations presented here are of stoichiometric hydrogen-air mixtures in a channel with repeated obstacles. The channel is 2 m long and 110 mm wide, with a height of either 20 mm or 40 mm. The obstacles gives a blockage ratio of 0.5. These values are the same as for experiments by other researchers and is used for comparison. The combustion model combines a turbulent burning velocity model and a two-step Arrhenius kinetic rate. The simulations show similar flame speeds and pressures as seen in experiments, and the process of DDT is shown to be caused by shock focusing and shock flame interactions. The simulations show that the quasi detonation regime is a series of transition to detonation events followed by failure of the detonation. Results from both 2D and 3D simulations are presented, since the 2D simulations show how the method can reproduce important effects.
Cited by 1Open access
Kieran Hanahoe · Research Explorer (The University of Manchester) · 2018
Cited by 1Open access
J. M. Kindel, D. W. Forslund, W. B. Mori et al. · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1984
Finite laser beam particle simulations of beat wave acceleration show that a coherent plasma wave excited by two-colinear laser beams at a difference frequency equal to the plasma frequency can produce maximum electron energies as predicted by simple one-dimensional theory. The time to saturation and the saturation amplitude of the plasma wave electric field agrees with the Rosenbluth-Liu theory. Stimulated Raman scattering does not appear to degrade the electron acceleration process. Eventually self-focussing and filamentation limit the lifetime of the coherent plasma wave to tens of picoseconds for an intense CO/sub 2/ laser beam.
Cited by 0Open access
Hirohide Matsushima, Masashi Sakata, Ryō Suzuki · SAE technical papers on CD-ROM/SAE technical paper series · 2007
<div class="section abstract"><div class="htmlview paragraph">Motorcycles are vehicles regarding which users have extremely strong preferences, so riding comfort determines a large portion of their commercial value. In order to provide the high level of riding comfort sought by motorcycle owners, we must select the most effective settings for the engine and the drive train. This paper concerns fluctuations in longitudinal acceleration when a motorcycle is accelerated, which is one of the benchmarks for evaluating riding comfort. This phenomenon consists of fluctuations in longitudinal acceleration during acceleration that cause an uncomfortable feeling for the rider, so the fluctuations in acceleration must be moderate. In composing the simulation model, we modeled the entire drive train from the crankshaft to the tire into a model. By comparing the results of the simulation model and of field tests, we confirmed that it is possible to simulate fluctuations in the revolutions of the drive train. Based on the results of the simulation, it was possible to posit that fluctuations in the longitudinal acceleration were attributable to play in the dog clutch. We then employed that simulation model to study potential methods for reducing fluctuations in longitudinal acceleration during acceleration. We carried out sensitivity analysis by varying the mechanical properties of the drive train, such as moment of inertia, spring characteristics, and damping characteristics. As a result, we were able to conduct studies on potential improvement methods in various combinations prior to the field tests. We then conducted riding tests to confirm the effects of the improvement measures. We recorded the longitudinal body acceleration data during the riding tests with an accelerometer mounted on the fuel tank, and the effects of improvement were quantitatively confirmed. As a result, by conducting the necessary studies prior to carrying out field tests, we were able to focus on the most promising improvement method, and we were able to provide a far more comfortable riding feeling, thereby receiving a more positive rider's evaluation of longitudinal acceleration.</div></div>
Cited by 1
I. A. Zarafutdinov, Yulia A. Pityuk, Azamat R. Gainetdinov et al. · Communications in computer and information science · 2018
Cited by 1
Larry S. Fung, Mohamad Sindi, Ali H. Doğru · 2013
Abstract With the advent of the multi-core CPU, today’s commodity PC clusters are effectively a collection of interconnected parallel computers, each with multiple multi-core CPUs and large shared memory (RAM), connected together via high-speed networks. Each computer, referred to as a compute node, is a powerful parallel computer on its own. Each compute node can further be equipped with acceleration devices such as the GPGPU (general-purpose graphical processing unit) to further speed-up computational intensive portions of the simulator. Reservoir simulation methods which can exploit this heterogeneous hardware system can be used to solve very large-scale reservoir simulation models and run significantly faster than conventional simulators. Since typical PC clusters are essentially distributed share-memory computers, this suggests the mixed paradigm parallelism (distributed-shared memory) such as MPI-OMP should work well for computational efficiency and memory use. In this work, we compare and contrast the single paradigm programming models, MPI or OMP, with the mixed paradigm, MPI-OMP, programming model for a class of solver method which is suited for the different modes of parallelism. The results showed that the distributed memory (MPI-only) model has superior multi-compute-node scalability whereas the shared memory (OMP-only) model has superior parallel performance on a single compute node. However, it should be pointed out that mixed MPI-OMP model has more efficient memory use in the multi-core CPU architecture than the MPI-only model. To exploit the fine-grain shared memory parallelism available on the GPGPU architecture, algorithms should be suited to the single instruction multiple data (SIMD) parallelism and any recursive operations are serialized. Additionally, solver methods and data store needs to be reworked to coalesce memory access and to avoid shared memory bank conflicts. Wherever possible, the cost of data transfer through the PCI express bus between the CPU and GPGPU needs to be hidden via asynchronous communication. Recent published data comparing parallel performance for 11 parallel scientific applications indicates that the norm of the performance multiples obtained on the GPUs over the CPUs may only be a small fraction of their quoted peak performance ratios, Table 1. Often times, the achieved performance on a routine or code segments can be significantly better than the overall applications’ speedups which might have generated initial optimism. Of course, what can be achieved will strongly depend on the algorithms and methods of the respective applications. We applied multi-paradigm parallelism to accelerate compositional reservoir simulation on a GPU-equipped PC cluster. On a dual-CPU-dual-GPU compute node, the parallelized solver running on the dual-GPU Fermi M2090Q achieved up to 19 times speed-up over the serial CPU (1-core) results and up to 3.7 times speed-up over the parallel dual-CPU X5675 results in mixed MPI+OMP paradigm for a 1.728-million-cell compositional model. Parallel performance shows strong dependency on the subdomain sizes. Parallel CPU solve has higher performance for smaller domain partitions whereas GPGPU solve requires large partitions for good parallel performance. This is related to improved cache efficiency on the CPU for small subdomains and the loading requirement for massive parallelism on the GPGPU. Therefore, for a given model, the multi-node parallel performance decreases for the GPU relative to the CPU as the model is further subdivided into smaller subdomains to be solved on more compute nodes. To illustrate this, a modified SPE5 model with various grid dimensions was run to generate comparative results. Parallel performances for three field compositional models of various sizes and dimensions are included to further elucidate and contrast CPU-GPU single-node and multiple-node performances. A PC cluster with the Tesla M2070Q GPU and the 6-core Xeon X5675 Westmere was used to produce the majority of the reported results. Another PC cluster with the Tesla M2090Q GPU was available for some cases and the results are reported for the modified SPE5 problems for comparison.
Cited by 9
К. В. Лотов · Physical Review Special Topics - Accelerators and Beams · 2010
Proton beam driven plasma wakefield acceleration was recently proposed as a way to bring electrons to TeV energy range in a single plasma section. Here we present a detailed numerical analysis of this acceleration scheme. We identify the main effects limiting acceleration efficiency and ultimate energy gain, and formulate optimum conditions for acceleration.
Cited by 48Open access
Sommariva, Cristian, Nardon, Eric, Beyer, Peter et al. · arXiv (Cornell University) · 2018
Runaways are suprathermal electrons having sufficiently high energy to be continuously accelerated up to tens of MeV by a driving electric field [1]. Highly energetic runaway electron (RE) beams capable of damaging the tokamak first wall can be observed after a plasma disruption [2]. Therefore, it is of primary importance to fully understand their generation mechanisms in order to design mitigation systems able to guarantee safe tokamak operations. In a previous work, [3], a test particle tracker was introduced in the JOREK 3D non-linear MHD code and used for studying the electron confinement during a simulated JET-like disruption. It was found in [3] that relativistic electrons are not completely deconfined by the stochastic magnetic field taking place during the disruption thermal quench (TQ). This is due to the reformation of closed magnetic surfaces at the beginning of the current quench (CQ). This result was obtained neglecting the inductive electric field in order to avoid the unrealistic particle acceleration which otherwise would have happened due to the absence of collision effects. The present paper extends [3] analysing test electron dynamics in the same simulated JET-like disruption using the complete electric field. For doing so, a simplified collision model is introduced in the particle tracker guiding center equations. We show that electrons at thermal energies can become RE during or promptly after the TQ due to a combination of three phenomena: a first REs acceleration during the TQ due to the presence of a complex MHD-induced electric field, particle reconfinement caused by the fast reformation of closed magnetic surfaces after the TQ and a secondary acceleration induced by the CQ electric field.
Cited by 0Open access
S. Fedele, R. F. Timm · Journal of Engineering for Industry · 1973
The investigator using analog or hybrid computers in mechanism study encounters great complexity and a requirement for considerable equipment when a simulation is extended to accelerations and dynamics. This paper describes a resolver circuit which is a link analogy giving position, velocity, and acceleration terms in rectangular coordinates when driven with a voltage representing the angular acceleration of the link. It is an elaboration of former resolution methods dealing only with either position or velocity. Its utility involves a savings of computing components and it constitutes a fundamental building block when used in mechanism simulation.
Cited by 0
中村 恭志, T. Nakamura, M. shitamura et al. · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2016
Cited by 0
Jorge Miguel Raposeira Lagarto · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · 2011
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Cited by 0Open access
Surajit Das, Hetang Patel, Chandan Karfa et al. · 2024
Simulation-based verification of register transfer level (RTL) designs is a time-consuming process that can delay the time to market for new products. This work explores the use of machine learning (ML) to speed up RTL simulation. The authors first show that accurate ML models can be trained for common RTL modules, such as full adders, shift registers, arbiters, data transfer protocol, and parity checkers, using a small amount of data. We then present two case studies to demonstrate the applicability of our proposed ML models in RTL verification. The experimental results show that ML can be a promising technique for speeding up RTL simulation. To the best of our knowledge, this is the first work that applies ML to speed up RTL simulation.
Cited by 0
Philipp Andelfinger · 2011
Cited by 0