Daniel V. Pryor

Learn More
We study the suitability of the additive lagged-Fibonacci pseudorandom number generator for parallel computation. This generator has relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. These diierent full-period cycles are called equivalence(More)
Splash 2 is an attached parallel processor in which the computing eZements are user programmable FPGA devices. The architecture of Splash 2 is designed to accelerate the solution of problems which exhibit at least modest amounts of temporal or data parallelism. Applications are developed b y writing descrzplions of algorithms in VHDL, which are then(More)
Recent work has established that for certain classes of nonlinear boundary value problems, the number of Newton iterations applied to the related standard discrete problem for a given tolerance is independent of the mesh size when the mesh is sufficiently fine. This paper develops an extension of the mesh independence principle by relaxing the assumption on(More)
We describe in detail the parallel implementation of a family of additive lagged-Fibonacci pseudorandom number generators. The theoretical structure of these generators is exploited to preserve their well-known randomness properties and to provide a parallel system of distinct cycles. The algorithm presented here solves the reproducibility problem for a far(More)
This paper describes an application implemented on a simulated machine called Horizon. One purpose of this study is to investigate some of the features of a possible future machine (or class of machines) with a view toward deciding, early on in the research cycle, where problems may come up, what features should be added or strengthened, and what proposed(More)
A fully vectorized version of a 1-dimensional Monte Carlo algorithm applied to molecular aerodynamics is presented. The algorithm is applied to the Rayleigh problem, an impulsively accelerated, heated flat plate, and is implemented on the CYBER 205. Issues relating to the details of vectorization, including the use of bit addressability, the maintaining of(More)
We summarize some of the recent developments of our research group and of other groups in the design and analysis of pseudorandom number generators for massively parallel computers. The three parallelization techniques we will consider in detail for mapping pseudorandom streams onto distinct parallel processes are: 1. Splitting maximal-period generators'(More)
Ensuring that pseudorandom number generators have good randomness properties is more complicated in a multiprocessor implementationthan in the uniprocessor case. We discuss simple extensions of uniprocessor testing for SIMD parallel streams, and develop in detail a repeatability test for the SPMD paradigm. Examples of the application of these tests to an(More)
At the Supercomputing Research Center we have built a compute farm consisting of 16 SPARCStation ELCs. The ELCs all support the Mether distributed shared memoryy13], which has primitives to support eecient synchronization and use of the network and processorss14]. Mether does not support the traditional consistency semantics provided by, e.g., Ivyy12] or(More)