Tony Warnock

A new class of random number generators required for advanced computer architectures. Revision 1

Download

An algorithm for uniform random sampling of points in and on a hypersphere

Information Processing Letters, Jul 1, 1985

Download

Factorization, invariant measure, and random selection of matrices in SU(n) and other groups

Journal of Computational Physics, Oct 1, 1985

Matrices of the group SU(n) are parameterized in several ways by a system of generalized polar co... more

A new class of random number generators required for advanced computer architectures. Revision 1

This is the fiial report of a three-year, Laboratory-Directed Research and Development (LDRD) pro... more This is the fiial report of a three-year, Laboratory-Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL). The advent of ever more powerful computers allows one to run Monte Carlo computations of unprecedented length. Currently used random number generators (RNGs) do not have the cycle length necessary for these computations. It is possible to cycle completely through most RNGs used on workstations in a few minutes computations. Even having a long period may not qualify a RNG as suitable. We are developing tests that will allow us to develop high quality RNGs for use in long computations.

Download

Tools for measuring software performance vector architectures

Description/Abstract Two tools were developed to measure the performance of FORTRAN and CAL codes... more

An algorithm for uniform random sampling of points in and on a hypersphere

Information Processing Letters, Jul 1, 1985

Factorization, invariant measure, and random selection of matrices in SU(n) and other groups

Journal of Computational Physics, Oct 1, 1985

Matrices of the group SU(n) are parameterized in several ways by a system of generalized polar co... more

Bits and pieces: constructing chess endgame databases on parallel and vector architectures

Applied Numerical Mathematics, May 1, 1993

Wendroff, B., T. Warnock, L. Stiller, D. Mayer and R. Brickner, Bits and pieces: constructing che... more Wendroff, B., T. Warnock, L. Stiller, D. Mayer and R. Brickner, Bits and pieces: constructing chess endgame databases on parallel and vector architectures, Applied Numerical Mathematics 12 (1993) 285-295. An endgame database for chess encodes optimal lines of play for a specific endgame involving a small number of pieces. The computation of such a database is feasible for as many as six pieces provided the inherent parallelism in the problem is fully exploited. Two computer architectures which can do this are the SIMD CM-2 and the vector multiprocessor YMP. For each machine the computer programs operate on sets of chess positions, each position represented by a single bit. The high-level algorithm is an iterative backtracking

Download

The Deconfinement Transition and MCRG

… results and theory, 1985

Pseudorandom number generator for massively parallel molecular-dynamics simulations

Physical Review E, 1994

A class of uniform pseudorandom number generators is proposed for modeling and simulations on mas... more

Distributed sensor networks for detection of mobile radioactive sources

IEEE Transactions on Nuclear Science, 2004

... Robert J. Nemzek, Jared S. Dreicer, David C. Torney, and Tony T. Warnock ... Currently propos... more

QCD on a Cray: The Masses of Elementary Particles

CRAY-1 Instruction Analysis: A Comparison of Two Methods

In an effort to obtain data for workload characterization and performance evaluation studies, sta... more In an effort to obtain data for workload characterization and performance evaluation studies, statistics were gathered on the frequencies of individual instructions in codes executing on the Cray-1. Two methods were used for the collection of data: (1) direct dynamic counting of executing instructions and (2) sampling of instructions at regular intervals during execution of the code. This paper describes the implementation of both methods and compares the results obtained. We conclude that because the Cray-1 is a vector processor, the sampling technique produces skewed results that misrepresent the workload being examined. Therefore, although it is easier to implement, sampling produces inaccurate results and is an invalid approach to performance evaluation studies on a vector computer. The counting of instructions provides a valuable profile of instruction frequencies and is a stable basis on which to build performance estimations.

Monte Carlo calculations of elementary particle properties

Random-Number Generators by Tony Warnock

R andom numbers have applications in many areas: simulation, game-playing, cryptography, statisti... more R andom numbers have applications in many areas: simulation, game-playing, cryptography, statistical sampling, evaluation of multiple integrals, particletransport calculations, and computations in statistical physics, to name a few. Since each application involves slightly different criteria for judging the “worthiness” of the random numbers generated, a variety of generators have been developed, each with its own set of advantages and disadvantages. Depending on the application, three types of number sequences might prove adequate as the “random numbers.” From a purist point of view, of course, a series of numbers generated by a truly random process is most desirable. This type of sequence is called a random-number sequence, and one of the key problems is deciding whether or not the generating process is, in fact, random. A more practical sequence is the pseudo-random sequence, a series of numbers generated by a deterministic process that is intended merely to imitate a random sequ...

Download

Search Tables in Computer Chess

ICGA Journal

E Beyond the Naive Mass Spectrum

Phys Lett B, 1985

Computational Investigations of Low-Discrepancy Point Sets**This work received financial support from National Science Foundation Grants GB-16665 and GJ171 and National Aeronautics and Space Administration Grant NGL 50-002-001

Applications of Number Theory to Numerical Analysis, 1972

The non-perturbative beta-function and scaling for the SU(3) lattice gauge theory

by Tony Warnock and Apoorva Patel

Phys Lett B, 1985

We present a detailed analysis of the non-perturbative beta-function along the Wilson axis for th... more We present a detailed analysis of the non-perturbative beta-function along the Wilson axis for the SU(3) pure gauge theory using the Monte Carlo renormalization group method. The scaling behavior of the string tension, the deconfinement transition temperature and the 0++ glueball mass obtained from published data are compared. The results show that there is no asymptotic scaling KF ≡ 6/g2

QCD on a Cray: The Masses of Elementary Particles

Los Alamos Sci, 1984

Uploads

Papers by Tony Warnock

Log In