Sciweavers

77 search results - page 1 / 16
» Efficient Parallel Pseudo-random Number Generation
Sort
View
ICCS
2001
Springer
13 years 9 months ago
On Parallel Pseudo-Random Number Generation
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
Chih Jeng Kenneth Tan
ICPP
2008
IEEE
13 years 11 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
13 years 9 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
DSD
2007
IEEE
140views Hardware» more  DSD 2007»
13 years 11 months ago
Pseudo-Random Pattern Generator Design for Column-Matching BIST
This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design meth...
Petr Fiser
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
13 years 6 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova