448 search results - page 38 / 90 » On Parallel Pseudo-Random Number Generation |
193
click to vote
ISPAN
2002
IEEE
15 years 10 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
179
click to vote
HPDC
2006
IEEE
15 years 11 months ago
2006
IEEE
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
145
click to vote
CPAIOR
2006
Springer
15 years 9 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
152
click to vote
VLSISP
2008
15 years 5 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
137
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
The growing computational and storage needs of several scientific applications mandate the deployment of extreme-scale parallel machines, such as IBM’s Blue Gene/L which can acc...