An application of finite field : Design and implementation of 128-bit instruction-based fast pseudorandom number generator
アクセス数 : 767 件
ダウンロード数 : 173 件
今月のアクセス数 : 8 件
今月のダウンロード数 : 3 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00017217
| File | |
| Title ( eng ) |
An application of finite field : Design and implementation of 128-bit instruction-based fast pseudorandom number generator
|
| Title ( jpn ) |
有限体の応用 : 128ビット命令に基づく高速擬似乱数生成期の設計と実装
|
| Creator | |
| Abstract |
(1)SIMD-oriented Mersenne Twister (SFMT)is a new pseudorandom number generator(PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD)operations. SFMT is designed and implemented on C lanuage with SIMD extensions and also implemented on standard C without SIMD.(2)Properties of SFMT are studied by using finite field theories, and they are shown to be equal or better than Mersenne Twister(MT), which is a widely used PRNG. (3)Generation speed of SFMT is measured on Intel Pentium M, Pentium IV, AMDA thlon64 and PowerPC G4. It is shown to be about two times faster than MT implemented using SIMD.
|
| Descriptions |
広島大学理学研究科 平成18年度 修士論文
|
| NDC |
Mathematics [ 410 ]
|
| Language |
eng
|
| Resource Type | master thesis |
| Publish Type | Author’s Original |
| Access Rights | open access |
| Date |
[Created] 2007-02-09
|
