Generating parallel quasirandom sequences via randomization

Journal of Parallel and Distributed Computing

Volumn 67, Issue 7, 2007, Pages 876-881

  Chi, Hongmei ^a,b   Jones, Edward L ^b  

^a FLORIDA STATE UNIVERSITY   (United States)

^b FLORIDA A AND M UNIVERSITY   (United States)

Author keywords

Parallel computing; Quasi Monte Carlo; Randomization; Scrambling

Indexed keywords

MONTE CARLO METHODS; NATURAL SCIENCES COMPUTING; QUALITY OF SERVICE;

HALTON SEQUENCE; PARALLEL SEQUENCES; RANDOMIZATION; SCRAMBLING;

PARALLEL PROCESSING SYSTEMS;

EID: 34249729452     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.04.004     Document Type: Article

References (29)

1. Braaten E., and Weller G. An improved low-discrepancy sequence for multidimensional quasi-monte carlo integration. J. Comput. Phys. 33 (1979) 249-258
2. Bromley B.C. Quasirandom number generators for parallel Monte Carlo algorithms. J. Parallel Distributed Comput. 38 1 (1996) 101-104
3. H. Chi, P. Beerli, Quasi-Markov chain Monte Carlo to improve inference of population genetic parameters, Math. Comput. Simulation, 2007.
4. Chi H., Mascagni M., and Warnock T. On the optimal Halton sequences. Math Comput Simulation 70 1 (2005) 9-21
5. Cranley R., and Patterson T. Randomization of number theoretic methods for multiple integration. SIAM J. Numer. Anal. 13 6 (1976) 904-914
6. Fox B. Implementation and relative efficiency of quasirandom sequence generators. ACM Trans. Math. Software 12 (1986) 362-376
7. Halton J., and Smith G. Algorithm 247: radical-inverse quasi-random point sequence. Comm. ACM 7 (1964) 701-702
8. Hong H.S., and Hickernell F.J. Algorithm 823: implementing scrambled digital sequences. ACM Trans. Math. Software 29 2 (2003) 95-109
9. Kocis L., and Whiten W. Computational investigations of low discrepancy sequences. ACM Trans. Math. Software 23 (1997) 266-294
10. Li Y., and Mascagni M. Analysis of large-scale grid-based Monte Carlo applications. Internat. J. High Performance Comput. Appl. 17 4 (2003) 369-382
11. K. Liu, F.J. Hickernell, A scalable low discrepancy point generator for parallel computing, in: Lecture Notes in Computer Science 3358, vol. 3358, Springer, Berlin, 2004, pp. 257-262.
12. Loh W.L. On the asymptotic distribution of scrambled net quadrature. Ann. Statist. 31 (2003) 1282-1324
13. Mascagni M., and Chi H. On the scrambled Halton sequences. Monte Carlo Methods Appl. 10 (2004) 435-442
14. Mascagni M., and Chi H. Parallel linear congruential generators with Sophie-Germain moduli. Parallel Comput. 30 (2004) 1217-1231
15. Mascagni M., and Srinivasan A. Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM Trans. Math. Software 26 (2000) 436-461
16. 2-discrepancy for anchored boxes. J. Complexity 14 (1998) 527-556
17. Niederreiter H. Low-discrepancy and low-dispersion sequences. J. Number Theory 30 (1988) 51-70
18. Niederreiter H. Random Number Generation and Quasi-Monte Carlo methods (1992), SIAM, Philadephia
19. A.B. Owen, Randomly Permuted (t, m, s)-Nets and (t, s)-Sequences, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, 106 in Lecture Notes in Statistics, vol. 106, 1995, pp. 299-317.
20. Owen A.B. Halton sequences avoid the origin. SIAM Rev. 48 (2006) 487-503
21. Papageorgiou A., and Traub J. Beating Monte Carlo. RISK 9 (1997) 63-65
22. Schmid W., and Uhl A. Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Math. Comput. Simulation 55 1-3 (2001) 249-257
23. Shaw J. A quasirandom approach to integration in bayesian statistics. Ann. Statist. 16 (1988) 895-914
24. Spanier J., and Maize E. Quasirandom methods for estimating integrals using relatively small sampling. SIAM Rev. 36 (1994) 18-44
25. Tezuka S. Uniform Random Numbers, Theory and Practice (1995), Kluwer Academic Publishers, IBM Japan
26. Tezuka S., and Faure H. I-binomial scrambling of digital nets and sequences. J. Complexity 19 6 (2003) 744-757
27. Tezuka S., and Tokuyama T. A note on polynomial arithmetic analogue of Halton sequences. ACM Trans. Modelling Comput. Simulation 4 (1994) 279-284
28. Wang X., and Fang K.T. The effective dimension and quasi-Monte Carlo. J. Complexity 19 2 (2003) 101-124
29. T. Warnock, Effective error estimates for quasi-Monte Carlo computations, Uncertainty Quantification Working Group and Related Special Seminars, 〈http://public.lanl.gov/kmh/uncertainty/meetings/warnvgr.pdf, 2002〉.