towards an optimal bit-reversal permutation program

towards an optimal bit-reversal permutation program

ID:34083890

大小:621.74 KB

页数:10页

时间:2019-03-03

towards an optimal bit-reversal permutation program_第1页
towards an optimal bit-reversal permutation program_第2页
towards an optimal bit-reversal permutation program_第3页
towards an optimal bit-reversal permutation program_第4页
towards an optimal bit-reversal permutation program_第5页
资源描述:

《towards an optimal bit-reversal permutation program》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、TowardsanOptimalBit-ReversalPermutationProgramLarryCarterandKangSuGatlincarter,kgatlin@cs.ucsd.eduDepartmentofComputerScienceandEngineering,UCSD9500GilmanDrive,LaJolla,CA,92093-0114AbstractThus,forinstance,r(01101)=10110,andr(ab)=r(b)r(a).Thespeedofmanycomputationsisli

2、mitednotbytheArrayswillbeindexedbybinarystrings.Thepseudo-numberofarithmeticoperationsbutbythetimeittakestocodestatementªfori=0toN-1ºmeansthatiit-moveandrearrangedataintheincreasinglycomplicatederatesthroughallbinarystringsoflengthlg(N),wherelgmemoryhierarchiesofmodern

3、computers.Arraytrans-representslogbasetwo.poseandthebit-reversalpermutation±trivialoperationsConsiderthefollowingthreeprograms,whereNisaonaRAM±presentnon-trivialproblemswhendesigningpowerof2,N=N1N2,andAandBarearraysoflengthhighly-tunedscienti®clibraryfunctions,particul

4、arfortheN:FastFourierTransform.WeproveapreciseboundforRo-Col,asimplepebble-typegamethatisrelevanttoimple-Copy(A,B):mentingthesepermutations.WeuseRoColtogivelowerfori=0toN-1boundsontheamountofmemorytraf®cinacomputerwithB[i]=A[i]four-levelsofmemory(registers,cache,TLB,an

5、dmemory),takingintoaccountsuchªmessyºfeaturesasblockmovesTranspose(A,B):andset-associativecaches.Theinsightsfromthisanalysisfori=0toN1-1leadtoabit-reversalalgorithmwhoseperformanceiscloseforj=0toN2-1tothetheoreticalminimum.ExperimentsshowitperformsB[j,i]=A[i,j]signi®ca

6、ntlybetterthaneveryprograminacomprehensivestudyof30publishedalgorithms.BitReverse(A,B):fori=0toN-1B[r(i)]=A[i]1.BackgroundandrelatedworkIntheRandomAccessMachine(RAM)modelofcom-putation[AHU74],allthreeprogramshavethesamecom-Givenbinarystringsaandb,letabdenotetheirplexit

7、y,(N).IfweonlycountthecostofLoadsandStoresconcatenationandr(a)denotethereversalofa.ofarrayelements(i.e.,weassumethatalladdressingandCopyright1998IEEE.PublishedintheProceedingsofloopingcomputationsarefree)theneachofthesepermuta-FOCS'98,8-11November1998inPaloAlto,CA.Per-

8、tionshascomplexityexactly2N.sonaluseofthismaterialispermitted.However,per-Yetinpractice,inthemindsofpeoplewhowritehig

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。