disk-to–disk parallel sorting on hpvm clusters running windows ntnew

disk-to–disk parallel sorting on hpvm clusters running windows ntnew

ID:34449870

大小:450.78 KB

页数:69页

时间:2019-03-06

disk-to–disk parallel sorting on hpvm clusters running windows ntnew_第1页
disk-to–disk parallel sorting on hpvm clusters running windows ntnew_第2页
disk-to–disk parallel sorting on hpvm clusters running windows ntnew_第3页
disk-to–disk parallel sorting on hpvm clusters running windows ntnew_第4页
disk-to–disk parallel sorting on hpvm clusters running windows ntnew_第5页
资源描述:

《disk-to–disk parallel sorting on hpvm clusters running windows ntnew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、cCopyrightbyLuisFelipeRivera-Alvarez,2000DISK-TO-DISKPARALLELSORTINGONHPVMCLUSTERSRUNNINGWINDOWSNTBYLUISFELIPERIVERA-ALVAREZIngen.,UniversidadNacionalAutonomadeMexico,1995THESISSubmittedinpartialful llmentoftherequirementsforthedegreeofMasterofScienceinCo

2、mputerScienceintheGraduateCollegeoftheUniversityofIllinoisatUrbana-Champaign,2000Urbana,IllinoisAbstractInordertomeasuredatabaseperformanceofcomputersystems,acollectionofcompaniesand1universitiesde nedthreebenchmarksin1985,includingadisk-to-disksortofonemil

3、lionrecords,whichbecameastandardfordatabasesystems.Afterthe rstocialresultforthisbenchmarkin1986,performancesteadilyimprovedeachyearthereafter.In1996thebestsystemsfortheDatamationSortweremultiprocessors,andsince1997clustersofworkstationshavedominatedthesed

4、isk-to-disksortingbenchmarks.Weexplorethebene ts,performancelimitations,andkeyarchitecturalissuesinvolvedinachievinghighperformanceindisk-to-disksorting.ThetestbedforthisworkwastheNCSANT-Supercluster,aclusterofPentium-IIworkstationsrunningWindowsNTandtheHPV

5、Msoft-waresuite.WeselectedtheMinuteSortbenchmark,whichrequiresthesortingofasmanyrecordsaspossibleinoneminute,astheperformancebenchmarkbecauseito eredtheclearestopportunityforcomparison.OurworkbuildsontheBerkeleyNOWSort,adaptedandtunedfortheNT-Superclusteran

6、demployingthehighspeedcommunicationoftheFMlayer(FastMessages,fromtheHPVMsystem).TheMPI-FMlibrarywasusedasthecommunicationAPI,sinceito eredalmostalltheunderlyingFMperformanceandsimpli edtheprogramminge ort,givenitshighlevelcommunicationandsynchronizationprim

7、itives.Usingaonepasssortarchitecture,ourMinuteSortbenchmarksorts10.3GBin56.51seconds2on60nodesoftheNTSupercluster,makingitthefastestknownMinuteSort.Eachmachineintheclustercomprisedtwo300MHzPentiumII's,512MBofmemory,anda4.3GB10000RPMUltraSCSIdisk.Thesystemwa

8、sabletosustain480MB/sofaggregatebandwidthfordatainput1NamedDatamationSortafteritwaspublishedintheDatamationmagazine.2AsofApril1999.iii(read)and660MB/sofaggregatebandwidthfordataoutput(write).Theprimary

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

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

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