DistributedSystems(3rd)英文无水印原版pdf第3版pdf所有页面使用FoxitReader、PDF-XChangeViewer、SumatraPDF和Firefox测试都可以打开本资源转载自网络,如有侵权,请联系上传者或csdn删除查看此书详细信息请在美国亚马逊官网搜索此书Copyright@2017MaartenvanSteenandAndrewS.TanenbaumPublishedbyMaartenvanSteenThisbookwaspreviouslypublishedby:PearsonEducation,IncISBN:978-15-430573-8-6(printedversion)ISBN:978-90-815406-2-9(digitalversion)Edition:3.Version:01(February2017)AllrightstotextandillustrationsarereservedbyMaartenvanSteenandAndrewS.Tanenbaum.Thisworkmaynotbecopied,reproduced,ortranslatedinwholeorpartwithoutwrittenpermissionofthepublisher,exceptforbriefexcerptsinreviewsorscholanyformofinformationstorageadaptationorwhatever,computersoftware,orbysimilarordissimilarmethodsnowknownordevelopedinthefutureisstrictlyforbiddenwithoutwrittenpermissionofthepublisherToMarielle,max,andelkeMVSToSuzanneBarbara,Marvin,Aronnathan,olivia,andmirteASTCONTENTSPreface1Introduction1.1Whatisadistributedsystem?Characteristic1:Collectionofautonomouscomputingelements2Characteristic2:SinglecoherentsystemMiddlewareanddistributedsystems1.2DesigngoalsSupportingresourcesharingMakingdistributiontransparent12Beingscalable15Pitfalls243Typesofdistributedsystems24Highperformancedistributedcomputing25Distributedinformationsystems34Pervasivesystems1.4Summary522Architectures552.1Architecturalstyles56Layeredarchitectures.57Object-basedandservice-orientedarchitectures62Resource-basedarchitectures64Publish-subscribearchitectures2.2MiddlewareorganizationWrappersInterceptors垂番Modifiablemiddleware752.3SystemarchitectureCONTENTSCentralizedorganizations76Decentralizedorganizations:peer-to-peersystemsHybridarchitectures2.4Examplearchitectures94TheNetworkFilesystem94TheWeb982.5Summary3Processes1033.1Threads..104Introductiontothreads104Threadsindistributedsystems1113.2Virtualization116Principleofvirtualizationapplicationofvirtualmachinestodistributedsystems,1223.3Clients124Networkeduserinterfaces124Client-sidesoftwarefordistributiontransparency1273.4Servers128Generaldesignissues129Objectservers133Example:TheApacheWebserver139Serverclusters,,,,,,,1413.5Codemigration152Reasonsformigratingcode152Migrationinheterogeneoussystems1583.6Summary1614Communication4.1Foundations164LayeredProtocols164TypesofCommunication.1724.2Remoteprocedurecall..173Basicrpcoperation174Parameterpassing178RPC-basedapplicationsupport182VariationsonrPc185Example:dCErPc,.1884.3Message-orientedcommunication193Simpletransientmessagingwithsockets.193Advancedtransientmessaging198Message-orientedpersistentcommunication206Example:IBM'sWebSpheremessage-queuingsystem212Example:AdvancedMessageQueuingProtocol(AMQP)....218DS3.01DOWNLOADEDBYTEWIGOMIXMAIL.INFOCONTENTS4.4Multicastcommunication221Application-leveltree-basedmulticasting221Flooding-basedmulticasting225Gossip-baseddatadissemination2294.5Summary2345Naming2375.1Names,identifiersandaddresses2385.2Flatnaming.241Simplesolutions241Home-basedapproaches245Distributedhashtables246Hierarchicalapproaches2515.3Structurednaming256Namespaces.256Nameresolution259Theimplementationofanamespace264Example:TheDomainNameSystem271Example:TheNetworkFileSystem2785.4Attribute-basednaming283Directoryservices283Hierarchicalimplementations:LDAP285Decentralizedimplementations2885.5Summary2946Coordination2976.1Clocksynchronization.298Physicalclocks299Clocksynchronizationalgorithms3026.2Logicalclocks310Lamport'slogicalclocks310Vectorclocks3166.3Mutualexclusion321322acentralizedalgorithm.322adistributedalgorithm323atoken-ringalgorithm.325adecentralizedalgorithm3266.4Electionalgorithms329Thebullyalgorithm.,..330Aringalgorithm332Electionsinwirelessenvironments333Electionsinlarge-scalesystems.3356.5Locationsystems336DOWNLOADEDBYTEWIGOMIXMAIL.INFODS301VIllCONTENTSGPS:GlobalPositioningSystem337WhengPsisnotanoption339Logicalpositioningofnodes3396.6Distributedeventmatching..343Centralizedimplementations3436.7Gossip-basedcoordination349asgregation349Apeer-samplingservice350Gossip-basedoverlayconstruction3526.8Summary3537Consistencyandreplication3557.1Introduction356Reasonsforreplication356Replicationasscalingtechnique3577.2Data-centricconsistencymodels358Continuousconsistency359Consistentorderingofoperations364Eventualconsistency3737.3Client-centricconsistencymodels375MonotonicreadsMonotonicwrites.379Readyourwrite380Writesfollowreads3827.4ReplicamanagementFindingthebestserverlocation383Contentreplicationandplacement..385Contentdistribution..388Managingreplicatedobjects3937.5Consistencyprotocols.396Continuousconsistency..........396Primary-basedprotocols398Replicated-writeprotocolsCache-coherence403Implementingclient-centricconsistency,,...4077.6Example:CachingandreplicationintheWeb4097.7Summar4208Faulttoleran4238.1Introductiontofaulttolerance424Basicconcepts.424Failuodels427Failuremaskingbyredundancy8.2Processresilience432DS3.01DOWNLOADEDBYTEWIGOMIXMAIL.INFO
2024/6/24 6:52:56 36.95MB Distributed Systems
1
该文档主要是elasticsearch7.x版本的安装及集群配置,配合head,ik插件的安装。
【备注,配置参数更新如下:cluster.name:es-7node.name:t-1network.host:10.96.141.45http.port:9200transport.tcp.port:9301node.master:truenode.data:truebootstrap.memory_lock:truediscovery.seed_hosts:["10.xx.xx.104:9300","10.xx.xx.45:9300","10.xx.xx.45:9301"]discovery.zen.minimum_master_nodes:2bootstrap.system_call_filter:falsecluster.initial_master_nodes:["10.xx.xx104","10.xx.xx.45"]#外网访问http.cors.enabled:truehttp.cors.allow-origin:"*"】
2024/6/22 13:01:09 7KB elasticsearch 集群
1
new-england10机39节点psat,simulink系统仿真,可更改预设数据。
2024/5/8 9:22:53 44KB new england
1
xilliixpciedma驱动(基于xilnxxdmaip核4.0的WDF驱动)---#XDMAWindowsDriverThisprojectisXilinx'ssampleWindowsdriverfor'DMA/BridgeSubsystemforPCIExpressv4.0'(XDMA)IP.*Pleasenotethatthisdriverandassociatedsoftwarearesuppliedtogiveabasicgenericreferenceimplementationonly.Customersmayhavespecificuse-casesand/orrequirementsforwhichthisdriverisnotsuitable.*###Dependencies*TargetmachinerunningWindows7orWindows10*DevelopmentmachinerunningWindows7(orlater)*VisualStudio2015(orlater)installedondevelopmentmachine*WindowsDriverKit(WDK)version1703(orlater)installedondevelopmentmachine##DirectoryStructure```/|__build/-Generateddirectorycontainingbuildoutputbinaries.|__exe/-Containssampleclientapplicationsourcecode.||__simple_dma/-SamplecodeforAXI-MMconfiguredXDMAIP.||__streaming_dma/-SamplecodeforAXI-STconfiguredXDMAIP.||__user_events/-Samplecodeforaccesstousereventinterrupts.||__xdma_info/-UtilityapplicationwhichprintsouttheXDMAcoreip||configuration.||__xdma_rw/-Utilityforreading/writingto/fromxdmadevicenodessuch||ascontrol,user,bypass,h2c_0,c2h_0etc.||__xdma_test/-BasictestapplicationwhichperformsH2C/C2Htransferson|allpresentchannels.|__inc/-ContainspublicAPIheaderfileforXDMAdriver.|__libxdma/-StatickernellibraryforXDMAIP.|__sys/-Referencedriversourcecodewhichuseslibxdma|__README.md-Thisfile.|__XDMA.sln-VisualStudioSolution.```
2024/5/1 17:41:35 86KB PCIE DRIVER DMA 驱动
1
ARange-BasedMonteCarloBoxAlgorithmforMobileNodesLocalizationinWSNs
2024/4/16 11:58:05 1.15MB 研究论文
1
HTTPS(SecureHypertextTransferProtocol)安全超文本传输协议它是一个安全通信通道,它基于HTTP开发,用于在客户计算机和服务器之间交换信息。
它使用安全套接字层(SSL)进行信息交换,简单来说它是HTTP的安全版。
在使用https协议不管是服务器端还是客户端都需要使用到ca证书来进行访问。
一般来说,性能测试为所常见的为客户端使用https打开页面的方式。
在这个情况下,首先是处理https访问过程中的证书1. 证书的准备常见的证书为:*.pfx格式,该种格式的证书可以通过双击运行安装到IE浏览器上。
用户在访问的时候就可以使用到。
但这种证书并不是LoadRunner所使用的类型,因此需要对其进行转换。
将其转换为*.pem格式。
转换方法如下: 安装openssl后 运行C:\/bin文件夹的openssl二进制文件,它将启动OpenSSL命令提示符 执行以下命令:pkcs12-inD:\test1.pfx-outD:\test01.pem–nodes 执行后,将会在指定目录生成test01.pem文件,这个文件将会在下一个步骤,对LoadRunner进行配置的时候使用到。
2.LR配置启动LoadRunner,打开RecordingOption选项。
留意红色框中的选项。
选择后,单击NewEnty红框中的配置为服务器的ip和端口号,按照测试所需要的实际地址进行配置就可以配置后,将Usespecifiedclient-sidecertificate[Base64/PEM]钩选,为使用客户端证书访问。
单击...选择刚刚转换生成的客户端证书。
如果你为证书有设置密码,在这里也需要输入。
到此为止所有与http区别的配置就完成了。
录制后,可以在脚本的开始,看到LoadRunner新生成的语句web_set_certificate_ex("CertFilePath=test01.pem", "CertFormat=PEM", "KeyFilePath=test01.pem", "KeyFormat=PEM", "Password=123456", "CertIndex=1", LAST);下面的操作和普通的页面性能测试一样。
2024/2/5 8:37:28 72KB Loadrunner 的HTTPS的测试配置
1
ThreeJS力导向图WebGL类使用强制定向的迭代布局在3维空间中表示图形数据结构。
将或用于基础物理引擎。
快速开始importThreeForceGraphfrom'three-forcegraph';要么varThreeForceGraph=require('three-forcegraph');甚至[removed][removed]然后varmyGraph=newThreeForceGraph().graphData();varmyScene=newTHREE.Scene();myScene.add(myGraph);...//onanimationframemyGraph.tickFrame();API参考方法描述默认graphData([数据])用于图形数据结构的Getter/setter(有关语法的详细信息,请参见下文)。
也可以用于应用。
{nodes:[],links:[]}
2024/1/13 10:10:50 56KB webgl threejs data-visualization d3js
1
usingSystem;usingSystem.Collections.Generic;usingSystem.ComponentModel;usingSystem.Data;usingSystem.Drawing;usingSystem.Text;usingSystem.Windows.Forms;usingSystem.Data.SqlClient;usingSystem.Configuration;namespacePhoneBook{publicpartialclassfrmMain:Form{publicfrmMain(){InitializeComponent();}privatestringstrConn=System.Configuration.ConfigurationManager.AppSettings["ConnectionString"];privatevoidfrmMain_Load(objectsender,EventArgse){LoadGroup();if(trvGroup.Nodes.Count>0){trvGroup.SelectedNode=trvGroup.Nodes[0];LoadList();}else{lvContact.Clear();}}privatevoidLoadGroup(){try{trvGroup.Nodes.Clear();SqlConnectionconn=newSqlConnection(strConn);SqlCommandcmd=newSqlCommand();cmd.Connection=conn;cmd.CommandText="selectdistinct组别from联系人where用户名='"+tsslUserName.Text+"'";conn.Open();SqlDataReadersdr=cmd.ExecuteReader();while(sdr.Read()){trvGroup.Nodes.Add(sdr[0].ToString());}sdr.Close();conn.Close();}catch{}}privatevoidLoadList(){if(trvGroup.Nodes.Count==0){lvContact.Clear();return;}if(trvGroup.SelectedNode.Index>=0){stringstrGroup=trvGroup.SelectedNode.Text;try{lvContact.Clear();lvContact.Columns.Add("姓名",100);lvContact.Columns.Add("工作
2023/12/9 9:50:34 1.54MB C# 管理系统
1
leetcodepython题解,包含大量leetcode题目的解法,源代码,python实现CourseSchedule21.4.4Numberofislands14.5HeapsMergeKSortedLinkedLists1.5.1KthLargestElementinanArray1.5.2Arrays1.62sum‖l1.62SumⅢ1.6.2ContainsDuplicate1.6.3RotateArray1.643SumSmaller1.653Sumclosest1.663Sum1.6.7TwoSum1.68PlusOne1.6.9BestTimetoBuyandSellStock1.6.10Shortestworddistance1.6.11Movezeroes1.6.12ContainsDuplicate1.6.13MajorityElement1.6.14RemoveDuplicatesfromSortedArray1.6.15NestedListWeightSum1.6.16NestedListWeightedSumIl1.6.17Removeelement1.6.18IntersectionofTwoArraysll1.6.19MergeSortedArrays1.6.20ReverseVowelsofaString1.6.21IntersectionofTwoArrays1.6.22Containerwithmostwater1.6.23ProductofArrayExceptSelf1.6.24TrappingRainWater1.6.25MaximumSubarray1.6.26BestTimetoBuyandSellStockIl1.6.27FindMinimuminRotatedSortedArray1.6.28Pascal'sTriangle1.6.29Pascal'sTriangle‖l1.6.30SummaryRanges1.6.31MissingNumber1.6.32StringsValidAnagram1.7.1Validpalindrome1.7.2WordPattern1.7.3ValidParentheses1.7.4IsomorphicStrings1.7.5ReverseString1.7.6BitManipulationSumofTwoIntegers18.1SingleNumber18.2Singlenumber‖18.3SingleNumberIll1.8.4Maths1.9ReverseInteger1.9.1Palindromenumber19.2Pow(x,n)19.3Subsets1.94Subsets‖195FractiontoRecurringDecimal19.6Excelsheetcolumnnumber19.7Excelsheetcolumntitle19.8FactorialTrailingzeros199HappyNumber1.9.10Countprimes1.9.11Plusone19.12DivideTwoIntegers19.13MultiplyStrings1.9.14MaxPointsonaline1.9.15ProductofArrayExceptSelf19.16Powerofthree19.17IntegerBreak1.9.18Poweroffour9.19Adddigits1.9.20UglyNumber1.9.21glyNumberll1.9.22SuperUglyNumber19.23FindKpairswithsmallestsums1.924SelfCrossing1.9.25Paintfence1.9.26Bulbswitcher19.27Nimgame1.9.28Matrix1.10RotateImage1.10.1SetmatrixZeroes1.10.2Searcha2DMatrix1.10.3Searcha2dMatrixl1.10.4SpiralMatrix1.10.5SpiralMatrix‖l1.10.6DesignLRUCache1.11.1IntroductionMyLeetcodeSolutionsinPythonThisbookwillcontainmysolutionsinPythontotheleetcodeproblems.Currently,willjusttrytoposttheacceptedsolutions.TheplanistoeventuallyincludedetailedexplanationsofeachandeverysolutionamdoingthisjustforfunLinkedListCycleLinkedListCvcleGivenalinkedlist,determineifithasacycleinitFollowup:Canyousolveitwithoutusingextraspace?Url:https://leetcode.com/problems/linked-list-cycle/Definitionforsingly-linkedlistclassListNodeobject)###definit(self,x)self,val=xself,nextNoneclassSolution(object):defhasCycle(self,head)IItypehead:ListNodertype:boolIIIIifhead=nonereturnfalseelsefastheadslow=headWhilefastnoneandfast.nextnonesloW=slownextfastfast.nextnextiffast=slow:breaki千fastNoneorfast.next=nonereturnFalseeliffast=slowreturntruereturnfalseLinkedListCycleReverseLinkedListReverseLinkedlistReverseasinglylinkedlistUrl:https://eetcode.com/problems/reverse-linked-list/definitionforsingly-linkedlist#tclassListNode(object):##def-init(self,x)self.∨al=xselfnextnoneclassSolution(object):defreverseList(self,head)11IIl1typehead:ListNodertype:ListNodeifhead=nonereturnnoneelifhead!=noneandheadnext=nonereturnheadelsetempNonenextnodenoneWhileheadNonenextnodeheadnexthead.nexttemptemp=headheadnextnodereturntempDeletenodeinalinkedlistDeletenodeinalinkedlistWriteafunctiontodeleteanode(exceptthetail)inasinglylinkedlist,givenonlyaccesstothatnodeSupposedthelinkedlistis1->2->3->4andyouaregiventhethirdnodewithvalue3,thelinkedlistshouldbecome1->2->4aftercallingyourfunctionUrl:https://eetcode.com/problems/delete-node-in-a-linked-list/Definitionforsingly-linkedlistclassListNode(object):#def-init(self,x)#self,valxself,nextNoneclasssolution(object):defdeleteNode(self,node):IIlIItypenode:ListNodertype:voidDonotreturnanythingmodifynodein-placeinsteadI111fnode=nonepasse⊥se:nextnodenode.nextnodevalnextnodevalnode.nextnextnode,next
2023/11/8 17:06:47 574KB leetcode python题解
1
2017年5月的新书,pdf版。
BookDescriptionInthissecondedition,youwillgettogripswiththelatestfeaturesofOpenStack.StartingwithanoverviewoftheOpenStackarchitecture,you'llseehowtoadopttheDevOpsstyleofautomationwhiledeployingandoperatinginanOpenStackenvironment.We'llshowyouhowtocreateyourownOpenStackprivatecloud.Thenyou'lllearnaboutvarioushypervisorsandcontainertechnologysupportedbyOpenStack.You'llgetanunderstandingaboutthesegregationofcomputenodesbasedonreliabilityandavailabilityneeds.We'llcovervariousstoragetypesinOpenStackandadvancednetworkingaspectssuchasSDNandNFV.Next,you'llunderstandtheOpenStackinfrastructurefromaclouduserpointofview.Movingon,you'lldeveloptroubleshootingskills,andgetacomprehensiveunderstandingofservicessuchashighavailabilityandfailoverinOpenStack.Finally,youwillgainexperienceofrunningacentralizedloggingserverandmonitoringOpenStackservices.ThebookwillshowyouhowtocarryoutperformancetuningbasedonOpenStackservicelogs.YouwillbeabletomasterOpenStackbenchmarkingandperformancetuning.Bytheendofthebook,you'llbereadytotakestepstodeployandmanageanOpenStackcloudwiththelatestopensourcetechnologies.
2023/10/4 15:22:45 15.29MB openstack
1
共 31 条记录 首页 上一页 下一页 尾页
在日常工作中,钉钉打卡成了我生活中不可或缺的一部分。然而,有时候这个看似简单的任务却给我带来了不少烦恼。 每天早晚,我总是得牢记打开钉钉应用,点击"工作台",再找到"考勤打卡"进行签到。有时候因为工作忙碌,会忘记打卡,导致考勤异常,影响当月的工作评价。而且,由于我使用的是苹果手机,有时候系统更新后,钉钉的某些功能会出现异常,使得打卡变得更加麻烦。 另外,我的家人使用的是安卓手机,他们也经常抱怨钉钉打卡的繁琐。尤其是对于那些不太熟悉手机操作的长辈来说,每次打卡都是一次挑战。他们总是担心自己会操作失误,导致打卡失败。 为了解决这些烦恼,我开始思考是否可以通过编写一个全自动化脚本来实现钉钉打卡。经过一段时间的摸索和学习,我终于成功编写出了一个适用于苹果和安卓系统的钉钉打卡脚本。
2024-04-09 15:03 15KB 钉钉 钉钉打卡