An efficient parallel algorithm for random sampling (Q1116335)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for random sampling |
scientific article; zbMATH DE number 4088927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for random sampling |
scientific article; zbMATH DE number 4088927 |
Statements
An efficient parallel algorithm for random sampling (English)
0 references
1989
0 references
A parallel algorithm for drawing an unbiased random sample of size M from a population of N elements where \(M\leq N\) is proposed. The algorithm runs in O(log M) time on a concurrent read, exclusive write (CREW) PRAM with M processors.
0 references
random sampling
0 references
parallel algorithm
0 references
CREW
0 references
PRAM
0 references
0 references
