外文翻譯--和關(guān)于Windows模式中高速存儲(chǔ)技術(shù)的研究

1 附錄 -外文翻譯部分 原文： Research of High-spee d Data Storage Technique in Windows Mode Abstr act: In the app lic at ion of modern industry me asure and c ontro l fie lds,th e trans ient st ate s ing le shou ld b e inc ept ed to c ompu ter for storag e and pr oc essin g rea l t im e. With inc re as ing d es ign t arget, it b ec omes mor e an d more import ant t o the prob lems in th e dat a storage proc ess ing a nd the w ays to solv e thes e prob lems in th e dat a storage proc ess ing a nd the w ays to solve th ese prob lems in Window s mode. Ke ywords: Data storage； transfers speed； WinDriver； ASPI； virtual disk. 1 Fore word Wit h the measur e instrum ent prec is ion and prac t ic e dem and targe t inc re as ing, the dat a transfer speed betw e en instrume nt and c omputer impro ves, and most of the data shou ld be proc ess ing rea l t im e. Commo n CP U oper at io n speed h as a lr eady exc e ede d 1 G Hz, so it is e asy for th e op erat ion a b ility of c omputer to sat isfy the c omman d of in dustry me asure an d c ontrol. How e ver, th e key p o int is t he tr ansfer b ott lenec k b etw een the instrum ent and h ost c omput e r. If the dat a c annot be sent to c omput er in time, the c omput er s operat ion a b ilit y w ill no t be ex erted effec t ive ly. Th is prob lem w ill b e d isc ussed as fo llow. The first it em shou ld be e nsured is the kind of the OS(oper at io n system). The most popu lar OS is Wind ow s system, so the most import ant tac he of data transf er w ill be disc ussed in Window s mode. 2Memory Management One of th e k ey c onc epts of mem ory m ana gem ents is th e c orre lat io n 2 betw een the addr ess spac e (log ic addr ess) and stora ge and stora ge sp ac e (physic a l addr ess). When program is runn in g, memory ma nag eme nt un it (MMU) exec utes t he m app in g from log ic a ddress to p hys ic a l ad dress. The log ic a ddress is add ed by the va lue in re loc at io n reg ister befor e sent to memory, and th e va lu e in re loc at ion re g is ter is transpare nt to user. It is obv io us that in Window s mode, memory ma nag eme nt is used th e virt ua l a ddress spac e, but not physic a l address, so the program w ill rec eive the virtual address, instead of physic al address. Consid er ing of the map p ing aff ec tion on dat a tra nsfer spee d, oper at io n phys ic a l address d irec t ly is the best c ho ic e. The operat ion step is as follow : first , send the data to the buffer area (phys ic a l mem ory) that a llo tted by th e mana gem ent soft； sec ond, send th e dat a to the buffer ar ea ( log ic me mory) tha t a llott ed by the man ag emen t soft； third, send the dat a from lo g ic memory to storage d isks. Bot h phys ic a l a ddress and log ic addr ess should be c ont in uous. The reasons ar e list ed as fo llow : f irst, it is sure to a llot the m emory like th at , and next it w ill b e show n； sec ond, re lat iv e to a llott in g sever a l buffer ar eas , a llott ing on e buffer ar ea w ill no t add t he fra gmen t to mem ory to； t h ird , allotting this kind of buffer area c an predigest the program. In the fist step, data ac qu is it io n c ard shou ld obta in the proc ess of transfer data ,and th e phys ic a l addr ess must be c ontinuo us. The buffer area s siz e lies on the dat as size tra nsferred onc e. And in the th ird step, sinc e suing ASPI in terfac e tec hn iq ue (it w ill b e exp la ine d in fourth pa rt), the log ic address should be c ontinuous, too. If the buffer areas in first and th ird step c an be un ited int o one buffer are a, the proc essin g is on ly c onc lud ing tw o steps : f ist, send the d at a to c ontinu ous buffer area； sec ond, send the data to data d isk s. By this w ay, the tim e of the d ata mo ve in th e mem ory w ill b e reduc ed, and th e dat a storag e spee d is inc reased. To avo id th e stor age oper at io n effec t o n th e d ata r ead, the p ing -p ong mod e is ac c epte d in th e storag e proc ess ing . The a llott ed buffer are a is d iv id ed int o tw o same parts. When the first buffer area is full of dat a , the system sends an in terrupt s ig na l t o man ag emen t soft , and tra nsfers the d ata t o hard d isk. The follow in g dat a w ill dat a w ill be sent to the next buffer ar ea. Wh en th is b uff er area is fu ll of dat a, th e system sends an inte eeu pt s ign a l to ma nag eme nt soft, to o. The prec ond it io n of this mode is the storag e speed shou ld shou ld shou ld be 3 higher th an dat a ac qu is it ion spe ed. The transfer spe ed of Wid e Ultra 2 SCSI d isk c an reac h 80 MB/s,and th e dat a w idth is 16b it, w hic h w ill s at isfy th e prec ondition. 3. Me thod on Allotting Continuous Buffre Are a There are severa l m etho ds on a llott ing c ont inuous are a in Win dow s mode, and tw o of these are c ompared here . One is usin g VxD ( Virtu a l Dev ic e Dr iv er) to do this job. It c an allot on e c ontin uous buffer area an d prov ide th e head ad dress of this buffer area to mana gem ent progra m and map p ing form th is buffer area to v irtua l a ddress spac e. In the pro gram, f irst ho ld o ne buffer area in t he v irt ua l address spac e, the n transfer VxD w it h send ing th e hea d address of the v irtua l a ddress spac e to Vx D, so that VxD a llot o ne b uffer are a in t he ph ys ic a l mem ory a nd obt a in t he hc a d address. At last, refer the phys ic a l memory to th e appo inte d virt ua l a ddress spac e . This w ay c an be used in w in3 2 ,and it c an rec e ive a c ont inuous ph ysic a l buffer area and log ic buffer area. How ever, it is muc h c omplex to be c arried out. Anot her is using th e func t ion of c ards D MA op erat ion in Win Dr iver : WD_D MALoc k. By us ing th is func t ion, th e c ont in uous buffer are a c an b e obta in ed for D MA oper at ion are a. Win Dr iv er is on ly used t o dr ive c ards, so it requ ires at le ast one c ard in th e ac qu is it ion system. But it is c ommon for most ac qu isit ion system th an the f irst w ay, and its de pen dab ility is h ighe r, too. More ove r, it is c onven ienc e to upgrad e. So it is a good c ho ic e for ind ustry measure fields. The buffer are a is a llott ed by th is w ay : sett ing the r eason ab le para met er of the func t ion WD_D MALoc k to obta in the c ont inuous p h ysic a l p ag e , and th e c orrespond ing lo g ic address is c ont inuo us, too. The head ad dress of first phys ic a l pag e is the ph ysic a l m emory address .The retur n va lu e of puser addr , one of the param eter of WD_ DMALoc k, is the phys ic a l memory. In add it ion ,w inDr iv er c ollates ever y ac qu isit ion c ard by lo g ic mumber (from l to the m ax imu m ,the log ic nu mber is not c orrespo nd in g to phys ic a l or der),an d th e func tio n c an ru n w ithout op erat ing ac qu isit ion c ar ds or a ny resp onse of thos e c ards, so the log ic number c an be used as l in the func t ion and affords to all ac quisition c ards. 4 One det a il shou ld be p a id muc h attent ion : one of param eter of th is func tio n must be set to “DMA_ KERN EL_ BUFF ER_ ALLOC”, so that Win Dr iver c an a llo t a c ontinuous phys ic a l me mory spac e. More ove r, the proc ess of allott in g buffer area must be p lac e d in t he in it ia liz at io n ph ase in the progra m, and oth er program shou ld not run befor e the memor y mana gem ent soft runs. Otherw ise, the proc ess of a llott in g mem ory ma y be f a ilur e for the syst em h as not e noug h c ontin uous phys ic a l memory spac e. Whe n the proc ess is fin ished, the a llotte d memory m ust be fre e by f unc t ion W D_D MAUn loc k. The f igure sh ow s the a llott ed phys ic a l memory mod e l by pin g -pon g mode (the size of eac h buffer area is 1MB) Data storage buffer area 2 (1MB) Data storage buffer area 1 (1MB) OFFSET0x000FFFFF OFFEST0x00000000 OFFSET0x001FFFFF OFFEST0x00100000 5 Fig.1 Allotted Physic al Memory Model 4. Storage in Hard Disk Hard d isk op erat ion has tw o leve ls : Win dow s and log ic sec tor le ve l. Ac c essing d isk in Window s leve l , the o pera t ion system w ill do most of the jo b. The opera t ion is so simp le th at the Wind ow s98/2000 op erat ion system c an c all API func t ion d irec t ly t o ac c ess the d isk. How ev er, t he sp eed of th is ac c ess is to o low to sat isfy th e d ata storag es req u irem ent. Ac c essing d isk in log ic sec tor leve l , the soft deve lop ed by user self c an operat e disk d irec t ly in lo g ic sec tor. This met hod ga ins h igh er speed th an Window s leve l by ac c essing d isk w ithou t usin g opera t ion systems file system. If the data are store d in c ont in uous log ic sec tor, the speed of dat a storage w ill g et h igh er. So, it is better to ac c ess disk in logic sec tor level and c ontinuous logic sec tor than Window s level. To improv e th e d ata storag e spe ed , system ad opts SCSI hard d isk instea d of IDE hard d isk . In the for ep art of SCSI, us ers dev e lop t he S CSI de v ic e s driver. The job is very c omp le x and oft en mak es mist akes, and th e dr iver s portab ility is n ot w e ll. ASPI ( Adv anc ed S CSI Progr am Int er fac e) tec hn iqu e solv es th is prob le m. Prob lem. ASPI is dev e lop ed by Ad apt ec Comp any, an d def ine d in most operat ion system, inc lud ing Win dow s system, The proc ess of ac c essing SCSI h ard d isk by ASPI inc ludes four ste ps c ommon ly : c onstruc t ac c essing d isk c omman d； send th e c ommand to ASPI m anag er； w a it for exec uting c ommand； explain the state or error c ode returned by ASPI manager. The c onc rete metho d abou t ASPI w ill not be e xp la ine d here, w hic h c an be fou nd in man y boo ks abo ut S CSI. In th e proc ess of d ata stor a ge, the t ime of searc hing trac k and sec tor is red uc ed after th e d isk rotat e speed k eeps norm a l. But a det a il shou ld be pa id m uc h att ent io n. If the ma gne t ic hea d is far form th e sec tor w here to write dat a w hen the f irst tim e to w rite dat a, the magn et ic hea d w ill spend more t ime to w rite to seek tr ic k and sec tor. Moreove r, if the d isk is at dormanc y state (d isk rotate spee d is zero), the proc ess that c hanging the d isk state from dorma nc y state to runn ing stat e w ill c ost many t im es. How ev er, th e data tra nsferr ing form ac qu is it ion c ard to the a llot ted buffer are a ke eps c onstant. This c ase maybe ha ppe ns at this time that some da ta w ill be lost bec ause th e speed of da ta storag e is low er th an th e speed of tra nsfer dat a from ac qu is it io n 6 c ard to memory. To so lv e th is prob lem, th e d isk rotat e spe ed must b e kep t runn ing stat e w hen the proc ess of data storage starts, and ev ery magn et ic hea d be move d to the c y lind er or the c on jo int c ylinder w here th e dat a w ill b e sent to. It is diff ic u lt to oper ate d isks mag net ic he ad by soft and th is method m ayb e hurt disk, so it is better to f ind a new w ay but not to move magn et ic hea d dir ec t ly. An effec t iv e w ay is re ad th e dat a form the sec tor w here th e da ta w ill transfer to mem ory, then w r ite b ac k to the sec tor . By th is w ay, the m agn e t ic head moves to the c ylinder or the c onjoint c ylinder and keeps the disk running. 5. Virtual Disk Genera lly, the disk op erat ion speed is low er than th e memory oper at io n speed of 4 to 6 ord er. So it c an improv e th e stora ge sp eed to us e me mory as d is k, th is w ay is also c alled RAM d isk. RAM d isks dev ic e dr iver a llow s the norma l disk op erat ion, though the op erat ion is ex ec uted in memory inste ad of disk. So it is transpar ent for the user. This w ay is not a goo d c hoic e for the h ig h depe nda b ility system, bec aus e it has man y d isadv anta ges suc h as the memory c apab ilit y shou ld be e noug h, the dat a in the v irtu a l d isk w ill b e lost if th e system or pow er meet some ac c idents. 6. Postscript All the a bov e it ems are the ke y po ints in h igh -spe ed dat a storag e tec hn iqu e. In add it ion, ther e are som e other p o ints a lso as RAID (Redun dan t Arr ays of In expe ns ive D isks ), d isk d ispa tc h a lgor ithm, e tc .The affec t ion r ang e and the c ost of the system are all d iffer ent. So the c hoic es are differ ent. too. “Four Ch ann e ls PXI Bus Preproc essin g Dynam ic Da ta Ac qu is it io n System” is des ign for the aero en g ines trans ie nt a nd d ynam ic sta te, w ind tu nne l exam inat ion. This task be longs to the sub jec t: th e researc h of aero au toma t ism measure and t est tec hn ique. In t he d eve lopm ent of t he s ystem soft, th e rese arc h of the data storage tec hnique has provided the pow erful support. Re fe re nce 1Chen xiangqun XiangYong, WangLei MaHongbing, Zh eng Koug en D ave Probert. Window s Operation System Princ iple 2Cao Ziyua n. Phys ic a l Memorys Alloc at ion and D irec t Ac c ess in Win3 2 Mode,Observe and Control Tec hnique, Vol.20,No.1,Jan2001. 3 Br ian Saw ert. The Programmer s Gu ide To SCSI, Ch ina Elec tr ic Pow er 7 Press,2001 4Wa lt er On ey. Progra mm ing t he Mic rosofy Wind ow s Driv er Mo de l, Mic rosoft Press,1999 5Zh ang Hao. The Arc h ive of P HD2 000 D ata Ac qu is it io n System s Sofr, Sep, 2001 Author Biographies Zh ang Le i: w ork in the F irst Aero naut Inst it ute of Air Fore e, instruc tor, gradu ate stude nt of Be ijin g Un ivers it y of Aeron aut ic s& Astron aut ic s, engag ed in data ac quisition system development: Xu X ing : w ork in Be ijing Un ivers ity of Aerona ut ic s& Astrona ut ic s ,Sc hool of Instrument at ion Sc ienc e & Opto-e lec tron ic s Eng ine er ing, professor, tutor of graduate student, engaged in c omputer measure and c ontrol tec hnique researc h. 8 翻譯： 和關(guān)于 Windows 模式中高速存儲(chǔ)技術(shù)的研究 摘要： 在現(xiàn)代工業(yè)測(cè)量和技術(shù)領(lǐng)域的應(yīng)用中，單一的短暫狀態(tài)輸入計(jì)算機(jī)存儲(chǔ)，并卻實(shí)時(shí)處理。隨著設(shè)計(jì)目標(biāo)的增加，重要數(shù)據(jù)的存儲(chǔ)速度變的越來越重要。本文主要講的是數(shù)據(jù)存儲(chǔ)過程中的問題和在 Win dow s 模式中解決這些問題的方式。 關(guān)鍵詞：數(shù)據(jù)存儲(chǔ) 轉(zhuǎn)換速度 Windows ASPI 虛擬磁場(chǎng) 1 .展望 隨著測(cè)量工具的精確和實(shí)際需求目標(biāo)的曾加，數(shù)據(jù)轉(zhuǎn)換速度在測(cè)量?jī)x器和計(jì)算之間改進(jìn)，并且大部分?jǐn)?shù)據(jù)都可以實(shí)時(shí)處理。普通 CPU的運(yùn)行速度已經(jīng)超過 1G 赫茲。對(duì)于計(jì)算機(jī)的運(yùn)行能力來講，需滿足工業(yè)測(cè)量?jī)x器和控制的要求是很容易的：然而主要的問題在于測(cè)量?jī)x器與主機(jī)同的轉(zhuǎn)換障礙。如果數(shù)據(jù)沒有及時(shí)地傳送到計(jì)算機(jī)，那么計(jì)算機(jī)的操作能力就不能有效地被運(yùn)用，這個(gè)問題將按如下步驟進(jìn)行探討：第一步應(yīng)先確定操作系統(tǒng)的類別最流行的操作系統(tǒng)是 Window s 系統(tǒng)。因此，最重要的數(shù)據(jù)轉(zhuǎn)換技術(shù)將在 Window s 模式中討論。 2.存儲(chǔ)器管理 存儲(chǔ)器管理的一個(gè)主要的概念是在“位置空間”（邏輯地址）和“存儲(chǔ)空間”（物理地址）間的相互關(guān)系。當(dāng)程序運(yùn)行時(shí)，存儲(chǔ)器管理單元執(zhí) 行從邏輯地址到物理地址間的制作工作。 在傳到存儲(chǔ)器前，邏輯地址就是通過重新注冊(cè)的價(jià)值得到補(bǔ)充，并且重新登記的的價(jià)值對(duì)用在虛擬地址中使用，而非物理地址。所以這個(gè)程序存到的是虛擬地址而非物理地址。 考慮到數(shù)據(jù)轉(zhuǎn)換速度中制圖因素的影響，操作物理地址顯然是最好的選擇，操作步驟如下：第一：將數(shù)據(jù)傳到由管理軟件分配的緩沖區(qū)域（物理區(qū)域）；第二，將數(shù)據(jù)傳到由管理軟件分配的緩沖區(qū)域（邏輯區(qū)域）；第三，將數(shù)據(jù)從邏輯存儲(chǔ)器傳送到存儲(chǔ)磁盤上，但是物理地址和邏輯地址是無法連續(xù)的，原因如下：第一，必須保證向上述那樣分配存儲(chǔ)器，并且下 一步可以顯 9 示出來；第二，相關(guān)的分配幾個(gè)緩沖區(qū)域，分配一個(gè)緩沖區(qū)域并不能將零碎的片段添加的記憶中去。第三，分配到這種緩沖區(qū)域可以預(yù)先處理此程序。 在第一步中，數(shù)據(jù)獲得下可以獲得數(shù)據(jù)轉(zhuǎn)換過程中，數(shù)據(jù)存儲(chǔ)分配區(qū)域的物理地址，并且物理地址必須是連續(xù)的。緩沖區(qū)域的大小在于一次性轉(zhuǎn)換數(shù)據(jù)的長度。并在有第三步中，因?yàn)槭褂昧?ASPI 界面技術(shù)（將在第四部分中介紹），邏輯地址也應(yīng)是連續(xù)的，如果第一階段和第三階段的緩沖區(qū)域可以統(tǒng)一在一個(gè)緩沖區(qū)域，那么這個(gè)過程只包括兩步：第一，將數(shù)據(jù)傳送到連續(xù)的緩沖區(qū)域；第二，將數(shù)據(jù)傳送到數(shù)據(jù)磁盤 ，通過這種方式，數(shù)據(jù)轉(zhuǎn)移到存儲(chǔ)器系統(tǒng)的時(shí)間將縮短，且數(shù)據(jù)存儲(chǔ)速度將增加。 為了避免存儲(chǔ)操作技術(shù)影響數(shù)據(jù)只讀功能， PIN G-PO NG 模式有存儲(chǔ)過程中被接受，分配緩沖區(qū)域被劃分為兩個(gè)相同的部分。第一個(gè)緩沖區(qū)域充滿數(shù)據(jù)，系統(tǒng)傳送一個(gè)中斷信號(hào)到管理軟件，并且將數(shù)據(jù)轉(zhuǎn)到硬盤上，剩下的數(shù)據(jù)被傳到下個(gè)緩沖區(qū)域，當(dāng)這個(gè)緩沖區(qū)域充滿數(shù)據(jù)，系統(tǒng)也會(huì)向管理軟件傳送 中 斷 信 號(hào) ， 這 個(gè) 模 式 的 前 提 是 ： 數(shù) 據(jù) 的 存 儲(chǔ) 速 度 應(yīng) 高 于 獲 得 速 度 。WID EULT RA2 SCS I 磁盤的轉(zhuǎn)換速度可以達(dá)到 80 MB/S,且數(shù)據(jù)的寬度是 16 位 ,可以滿足這個(gè)前提 . 3.分配連續(xù)緩沖區(qū)域的方式 在 WINDOWS 模式下 ,有多種分配連續(xù)緩沖區(qū)域的方式 ,這里將比較其中的兩種 . 一種是利用 VXD(虛擬裝置驅(qū)動(dòng)器 )來做此工作 ,它可以分散一些連續(xù)的緩沖區(qū)域 ,切給管理程序提供這個(gè)緩沖區(qū)域的首地址 ,為從這個(gè)緩沖區(qū)域到虛擬地址提供制圖 ,在此程序中 ,首先在虛擬地址中選擇一個(gè)緩沖區(qū)域 ,然后將附有首地址的虛擬地址的 VXD 傳送到 VXD,只有這樣 , VX D 分散一個(gè)在物理存儲(chǔ)器與已確定的虛擬地址聯(lián)系起來 ,這種方法可以在 WI N32 中使用 ,它可以直接收到一個(gè)連續(xù)的物理緩沖區(qū)域和邏輯緩沖區(qū)域 .但是 ,這個(gè)模式的執(zhí)行比較復(fù)雜 . 另一種是是用 Win Dre ir 中卡的 D MA 運(yùn)行的功能 :WD- DMALOCK.通過使用其功能 ,對(duì) DMA 來說 ,這個(gè)連續(xù)的緩沖區(qū)域能夠獲得 ,這個(gè)緩沖區(qū)域可以作為數(shù)據(jù)存儲(chǔ)緩沖區(qū)域使用 . WinDre ir 只是被用來驅(qū)動(dòng)卡 ,因此 ,在獲得系統(tǒng)中要求最少一張卡 .但是對(duì)大多時(shí)獲得系統(tǒng)來講 ,使用數(shù)據(jù)獲得卡是很普通的一件事 ,這種方法較第一種來講是比較簡(jiǎn)單的 ,且它的依賴性也更高 ,更多的是 ,對(duì)上層來講是簡(jiǎn)便的 ,所以對(duì)工業(yè)測(cè)量是個(gè)很好的選擇 . 緩沖區(qū)域是按此方式分散的 ,為了獲得一個(gè)連 續(xù)的物理頁碼 ,設(shè)定一個(gè) 10 合理的 WD-D MALO CK 功能的參數(shù) ,切相應(yīng)的邏輯地址也是連續(xù)的 ,首個(gè)物理頁 碼 的 首 地 址 是 一 個(gè) 物 理 存 儲(chǔ) 器 地 址 .Pus er Addr 的 回 服 價(jià) 值 , WD-D MALO CK 的一個(gè)參數(shù) ,是物理存儲(chǔ)器的地址 .另外 WinDre ir 通過邏輯數(shù)字 (從 1 到無窮大 ,邏輯數(shù)字與物理順序不是對(duì)應(yīng)的 )分散獲得卡 ,在設(shè)有運(yùn)行獲得卡或這些卡的任何影響的情況下 ,這項(xiàng)功能就可運(yùn)行 .因此邏輯數(shù)字在此項(xiàng)功能中被使用設(shè)為 1,且對(duì)所有的獲得卡承擔(dān)責(zé)任 . 有一個(gè)細(xì)節(jié) ,我們應(yīng)給予更多的關(guān)注 :次功能的一個(gè)參數(shù)一定要被轉(zhuǎn)送到DMA- KERN EL- BUFF ER- AUO C 中 .這樣 , WinDr e ir 可以分散一個(gè)連續(xù)的物理記憶空間 ,而且分散緩沖區(qū)域的過程應(yīng)放在程序初始化階段 .且其它的程序不應(yīng)在存儲(chǔ)器管理軟件運(yùn)行前運(yùn)行 .否則 ,由于系統(tǒng)沒有足夠的連續(xù)的物理存儲(chǔ)空間分散存儲(chǔ)器過程可能會(huì)失敗 .當(dāng)完成此過程時(shí) ,通過 WD-