滞后斐波那契随机数生成器中的种子数
谁能告诉我滞后斐波那契随机数生成器中的种子数量作为典型滞后斐波那契参数的函数，我真的很感激一张图表来说明随机数生成器的工作原理
Can any one tell me the number of seeds in lagged fibonacci random number generator as a function of typical lagged fibonacci parameters, I would really appreciate a diagram to illustrate the working of the random number generator
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
Brent，它包含了当时矢量超级计算机上的实现概述。本文构成了 boost::random Fibonacci 生成器的基础，因此您可以通过检查 boost 源来了解现代实现的样子。
不过，我不太确定这个问题与 cuda 或并行编程有什么关系。
The design and properties of Fibonacci generators are discussed in the widely cited paper by Brent, and it includes an overview of implementation on a vector supercomputer of the time. This paper forms the basis of the boost::random Fibonacci generators, so you can see what a modern implementation looks like by inspecting the boost source.
I am not quite sure what this question has to do with cuda or parallel programming, though.