会员注册 | 登录 | 微信快捷登录 支付宝快捷登录 QQ登录 微博登录 | 帮助中心 人人文库renrendoc.com美如初恋!
站内搜索 百度文库

热门搜索: 直缝焊接机 矿井提升机 循环球式转向器图纸 机器人手爪发展史 管道机器人dwg 动平衡试验台设计

29-Slave Memories and Dynamic Storage Allocation.pdf29-Slave Memories and Dynamic Storage Allocation.pdf -- 5 元

宽屏显示 收藏 分享

资源预览需要最新版本的Flash Player支持。
您尚未安装或版本过低,建议您

IEEETRANSACTIONSONELECTRONICCOMPUTERSTherangeof,isfrom0to27r.Therootsofsareconfinedby4R0SqLI4L2Thesqsareusedtocalculatetheresiduesforthefinalsolution.Theuseofthedifferenceequationsapproachreducesthedifficultpartoftheproblemtosolving28insteadofaninvolvedprocedureofdiagonalizinganmbymmatrix.Thusthecomputertimebecomesextremelyshortandinexpensiveformofathousandorgreater,andcalculationratherthenmeasurementbecomesmuchmorepractical.SlaveMemoriesandDynamicStorageAllocationM.V.WILKESSUMMARYTheuseisdiscussedofafastcorememoryof,say,32000wordsasaslavetoaslowercorememoryof,say,onemillionwordsinsuchawaythatinpracticalcasestheeffectiveaccesstimeisnearerthatofthefastmemorythanthatoftheslowmemory.INTRODUCTIONInthehierarchicstoragesystemsusedatpresent,corememoriesarebackedupbymagneticdrumsordiskswhichare,intheirturn,backedupbymagnetictape.Inthesesystemsitisnaturalandefficientforinformationtobemovedinandoutofthecorememoryinblocks.Thesituationisverydifferent,however,whenafastcorememoryisbackedupbyalargeslowcorememory,sincebothmemoriesaretrulyrandomaccessandthereisnolatencytimeproblem.Thetimespentintransferringtothefastmemorywordsofaprogramwhicharenotusedinasubsequentrunningissimplywasted.Iwishinthisnotetodrawattentiontotheuseofafastmemoryasaslavememory.ByaslavememoryImeanonewhichautomaticallyaccumulatestoitselfwordsthatcomefromaslowermainmemory,andkeepsthemavailableforsubsequentusewithoutitbeingnecessaryforthepenaltyofmainmemoryaccesstobeincurredagain.Sincetheslavememorycanonlybeafractionofthesizeofthemainmemory,wordscannotbepreservedinitindefinitely,andtheremustbewiredintothesystemanalgorithmbywhichtheyareprogressivelyoverwritten.Infavorablecircumstances,however,agoodproportionofthewordswillsurvivelongenoughtobeusedonsubsequentoccasionsandadistinctgainofspeedresults.Theactualgaindependsonthestatisticsoftheparticularsituation.Slavememorieshaverecentlycomeintoprominenceasawayofreducinginstructionaccesstimeinanotherwiseconventionalcomputer.2Asmall,veryhighspeedmemoryof,say,32words,accumulatesinstructionsastheyaretakenoutofthemainmemory.Sinceinstructionsoftenoccurinsmallloopsaquiteappreciablespeedingupcanbeobtained.Onemethodofdesigningaslavememoryforinstructionsisasfollows.Supposethatthemainmemoryhas64KwordswhereK1024and,therefore,16addressbits,andthattheslavememoryhas32wordsand,therefore,5addressbits.Theslavememoryisconstructedwithawordlengthequaltothatofthemainmemoryplus11extrabits,whichwillbereferredtoastagbits.Aninstructionextractedfromregisterrofthemainmemoryiscopiedintoregisterrmod32oftheslavememoryand,atthesametime,the11mostManuscriptreceivedNovember30,1964.TheworkreportedinthisnotewassupportedinpartbyProjectMAC,aMassachusettsInstituteofTechnology,Cambridge,researchprogram,sponsoredbytheAdvancedResearchProjectsAgency,Dept.ofDefense,underOfficeofNavalResearchContractNo.Nonr410201.TheauthoriswiththeUniversityMathematicalLab.,Cambridge,England.1Takahashi,S.,H.Nishino,K.Yoshihiro,andK.Fuchi,SystemdesignoftheETLMk6computers.InformationProcessing1962Proc.IFIPCongress62,Amsterdam,TheNetherlandsNorthHollandPublishingCo.,1963,p690.2FerrantiComputingSystemsAtlas2,LondonFerrantiLtd.,1963.significantbitsofrarecopiedintothe11tagbits.Forexample,supposer10259,thatis,320.2519.Theinstructionfromthisregisteriscopiedintoregister19oftheslaveandthenumber320iscopiedintothetagbitsofthatregister.Wheneveraninstructionisrequired,theslaveisfirstexaminedtoseewhetheritalreadycontainsthatinstruction.Thisisdonebyaccessingtheregisterthatmightcontaintheinstructionnamely,registerrmod32,andexaminingthetagbitstoseewhethertheyareequaltothe11mostsignificantdigitsofr.Iftheyare,theinstructionistakenfromtheslaveotherwise,itisobtainedfromthemainmemoryandacopyleftintheslave.Ifthesystemistopreservefullfreedomfortheprogrammertomodifyinstructionsintheaccumulator,itisnecessarythateverytimeawritingoperationistotakeplace,theslaveshallbeexaminedtoseewhetheritcontainsthewordabouttobeupdated.Ifitdoes,thenthewordmustbeupdatedintheslaveaswellasinthemainmemory.LARGESLAVEMEMORYSofartheslaveprinciplehasbeenappliedtoverysmallsuperspeedmemoriesassociatedwiththecontrolofacomputer.Therewould,however,appeartobepossibilitiesintheuseofanormalsizedcorememoryasaslavetoalargecorememory,andIwillnowdiscussvariouswaysinwhichthismightbedone.Ishallbeconcernedprimarilywithacomputersystemdesignedforonlinetimesharinginwhichalargenumberofuserprogramsareheldinauxiliarystorageandactivated,inturn,accordingtoasequencedeterminedbyaschedtulingalgorithm.Whenactivated,eachprogramrunsuntilitiseithercompletedorheldupbyaninput/outputwait,oruntiltheperiodoftimeallocatedtoitbytheschedulingalgorithmisexhausted.Anotherprogramisthenactivated.SeeCorbat6.3Consideracomputerinwhichaworkingmemoryof,say,32Kand1,usaccesstimeisbackedupbyalargecorememoryof,say,onemillionwordsand8,usaccesstime.Inthesimplestschemetobedescribed,programsaresplitinto32Kwordblocks,eachusermakinguseofoneormoreblocksforhisprogram.Thelargecorememoryisprovidedwithabaseregister,whichcontainsthestartingaddressofthe32Kblockcurrentlyactive.Whatwewishtoavoidistransferringthewholeblocktothefastcorememoryeverytimeitbecomesactivethiswouldbewastefulsincechancesareonlyasmallfractionofthe32Kwordswillactuallybeaccessedbeforetheblockceasestobeactive.Ifthefastcorememoryisoperatedontheslaveprinciple,nowordiscopiedintoituntilthatwordhasactuallybeencalledforbytheprogram.Whenthishappens,thewordisautomaticallycopiedbythehardwareintothefastmemory,andthefactthatcopyinghastakenplaceisindicatedbythefirstoftwotagbitsbeingchangedfroma0toa1.Whenanyreferencetostoragetakesplacethefastmemoryisaccessedfirst,4and,ifthefirsttagbitisa1,noreferenceismadetothelargememorythisistruewhetherreadingorwritingiscalledfor.Ifawordinthefastmemoryischanged,asecondtagbitischangedfrom0to1.Twotagbitsareallthatarerequiredinthissystem.Astimegoeson,thefastmemorywillaccumulateallthewordsoftheprograminactiveuse.Whenthenumberinthebaseregisterischangedsothatanewprogrambecomesactiveintheplaceoftheonecurrentlyactiveachangethatisbroughtaboutbythesupervisor,ascanofthefastmemoryisinitiated.Eachregisterisexaminedinturnand,ifthefirsttagbitisa0,noactionistakenforthatregister.Noactionissimilarlytakenifthefirsttagbitisa1andthesecondtagbitisa0.If,however,bothtagbitsareIs,thewordintheregisterunderexaminationiscopiedintoitsappropriateplaceinthelargememory.Manyvariantsofthesimpleschemearepossible.Thetagbitsmay,forexample,bestoredinaseparatesuperspeedmemory.A3Corbat6,F.J.Proc.1962InternatlFederationofInformationProcessingCongress,Amsterdam,TheNetherlandsNorthHollandPublishingCo.,1963,p711.4Ifthedesignofthelargecorememorypermits,accesstoitcanbeinitiatedsimultaneouslywithaccesstothefastmemory,andcancelledifitturnsoutnottoberequired.270AprilShortNotes1024wordmemory,eachhaving64bits,wouldbesuitablesuchamemorycouldbemadewithanaccesstimeofabout100ns,andwouldenablethescanningprocesstobecompletedmorerapidly.Similarly,anumberofbaseregisterscouldbeprovidedandthefastcorememorydividedintosections,eachservingasaslavetoaseparateprogramblockinthemainmemory.Suchaprovisionwould,inprinciple,enableshortprogramsbelongingtoanumberofuserstoremaininthefastmemorywhilesomeotheruserwasactive,beingdisplacedonlywhenthespacetheyoccupiedwasrequiredforsomeotherpurpose.ThiswouldpresentthedesignerofthesupervisorwithproblemssimilartothosepresentedbyanAtlastypesystemofdynamicstorageallocation.5Analternative,andperhapsmoreattractive,schemewouldbetoretain32Korwhateverthesizeofthefastmemorymaybeastheblocklength,buttoarrangethatthefastmemoryactsasaslavetomorethanoneblockinthemainmemory,itbeingrecognizedthatthiswillleadtosomeoverwritingofinformationintheslave,butwill,nevertheless,ontheaverage,beadvantageous.Suppose,forexample,thattherearesevenbaseregisters,eachcontaininganaddressofaregisterinthemainmemoryatwhichaprogramblockstarts.Fourtagbitsarenecessary,thefirstthreecontainingeitherzerosorthenumberofoneofthebaseregisters.Thefourthtagbitindicateswhetherawordhasbeenalteredwhileintheslave.Atanygiventime,oneofthesevenprogramblocksisactive.Wheneveraccessisrequiredtoawordinthememory,thehardwarelookstoseewhetherthatwordistobefoundintheslave.Thisisdonebyreadingthewordintheappropriateplaceintheslaveandcomparingthefirst3tagbitswiththenumberofthebaseregistercorrespondingtotheprogramblockthenactive.Ifthereisagreement,andifareadingoperationistobeperformed,thewordfromsKilburn,T.,D.B.G.Edwards,M.J.Lanigan,andF.H.Sumner,Onelevelstoragesystem,IRETrans.onElectronicComputers,vol11,Apr1962,pp223235.theslaveisusedandoperationproceeds.Ifthethreetagbitsareallzero,thewordisobtainedfromthemainmemoryandacopyputintotheslavememoryforfutureuse.Ifthethreetagbitsarenotzerobutcorrespondtoanotherbaseregister,thefourthdigitisexamined.Ifthisisazero,actionproceedsasbefore,thewordintheslavebeingoverwrittenbythewordfromthenewprogramblock.If,however,thefourthbitisa1,indicatingthatthewordhasbeenalteredwhileintheslave,thatwordiscopiedbackintoitsproperplaceinthemainmemorybeforebeingoverwrittenbythewordfromthenewprogramblock.Inthecaseofawritingoperationthesequenceofeventsissimilar,exceptthatthefourthtagbitismadeintoa1whenawordintheslaveismodified.Thus,ifthesevenprogramsbecomeactiveinturn,theymaybesaidtosharetheslavebetweenthemand,ifeachrunsinshortbursts,thereisafairchancethatonlyafewwordsbelongingtoaparticularprogramblockgetoverwrittenintheslavebeforethatprogramblockisactivatedagain.Therewill,normally,bemorethansevenprogramblocksreadytotaketheirturnforrunningandthesupervisorwill,fromtimetotime,changetheaddressinoneofthebaseregisters.Whenthishappens,ascanoftheslaveisinitiated,andallwordswhichbelongtotheprogramblockbeingdisplacedandwhichhavea1inthefourthbitofthetag,arecopiedintothemainmemory.Onthefaceofit,theschemejustoutlinedappearstoofferthebasisforasatisfactorytwolevelcorestoragesystemwithoutinvolvingtoohighadegreeofcomplexityinthehardware.ACKNOWLEDGMENTTheauthorwishestoexpresshisgratitudetoProf.R.M.Fano,DirectorofProjectMAC,forinvitinghimtoparticipateintheproject.HeisalsogratefultohiscolleaguesinCambridge,England,fordiscussions,particularlytoDr.D.J.WheelerandN.E.Wiseman,whodesignedtheslavememoryofAtlas2.G.Scarrotfirstsuggestedtheideaofaslavememorytothem.1965271
编号:201401051948156807    大小:417.63KB    格式:PDF    上传时间:2014-01-05
  【编辑】
5
关 键 词:
工业、机械、能源、设计、建模、模具、工学
温馨提示:
1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
2: 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
3.本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 人人文库网仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
  人人文库网所有资源均是用户自行上传分享,仅供网友学习交流,未经上传用户书面授权,请勿作他用。
0条评论

还可以输入200字符

暂无评论,赶快抢占沙发吧。

当前资源信息

4.0
 
(2人评价)
浏览:13次
baixue100上传于2014-01-05

官方联系方式

客服手机:13961746681   
2:不支持迅雷下载,请使用浏览器下载   
3:不支持QQ浏览器下载,请用其他浏览器   
4:下载后的文档和图纸-无水印   
5:文档经过压缩,下载后原文更清晰   

相关资源

相关资源

相关搜索

工业、机械、能源、设计、建模、模具、工学  
关于我们 - 网站声明 - 网站地图 - 友情链接 - 网站客服客服 - 联系我们
copyright@ 2015-2017 人人文库网网站版权所有
苏ICP备12009002号-5