An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs

dc.contributor.author Cong, Guojing
dc.contributor.author Bader, David A.
dc.date.accessioned 2007-05-15T21:45:03Z
dc.date.available 2007-05-15T21:45:03Z
dc.date.issued 2006-02-25
dc.description.abstract We compare parallel algorithms for random permutation generation on symmetric multiprocessors (SMPs). Algorithms considered are the sorting-based algorithm, Anderson's shuffling algorithm, the dart-throwing algorithm, and Sanders' algorithm. We investigate the impact of synchronization method, memory access pattern, cost of generating random numbers and other parameters on the performance of the algorithms. Within the range of inputs used and processors employed, Anderson's algorithm is preferable due to its simplicity when random number generation is relatively costly, while Sanders' algorithm has superior performance due to good cache performance when a fast random number generator is available. There is no definite winner across all settings. In fact we predict our new dart-throwing algorithm performs best when synchronization among processors becomes costly and memory access is relatively fast. We also compare the performance of our parallel implementations with the sequential implementation. It is unclear without extensive experimental studies whether fast parallel algorithms beat efficient sequential algorithms due to mismatch between model and architecture. Our implementations achieve speedups up to 6 with 12 processors on the Sun E4500. en
dc.description.sponsorship This work was supported in part by NSF Grants CAREER ACI-00-93039, NSF DBI-0420513, ITR ACI-00- 81404, DEB-99-10123, ITR EIA-01-21377, Biocomplexity DEB-01-20709, and ITR EF/BIO 03-31654; and DARPA Contract NBCH30390004. en
dc.identifier.uri http://hdl.handle.net/1853/14385
dc.language.iso en_US en
dc.publisher Georgia Institute of Technology en
dc.relation.ispartofseries CSE Technical Reports; GT-CSE-06-06 en
dc.subject Parallel algorithms en
dc.subject Random permutation en
dc.subject Symmetric multiprocessors (SMPs) en
dc.subject Synchronization en
dc.title An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs en
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.contributor.corporatename School of Computational Science and Engineering
local.relation.ispartofseries College of Computing Technical Report Series
local.relation.ispartofseries School of Computational Science and Engineering Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isOrgUnitOfPublication 01ab2ef1-c6da-49c9-be98-fbd1d840d2b1
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
relation.isSeriesOfPublication 5a01f926-96af-453d-a75b-abc3e0f0abb3
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
617.85 KB
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
1.86 KB
Item-specific license agreed upon to submission