Related papers: A common scheme for running NLO ep event generator…
We describe a Common Lisp package suitable for the high-level design, specification, simulation, and instrumentation of real-time distributed algorithms and hardware on which to run them. We discuss various design decisions around the…
A discrete-event simulation (DES) involves the execution of a sequence of event handlers dynamically scheduled at runtime. As a consequence, a priori knowledge of the control flow of the overall simulation program is limited. In particular,…
This paper describes a user-friendly frontend to a Fortran program that integrates coupled nonlinear ordinary differential equations. The user interface is built using the NeXTstep Interface Builder, together with a public-domain graphical…
To harness the potential of advanced computing technologies, efficient (real time) analysis of large amounts of data is as essential as are front-line simulations. In order to optimise this process, experts need to be supported by…
Sequential algorithms are popular for experimental design, enabling emulation, optimisation and inference to be efficiently performed. For most of these applications bespoke software has been developed, but the approach is general and many…
This paper considers a practical mobile edge computing (MEC) system, where edge server does not pre-install the program required to perform user offloaded computing tasks. A partial program offloading (PPO) scheme is proposed, which can…
Achieving fault-tolerance will require a strong relationship between the hardware and the protocols used. Different approaches will therefore naturally have tailored proof-of-principle experiments to benchmark progress. Nevertheless,…
In these proceedings we report our progress in the development of the publicly available C++ library NJet for accurate calculations of high-multiplicity one-loop amplitudes. As a phenomenological application we present the first complete…
We review the methods developed for combining the parton shower approximation to QCD with fixed-order perturbation theory, in such a way as to achieve next-to-leading-order (NLO) accuracy for inclusive observables. This has made it possible…
Jet cross sections can be in principle compared to simple pQCD calculations, based on the hypothesis of factorization. But often it is useful or even necessary to not only compute the production rate of the very high pt jets, but in…
High energy physics detectors can be described hierarchically from the different subsystems to their divisions in r, phi, theta and to the individual readout channels. An identification schema that follows the logical decomposition of the…
C++ code snippets from a multi-core parallel memory-efficient crossover for genetic programming are given. They may be adapted for separate generation evolutionary algorithms where large chromosomes or small RAM require no more than M + (2…
Merging the benefits of an NLO calculation with event generators is a topic of current interest. Among other things, it is advantageous to be able to generate unweighted events according to NLO matrix elements. I report on an algorithm…
We present a program allowing for the construction of a heavy ion Monte Carlo event using a general purpose proton--proton event generator of the users' choice to deliver sub--collisions. In this heavy ion event, one or more jets can be…
We present a method to combine next-to-leading order (NLO) matrix elements in QCD with leading logarithmic parton showers by applying a suitably modified version of the phase-space-slicing method. The method consists of subsuming the NLO…
We discuss an extension of matrix element plus parton shower merging at leading and next-to-leading order. The algorithm does preserve inclusive cross sections at the respective input order. This constraint avoids potentially large…
Coding over subsets (known as generations) rather than over all content blocks in P2P distribution networks and other applications is necessary for a number of practical reasons such as computational complexity. A penalty for coding only…
We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the…
Heterogeneous computing is becoming mainstream in all scopes. This new era in computer architecture brings a new paradigm called Accelerator Level Parallelism (ALP). In ALP, accelerators are used concurrently to provide unprecedented levels…
Stochastic algorithms are efficient approaches to solving machine learning and optimization problems. In this paper, we propose a general framework called Splash for parallelizing stochastic algorithms on multi-node distributed systems.…