Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
Parker, J. (2003). Extensions and Optimizations to the Scalable, Parallel Random Number Generators Library. Retrieved from http://purl.flvc.org/fsu/fd/FSU_migr_etd-2236
This work will examine enhancements to the library for scalable, parallel pseudorandom number generation (SPRNG). SPRNG uses parameterization to produce many streams of random numbers with emphasis on parallel Monte Carlo methods. We extend the previous work to enable random access to these streams. This new method for generating streams improves both functionality and intuition of interface. Also considered are a few memory optimizations to the SPRNG library.
A Thesis Submitted to the Department of Computer Science in Partial Fulfillment of the Requirements for the Degree of Master of Science.
Bibliography Note
Includes bibliographical references.
Advisory Committee
Michael Mascagni, Professor Directing Thesis; Ashok Srinivasan, Committee Member; Alec Yasinsac, Committee Member; Robert van Engelen, Committee Member.
Publisher
Florida State University
Identifier
FSU_migr_etd-2236
Use and Reproduction
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.
Parker, J. (2003). Extensions and Optimizations to the Scalable, Parallel Random Number Generators Library. Retrieved from http://purl.flvc.org/fsu/fd/FSU_migr_etd-2236
