[DBPP] previous next up contents index [Search]
Next: Exercises Up: 10 Random Numbers Previous: 10.3 Distributed Random Generators

10.4 Summary

In this chapter, we have shown how one commonly used sequential random number generator, the linear congruential method, can be adapted for parallel execution. This example shows how parallel computation can introduce new issues even in apparently simple problems. In the case of random numbers, these issues include reproducibility, scalability, the preservation of randomness, and the greater number of random values consumed when executing on many processors.



[DBPP] previous next up contents index [Search]
Next: Exercises Up: 10 Random Numbers Previous: 10.3 Distributed Random Generators

© Copyright 1995 by Ian Foster