اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpeeding up MadGraph5_aMC@NLO
128
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we will describe two new optimisations implemented in MadGraph5_aMC@NLO, both of which are designed to speed-up the computation of leading-order processes (for any model). First we implement a new method to evaluate the squared matrix element, dubbed helicity recycling, which results in factor of two speed-up. Second, we have modified the multi-channel handling of the phase-space integrator providing tremendous speed-up for VBF-like processes (up to thousands times faster).
قيم البحث
اقرأ أيضاً
MadGraph5_aMC@NLO is a software package that allows one to simulate processes of arbitrary complexity, at both the leading and the next-to-leading order perturbative accuracy, with or without matching and multi-jet merging to parton showers. It has b
een designed for, and so far primarily employed in the context of, hadronic collisions. In this note, we document the implementation of a few technical features that are necessary to extend its scope to realistic ee collider environments. We limit ourselves to discussing the unpolarized beam case, but we point out that the treatment of polarized beams is conceptually identical, and that the structure we set up can easily be extended to carry out simulations at muon colliders.
There are two distinct approaches to speeding up large parallel computers. The older method is the General Purpose Graphics Processing Units (GPGPU). The newer is the Many Integrated Core (MIC) technology . Here we attempt to focus on the MIC technol
ogy and point out differences between the two approaches to accelerating supercomputers. This is a user perspective.
We discuss how dynamical fermion computations may be made yet cheaper by using symplectic integrators that conserve energy much more accurately without decreasing the integration step size. We first explain why symplectic integrators exactly conserve
a ``shadow Hamiltonian close to the desired one, and how this Hamiltonian may be computed in terms of Poisson brackets. We then discuss how classical mechanics may be implemented on Lie groups and derive the form of the Poisson brackets and force terms for some interesting integrators such as those making use of second derivatives of the action (Hessian or force gradient integrators). We hope that these will be seen to greatly improve energy conservation for only a small additional cost and that their use will significantly reduce the cost of dynamical fermion computations.
We propose a method for slowing particles by laser fields that potentially has the ability to generate large forces without the associated momentum diffusion that results from the random directions of spontaneously scattered photons. In this method,
time-resolved laser pulses with periodically modified detunings address an ultranarrow electronic transition to reduce the particle momentum through repeated absorption and stimulated emission cycles. We implement a shortcut to adiabaticity approach that is based on Lewis-Riesenfeld invariant theory. This affords our scheme the advantages of adiabatic transfer, where there can be an intrinsic insensitivity to the precise strength and detuning characteristics of the applied field, with the advantages of rapid transfer that is necessary for obtaining a short slowing distance. For typical parameters of a thermal oven source that generates a particle beam with a central velocity on the order of meters per second, this could result in slowing the particles to near stationary in less than a millimeter. We compare the slowing scheme to widely-implemented slowing techniques that rely on radiation pressure forces and show the advantages that potentially arise when the excited state decay rate is small. Thus, this scheme is a particularly promising candidate to slow narrow-linewidth systems that lack closed cycling transitions, such as occurs in certain molecules.
We perform a detailed analysis of the C++ implementation of the Cluster Affiliation Model for Big Networks (BigClam) on the Stanford Network Analysis Project (SNAP). BigClam is a popular graph mining algorithm that is capable of finding overlapping c
ommunities in networks containing millions of nodes. Our analysis shows a key stage of the algorithm - determining if a node belongs to a community - dominates the runtime of the implementation, yet the computation is not parallelized. We show that by parallelizing computations across multiple threads using OpenMP we can speed up the algorithm by 5.3 times when solving large networks for communities, while preserving the integrity of the program and the result.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
