Two fast implementations of the “minimal standard” random number generator
Communications of the ACM
A search for good multiple recursive random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
HGA: a hardware-based genetic algorithm
FPGA '95 Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays
Linear recurrences with carry as uniform random number generators
WSC '95 Proceedings of the 27th conference on Winter simulation
Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1
ACM Transactions on Mathematical Software (TOMS)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Bad subsequences of well-known linear congruential pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Uniform random number generators
Proceedings of the 30th conference on Winter simulation
Mixed Congruential Random Number Generators for Binary Machines
Journal of the ACM (JACM)
Uniform Random Number Generators
Journal of the ACM (JACM)
A new uniform pseudorandom number generator
Communications of the ACM
Fast combined multiple recursive generators with multipliers of the form a = ±2q ±2r
Proceedings of the 32nd conference on Winter simulation
A Hardware Implementation of a Genetic Programming System Using FPGAs and Handel-C
Genetic Programming and Evolvable Machines
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Some efficient random number generators for micro-computers
WSC '84 Proceedings of the 16th conference on Winter simulation
Synthesis of a Systolic Array Genetic Algorithm
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Compact FPGA-based True and Pseudo Random Number Generators
FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient multiply-with-carry random number generators with maximal period
ACM Transactions on Modeling and Computer Simulation (TOMACS)
FPGA implementation of genetic vector quantizers
Neurocomputing
Hi-index | 0.01 |
This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation unit that can map and execute meta-heuristic algorithms in hardware. The unit can be configured to implement one of the following five linear generator algorithms: a multiplicative congruential, a mixed congruential, a standard multiple recursive, a mixed multiple recursive, and a multiply-with-carry. The generation unit can be used both as a pseudorandom and a message passing-based server, which is able to produce pseudorandom numbers on demand, sending them to the network-on-chip blocks that originate the service request. The generator architecture has been mapped to a field programmable gate array, and showed that millions of numbers in 32-, 64-, 96-, or 128-bit formats can be produced in tens of milliseconds.