Deterministic parallel random-number generation for dynamic-multithreading platforms

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2012, Pages 193-204

  Leiserson, Charles E ^a   Schardl, Tao B ^a   Sukha, Jim ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cilk; Determinism; Dynamic multithreading; Nondeterminism; Parallel computing; Pedigree; Random number generator

Indexed keywords

CILK; DETERMINISM; DYNAMIC MULTITHREADING; NON-DETERMINISM; PEDIGREE; RANDOM-NUMBER GENERATOR;

COMPUTER PROGRAMMING LANGUAGES; FLOW CONTROL; MICROPROCESSOR CHIPS; MULTITASKING; NUMBER THEORY; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; PARALLEL PROGRAMMING;

RANDOM NUMBER GENERATION;

EID: 84858389195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2145816.2145841     Document Type: Conference Paper

References (46)

1. E. Allen, D. Chase, J. Hallett, V. Luchangco, J.-W. Maessen, S. Ryu, G. L. S. Jr., and S. Tobin-Hochstadt. The Fortress Language Specification Version 1.0. Sun Microsystems, Inc., Mar. 2008.
2. R. Barik, Z. Budimlic, V. Cavè, S. Chatterjee, Y. Guo, D. Peixotto, R. Raman, J. Shirako, S. Ta̧sirlar, Y. Yan, Y. Zhao, and V. Sarkar. The Habanero multicore software research project. In OOPSLA, pp. 735- 736. ACM, 2009.
3. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. In CRYPTO, pp. 216-233. IACR, Springer-Verlag, 1999.
4. G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and J. Shun. Internally deterministic parallel algorithms can be fast. In PPoPP. ACM, 2012.
5. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. JACM, 46(5):720-748, 1999.
6. R. D. Blumofe and D. Papadopoulos. Hood: A user-level threads library for multiprogrammed multiprocessors. Technical Report, University of Texas at Austin, 1999.
7. R. L. Bocchino, Jr., V. S. Adve, S. V. Adve, and M. Snir. Parallel programming must be deterministic by default. In HOTPAR. USENIX, 2009.
8. M. D. Bond and K. S. McKinley. Probabilistic calling context. In OOPSLA, pp. 97-112. ACM, 2007.
9. R. G. Brown. Dieharder: A random number test suite. Available from http://www.phy.duke.edu/~rgb/General/dieharder.php Aug. 2011.
10. F. W. Burton and M. R. Sleep. Executing functional programs on a virtual tree of processors. In FPCA, pp. 187-194. ACM, Oct. 1981.
11. J. L. Carter and M. N. Wegman. Universal classes of hash functions. In STOC, pp. 106-112. ACM, 1977.
12. V. Cavé, J. Zhao, J. Shirako, and V. Sarkar. Habenero-Java: the new adventures of old X10. In PPPJ. ACM, 2011.
13. P. Charles, C. Grothoff, V. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar. X10: An object-oriented approach to non-uniform cluster computing. In OOPSLA, pp. 519- 538. ACM, 2005.
14. P. D. Coddington. Random number generators for parallel computers. Technical report, Northeast Parallel Architectures Center, Syracuse University, Syracuse, New York, 1997.
15. S. Contini, R. L. Rivest, M. J. B. Robshaw, and Y. L. Yin. The security of the RC6 block cipher. Available from http://people.csail.mit.edu/rivest/ publications.html 1998.
16. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
17. M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger. Polynomial hash functions are reliable. In ICALP, pp. 235-246. Springer-Verlag, 1992.
18. M. Feng and C. E. Leiserson. Efficient detection of determinacy races in Cilk programs. Theory of Computing Systems, 32(3):301- 326, 1999.
19. P. Frederickson, R. Hiromoto, T. L. Jordan, B. Smith, and T.Warnock. Pseudo-random trees in Monte Carlo. Parallel Computing, 1(2):175- 180, 1984.
20. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In PLDI, pp. 212-223. ACM, 1998. (Pubitemid 128454798)
21. M. Galassi, J. Davies, J. Theiler, B. Gough, G. Jungman, P. Alken, M. Booth, and F. Rossi. GNU Scientific Library Reference Manual, 1.14 edition, March 2010. Available from http://www.gnu.org/software/gsl/.
22. J. Gosling, B. Joy, G. Steele, and G. Bracha. The Java Language Specification. Addison Wesley, second edition, 2000.
23. R. H. Halstead, Jr. Implementation of Multilisp: Lisp on a multiprocessor. In LFP, pp. 9-17. ACM, 1984.
24. J. M. Hart. Windows System Programming. Addison-Wesley, third edition, 2004.
25. Y. He. Multicore-enabling discrete hedging in QuantLib. Available fromhttp://software.intel.com/en-us/articles/multicoreenabling-discrete-hedging- in-quantlib/Oct. 2009.
26. W. Hines and D. Montgomery. Probability and Statistics in Engineering and Management Science. J. Wiley & Sons, third edition, 1990.
27. Institute of Electrical and Electronic Engineers. Information technology - Portable Operating System Interface (POSIX) - Part 1: System application program interface (API) [C language]. IEEE Standard 1003.1, 1996 Edition.
28. Intel Corporation. Intel Cilk Plus Language Specification, 2010. Document Number: 324396-001US. Available from http://software.intel.com/sites/products/ cilk-plus/cilk-plus-language-specification.pdf.
29. D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, third edition, 1998.
30. D. Lea. A Java fork/join framework. In JAVA, pp. 36-43. ACM, 2000.
31. E. A. Lee. The problem with threads. Computer, 39:33-42, 2006. (Pubitemid 43786509)
32. D. H. Lehmer. Mathematical methods in large-scale computing units. In Second Symposium on Large-Scale Digital Calculating Machinery, volume XXVI of Annals of the Computation Laboratory of Harvard University, pp. 141-146, 1949.
33. D. Leijen and J. Hall. Optimize managed code for multi-core machines. MSDN Magazine, 2007. Available from http://msdn.microsoft.com/magazine/.
34. C. E. Leiserson. The Cilk++ concurrency platform. J. Supercomputing, 51(3):244-257, 2010.
35. M. Mascagni and A. Srinivasan. Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM TOMS, 26(3):436-461, 2000.
36. M. Matsumoto and T. Nishimura. Mersenne Twister: a 623- dimensionally equidistributed uniform pseudo-random number generator. ACM TOMACS, 8:3-30, 1998.
37. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, England, June 1995.
38. National Institute of Standards and Technology, Washington. Secure Hash Standard (SHS), 2008. Federal Information Standards Publication 180-3. Available fromhttp://csrc.nist.gov/publications/fips/fips180-3/fips180-3-final.pdf.
39. R. H. B. Netzer and B. P. Miller. What are race conditions? ACM LOPLAS, 1(1):74-88, March 1992.
40. OpenMP application program interface, version 3.0. Available from http://www.openmp.org/mp-documents/spec30.pdf, May 2008.
41. M. Pǎtra̧scu and M. Thorup. The power of simple tabulation hashing. In STOC, pp. 1-10. ACM, 2011.
42. J. Reinders. Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. O'Reilly Media, Inc., 2007.
43. R. L. Rivest, M. Robshaw, R. Sidney, and Y. Yin. The RC6 block cipher. Available at http://people.csail.mit.edu/rivest/publications.html 1998.
44. J. K. Salmon, M. A. Moraes, R. O. Dror, and D. E. Shaw. Parallel random numbers: as easy as 1, 2, 3. In SC, pp. 16:1-16:12. ACM, 2011.
45. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA, pp. 615-624. ACM/SIAM, 2004.
46. M. N. Wegman and L. Carter. New hash functions and their use in authentication and set equality. JCSS, 22(3):265-279, 1981.