An efficient parallel algorithm for random sampling
type: Item
instance of: scholarly article
title: An efficient parallel algorithm for random sampling
zbMATH Open document ID: 0665.68033
DOI: 10.1016/0020-0190(89)90206-8
author: S. H. Smith
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 4088927
zbMATH Keywords: random sampling
zbMATH Keywords: parallel algorithm
zbMATH Keywords: CREW
zbMATH Keywords: PRAM
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90206-8
OpenAlex ID: W2127463195
cites work: Q4773298
cites work: Sorting in \(c \log n\) parallel steps
cites work: Correction: Parallel Merge Sort
cites work: Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital Computers
cites work: An efficient algorithm for random sampling without replacement
cites work: Tight Bounds on the Complexity of Parallel Sorting
cites work: Q3935355
cites work: Q3783528
cites work: Two efficient algorithms for random sampling without replacement
cites work: Faster methods for random sampling
description: scientific article; zbMATH DE number 4088927