50,876 research outputs found
Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units
Basic uniform pseudo-random number generators are implemented on ATI Graphics
Processing Units (GPU). The performance results of the realized generators
(multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR,
RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The
obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX
generator is found to be the most appropriate for using on GPU in Monte Carlo
simulations. The brief review of the pseudo-random number generators used in
modern software packages for Monte Carlo simulations in high-energy physics is
present.Comment: 31 pages, 9 figures, 3 table
Global Spinors and Orientable Five-Branes
Fermion fields on an M-theory five-brane carry a representation of the double
cover of the structure group of the normal bundle. It is shown that, on an
arbitrary oriented Lorentzian six-manifold, there is always an Sp(2) twist that
allows such spinors to be defined globally. The vanishing of the arising
potential obstructions does not depend on spin structure in the bulk, nor does
the six-manifold need to be spin or spin-C. Lifting the tangent bundle to such
a generalised spin bundle requires picking a generalised spin structure in
terms of certain elements in the integral and modulo-two cohomology of the
five-brane world-volume in degrees four and five, respectively.Comment: 18 pages, LaTeX; v2: version to appear in JHE
A Comparative Study of Some Pseudorandom Number Generators
We present results of an extensive test program of a group of pseudorandom
number generators which are commonly used in the applications of physics, in
particular in Monte Carlo simulations. The generators include public domain
programs, manufacturer installed routines and a random number sequence produced
from physical noise. We start by traditional statistical tests, followed by
detailed bit level and visual tests. The computational speed of various
algorithms is also scrutinized. Our results allow direct comparisons between
the properties of different generators, as well as an assessment of the
efficiency of the various test methods. This information provides the best
available criterion to choose the best possible generator for a given problem.
However, in light of recent problems reported with some of these generators, we
also discuss the importance of developing more refined physical tests to find
possible correlations not revealed by the present test methods.Comment: University of Helsinki preprint HU-TFT-93-22 (minor changes in Tables
2 and 7, and in the text, correspondingly
Guaranteeing the diversity of number generators
A major problem in using iterative number generators of the form
x_i=f(x_{i-1}) is that they can enter unexpectedly short cycles. This is hard
to analyze when the generator is designed, hard to detect in real time when the
generator is used, and can have devastating cryptanalytic implications. In this
paper we define a measure of security, called_sequence_diversity_, which
generalizes the notion of cycle-length for non-iterative generators. We then
introduce the class of counter assisted generators, and show how to turn any
iterative generator (even a bad one designed or seeded by an adversary) into a
counter assisted generator with a provably high diversity, without reducing the
quality of generators which are already cryptographically strong.Comment: Small update
Generalized Sums over Histories for Quantum Gravity II. Simplicial Conifolds
This paper examines the issues involved with concretely implementing a sum
over conifolds in the formulation of Euclidean sums over histories for gravity.
The first step in precisely formulating any sum over topological spaces is that
one must have an algorithmically implementable method of generating a list of
all spaces in the set to be summed over. This requirement causes well known
problems in the formulation of sums over manifolds in four or more dimensions;
there is no algorithmic method of determining whether or not a topological
space is an n-manifold in five or more dimensions and the issue of whether or
not such an algorithm exists is open in four. However, as this paper shows,
conifolds are algorithmically decidable in four dimensions. Thus the set of
4-conifolds provides a starting point for a concrete implementation of
Euclidean sums over histories in four dimensions. Explicit algorithms for
summing over various sets of 4-conifolds are presented in the context of Regge
calculus. Postscript figures available via anonymous ftp at
black-hole.physics.ubc.ca (137.82.43.40) in file gen2.ps.Comment: 82pp., plain TeX, To appear in Nucl. Phys. B,FF-92-
- âŠ