Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be built into the runtime system to enable efficient deterministic parallel random-number generation. Experiments with the open...
Main Authors: | Leiserson, Charles E. (Contributor), Sukha, Jim (Contributor), Schardl, Tao Benjamin (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2016-01-19T18:37:33Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On-the-fly pipeline parallelism
by: Lee, I-Ting Angelina, et al.
Published: (2014) -
Executing dynamic data-graph computations deterministically using chromatic scheduling
by: Leiserson, Charles E., et al.
Published: (2016) -
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
by: Kaler, Timothy, et al.
Published: (2018) -
Extending the applicability of deterministic multithreading
by: Nowack, Vesna
Published: (2016) -
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
by: Leiserson, Charles E., et al.
Published: (2016)