dynamic hypercube topology distributed computing group动态超立方体拓扑的分布式计算组.ppt

dynamic hypercube topology distributed computing group动态超立方体拓扑的分布式计算组.ppt

ID:62380999

大小:1.77 MB

页数:26页

时间:2021-05-01

dynamic hypercube topology  distributed computing group动态超立方体拓扑的分布式计算组.ppt_第1页
dynamic hypercube topology  distributed computing group动态超立方体拓扑的分布式计算组.ppt_第2页
dynamic hypercube topology  distributed computing group动态超立方体拓扑的分布式计算组.ppt_第3页
dynamic hypercube topology  distributed computing group动态超立方体拓扑的分布式计算组.ppt_第4页
dynamic hypercube topology  distributed computing group动态超立方体拓扑的分布式计算组.ppt_第5页
资源描述:

《dynamic hypercube topology distributed computing group动态超立方体拓扑的分布式计算组.ppt》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、DynamicHypercubeTopologyStefanSchmidURAW2005UpperRhineAlgorithmsWorkshopUniversityofTübingen,Germany1Staticvs.DynamicNetworks(1)NetworkgraphG=(V,E)V=setofvertices(“nodes”,machines,peers,…)E=setofedges(“connections”,wires,links,pointers,…)“Traditional”,sta

2、ticnetworksFixedsetofvertices,fixedsetofedgesE.g.,interconnectionnetworkofparallelcomputersFatTreeTopologyParallelComputer2StefanSchmid,ETHZurich@URAW2005Staticvs.DynamicNetworks(2)DynamicnetworksSetofnodesand/orsetofedgesisdynamicHere:nodesmayjoinandleav

3、eE.g.,peer-to-peer(P2P)systems(Napster,Gnutella,…)DynamicChordTopology3StefanSchmid,ETHZurich@URAW2005DynamicPeer-to-PeerSystemsPeer-to-PeerSystemscooperationofmanymachines(tosharefiles,CPUcycles,etc.)usuallydesktopcomputersundercontrolofindividualusersus

4、ermayturnmachineonandoffatanytime=>ChurnHowtomaintaindesirablepropertiessuchasconnectivity,networkdiameter,nodedegree,...?4StefanSchmid,ETHZurich@URAW2005TalkOverviewModelIngredients:basicalgorithmsonhypercubegraphAssemblingthecomponentsResultsforthehyper

5、cubeConclusion,generalizationandopenproblemsDiscussion5StefanSchmid,ETHZurich@URAW2005Model(1):NetworkModelTypicalP2PoverlaynetworkVerticesv2V:peers(dynamic:mayjoinandleave)Directededges(u,v)2E:uknowsIPaddressofv(static)Assumption:Overlaynetworkbuildsupon

6、completeInternetgraphSendingamessageoveranoverlayedge=>routingintheunderlyingInternetgraph6StefanSchmid,ETHZurich@URAW2005Model(2):Worst-Case(Adversarial)DynamicsModelworst-casefaultswithanadversaryADV(J,L,)ADV(J,L,)hascompletevisibilityoftheentirestate

7、ofthesystemMayaddatmostJandremoveatmostLpeersinanytimeperiodoflength7StefanSchmid,ETHZurich@URAW2005Model(3):CommunicationRoundsOursystemissynchronous,i.e.,ouralgorithmsruninroundsOneround:receivemessages,localcomputation,sendmessagesHowever:Realdistribu

8、tedsystemsareasynchronous!But:Notionoftimenecessarytoboundtheadversary8StefanSchmid,ETHZurich@URAW2005OverviewofDynamicHypercubeSystemIdea:Arrangepeersintoasimulatedhypercubewhereeachnodeconsistsofseveral(logarithmi

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

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

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