Results 1 - 10
of
33
A fast algorithm for online placement and reorganization of replicated data
- In Proceedings of the 17th International Parallel & Distributed Processing Symposium (IPDPS 2003
, 2003
"... As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as a system as it grows from a few disks to hundreds or thousands. A client using our algorithm can locate a data object in ..."
Abstract
-
Cited by 40 (8 self)
- Add to MetaCart
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as a system as it grows from a few disks to hundreds or thousands. A client using our algorithm can locate a data object in microseconds without consulting a central server or maintaining a full mapping of objects or buckets to disks. Despite requiring little global configuration data, our algorithm is probabilistically optimal in both distributing data evenly and minimizing data movement when new storage is added to the system. Moreover, our algorithm supports weighted allocation and variable levels of object replication, both of which are needed to permit systems to efficiently grow while accommodating new technology. 1
SPRNG: A Scalable Library for Pseudorandom Number Generation
"... In this article we present background, rationale, and a description of the Scalable Parallel Random
Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not conside ..."
Abstract
-
Cited by 38 (6 self)
- Add to MetaCart
In this article we present background, rationale, and a description of the Scalable Parallel Random
Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods such as the leap-frog or blocking methods. We describe in detail
parameterized versions of the following pseudorandom number generators: (i) linear congruential
generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators. We briey describe
the methods, detail some advantages and disadvantages of each method, and recount results from
number theory that impact our understanding of their quality in parallel applications.
SPRNG was designed around the uniform implementation of dierent families of parameterized random number
generators. We then present a short description of
SPRNG. The description contained within this
document is meant only to outline the rationale behind and the capabilities of SPRNG. Much more
information, including examples and detailed documentation aimed at helping users with putting
and using SPRNG on scalable systems is available at the URL:
http://sprng.cs.fsu.edu/RNG. In this description of SPRNG we discuss the random number generator library as well as the suite of
tests of randomness that is an integral part of SPRNG. Random number tools for parallel Monte
Carlo applications must be subjected to classical as well as new types of empirical tests of ran-
domness to eliminate generators that show defects when used in scalable environments.
Testing Parallel Random Number Generators
"... . A parallel random number generator (PRNG) must be tested for two types of correlations -- (i) Intra-stream correlation, as for any serial generator, and (ii) Inter-stream correlation for correlations between random number streams on different processes. Since bounds on these correlations are diffi ..."
Abstract
-
Cited by 23 (1 self)
- Add to MetaCart
(Show Context)
. A parallel random number generator (PRNG) must be tested for two types of correlations -- (i) Intra-stream correlation, as for any serial generator, and (ii) Inter-stream correlation for correlations between random number streams on different processes. Since bounds on these correlations are difficult to prove mathematically, large empirical tests are necessary. Many of the popular RNGs in use today were tested when computational power was much lower, and hence they were evaluated with much smaller. This paper describes several tests of PRNGs, both statistical and physicallybased tests. We show defects in several popular generators. We then present the results for the tests conducted on the SPRNG generators. These generators have passed some of the largest empirical random number tests ever undertaken. 1 Introduction Monte Carlo (MC) computations have, currently do, and will continue to consume a large fraction of all available high-performance computing cycles. MC methods can be de...
Random Number Generators for Parallel Applications
- in Monte Carlo Methods in Chemical Physics
, 1998
"... this article is devoted, because these com1 putations require the highest quality of random numbers. The ability to do a multidimensional integral relies on properties of uniformity of n-tuples of random numbers and/or the equivalent property that random numbers be uncorrelated. The quality aspect i ..."
Abstract
-
Cited by 18 (7 self)
- Add to MetaCart
(Show Context)
this article is devoted, because these com1 putations require the highest quality of random numbers. The ability to do a multidimensional integral relies on properties of uniformity of n-tuples of random numbers and/or the equivalent property that random numbers be uncorrelated. The quality aspect in the other uses is normally less important simply because the models are usually not all that precisely specified. The largest uncertainties are typically due more to approximations arising in the formulation of the model than those caused by lack of randomness in the random number generator. In contrast, the first class of applications can require very precise solutions. Increasingly, computers are being used to solve very well-defined but hard mathematical problems. For example, as Dirac [1] observed in 1929, the physical laws necessary for the mathematical theory of a large part of physics and the whole of chemistry are completely known and it is only necessary to find precise methods for solving the equations for complex systems. In the intervening years fast computers and new computational methods have come into existence. In quantum chemistry, physical properties must be calculated to "chemical accuracy" (say 0.001 Rydbergs) to be relevant to physical properties. This often requires a relative accuracy of 10
Random Number Generators with Period Divisible by a Mersenne Prime
- Proc. ICCSA 2003
, 2003
"... Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of ..."
Abstract
-
Cited by 16 (5 self)
- Add to MetaCart
(Show Context)
Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of a Mersenne prime. These generators are based on "almost primitive" trinomials, that is trinomials having a large primitive factor. They enable very fast vector/parallel implementations with excellent statistical properties.
Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms
"... Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be built into the runtime system to enable efficient deterministic parallel randomnumber generation. Experiments with the open- ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
(Show Context)
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be built into the runtime system to enable efficient deterministic parallel randomnumber generation. Experiments with the open-source MIT Cilk runtime system show that the overhead for maintaining pedigrees is negligible. Specifically, on a suite of 10 benchmarks, the relative overhead of Cilk with pedigrees to the original Cilk has a geometric mean of less than 1%. We persuaded Intel to modify its commercial C/C++ compiler, which provides the Cilk Plus concurrency platform, to include pedigrees, and we built a library implementation of a deterministic parallel random-number generator called DOTMIX that compresses the pedigree and then “RC6-mixes ” the result. The statistical quality
Parallel implementation of stochastic simulation for large-scale cellular processes
- In: Proceedings of the 8th International Conference on High-Performance Computing in Asia-Pacific Region
, 2005
"... Abstract ..."
(Show Context)
Linear and Inversive Pseudorandom Numbers for Parallel and Distributed Simulation
- In Twelfth Workshop on Parallel and Distributed Simultation PADS'98, May 26th - 29th
, 1998
"... In this work we discuss the use and possible abuse of linear and inversive pseudorandom numbers (PRNs) in parallel and distributed environments. After an investigation of properties of PRNs which determine how these may be applied in such environments we introduce a software package which provides a ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
In this work we discuss the use and possible abuse of linear and inversive pseudorandom numbers (PRNs) in parallel and distributed environments. After an investigation of properties of PRNs which determine how these may be applied in such environments we introduce a software package which provides an unified and easy-to-use approach to the generating and handling of parallel streams of such PRNs. Experimental results are conducted which describe the features of the software package and compare the performance of two selected types of pseudorandom number generators. 1 Introduction Parallel and distributed simulation of discrete event systems has received significant attention since the proliferation of massively parallel and distributed computing platforms [17]. Besides event processing, state update, statistics collection, and many more tasks, random number generation is an important element of every simulation experiment. Whereas the main objective in the parallel and distributed sim...
Fast and reliable random number generators for scientific computing
- PROC. PARA'04 WORKSHOP ON THE STATE-OF-THE-ART INSCIENTIFIC COMPUTING
, 2004
"... Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent sta ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and consider how to combine two or more generators to give a better (though usually slower) generator.
Parallel computation in econometrics: A simplified approach
- College, University of Oxford
, 2004
"... ..."
