TWI296776B - - Google Patents

Download PDF

Info

Publication number
TWI296776B
TWI296776B TW94142685A TW94142685A TWI296776B TW I296776 B TWI296776 B TW I296776B TW 94142685 A TW94142685 A TW 94142685A TW 94142685 A TW94142685 A TW 94142685A TW I296776 B TWI296776 B TW I296776B
Authority
TW
Taiwan
Prior art keywords
snapshot
data
logical disk
request
address
Prior art date
Application number
TW94142685A
Other languages
Chinese (zh)
Other versions
TW200723102A (en
Inventor
Yuen Hong Chen
Tom Chen
Win Harn Liu
Original Assignee
Inventec Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Inventec Corp filed Critical Inventec Corp
Priority to TW094142685A priority Critical patent/TW200723102A/en
Publication of TW200723102A publication Critical patent/TW200723102A/en
Application granted granted Critical
Publication of TWI296776B publication Critical patent/TWI296776B/zh

Links

Description

1296776 · 九、發明說明: 【發明所屬之技術領域】 本發明係關於-種邏輯磁碟f理方法,制係關於—種邏輯 磁碟快照備份管理方法。 【先前技術】 邏輯磁碟官理為(Logical Volume Manager,LVM)是-種把 硬碟空間劃分成”彈性"邏輯磁碟的方法。制LVM技術,硬碟不 必重新分區也能够被簡單地重新劃分大小。LVM給我們帶來了磁 片管理的靈活性。™的靈活_體現在可以將若干個不同類型、 不同大小的物理磁片、分區組成多個邏輯磁碟(Logical V〇l_,LV),也即虛擬分區來管理。與傳__ __ i ™為電腦提供了更高層次的磁片儲存,硬碟的多個分區由應 ,一為磁碟組管理。在通管理下的儲存磁碟可以按需要隨時改 良分區大小與移除,崎大或减小爾_可用容量,充分利用 Γ空間。它使祕管理員可以更方便的為應駿好分配儲存 :間。™也允許按用戶組對儲存磁碟進行管理,允許管理員用 更直硯的名稱代替物理磁片名來標識儲存磁碟。 LVM -個非常好的特性是快照(㈣咖⑻。快照技術為一種 針對邏輯磁碟的備份方式,可以 . 攸、輯磁碟建立,目的是保留原 始磁碟在某個時間點的資料内容。它 ^ » 始磁碟使關樣形式的 储存工間’ _於減的設計,它鱗透過f料的完整克隆來進 1296776 照:錄對應邏輯磁碟中變化位置上的原始值,因此 實現间速度、低空間消耗的優點-… 其隨著時間變化的資料保留不同時間點::本的; 技術,可贱據要求林_時_建立㈣,妙快昭透過叶 算呈獻出賴磁碟在快關鱗的映像,柯_版本,而不管 原始磁碟現在已經變為何種狀態。 快照備份做的不是資料的完整克隆,而是應用稱為寫前拷貝 • (〇w On Write,C0W)的技術實現備份,對含有一或多個快照的 原始賴猶,當存在:諸“請树,首先將需要寫入的位址 上的原始内容備份到快照空財,然後再進行原始邏輯 ^。而當初次⑽操作結錢,又存在對原始刺輯料位址進 订寫入時,則不再這個快照中執行c〇w操作了。纟此,快照中保 留了在其創建時原始磁碟某些位址上的資料。當訪問某一快照 時,即需要得到原始磁碟在快照對應時間點的版本的時候,運用 # 快照技術從對應時間點的原始磁碟中讀取沒有改變的位址下資 .料,以及從快照中讀取已改變的位址下的原始資料,進而整合^ 對應時間點的原始磁碟的完整版本。 _ 邏輯磁碟的使用中,並非所有位址的資料都會有修改,因此, 快妝空間可以比對應的邏輯磁碟空間小,即可滿足通常的需求, 此即快照相比克隆備份的低空閒消耗優點所在。但也因此,如果 邏輯磁碟上修改的位址數量超出了快照空間,快照將無法完成寫 12967761296776 · IX. DESCRIPTION OF THE INVENTION: TECHNICAL FIELD OF THE INVENTION The present invention relates to a logical disk management method, and relates to a logical disk snapshot backup management method. [Prior Art] Logical Volume Manager (LVM) is a method of dividing the hard disk space into "elastic" logical disks. With LVM technology, the hard disk can be simply re-partitioned. Re-sizing. LVM gives us the flexibility of disk management. The flexibility of TM is that it can be composed of several different types and sizes of physical disks and partitions into multiple logical disks (Logical V〇l_, LV), that is, virtual partition management. With __ __ i TM provides a higher level of disk storage for the computer, multiple partitions of the hard disk should be, and one is managed by the disk group. The storage disk can be used to improve the partition size and removal as needed. It can be used to make full use of the space. It allows the secret administrator to more easily allocate storage for Ying Jun: Manage storage disks by user group, allowing administrators to identify storage disks with more straightforward names instead of physical disk names. LVM - A very nice feature is snapshots ((4) coffee (8). Snapshot technology is a kind of logic Disk Backup mode, you can. 攸, album disk creation, the purpose is to retain the original disk at a certain point in time data content. It ^ » Start disk to save the form of the storage room _ _ reduced design, it scales Through the complete cloning of the f material into the 1296776 photo: record the original value of the change position in the corresponding logical disk, so the advantage of achieving inter-speed, low space consumption -... The data that changes with time retains different time points:: Technology; can be based on the requirements of the forest _ _ _ build (four), Miao fast Zhao through the leaves to present the image of the disk in the fast-off scale, Ke _ version, regardless of the state of the original disk has now become. Snapshot What the backup does is not a complete cloning of the data, but a technique called “write-on-write” (〇w On Write, C0W) to implement the backup. For the original ones with one or more snapshots, when there is: “Please tree First, the original content on the address to be written is backed up to the snapshot empty, and then the original logic is performed. When the initial (10) operation is completed, and the original address is written, the original address is written. No longer execute in this snapshot C〇w operation. In this case, the snapshot retains the data on some addresses of the original disk when it was created. When accessing a snapshot, you need to get the version of the original disk at the corresponding time point of the snapshot. Using # snapshot technology to read the unchanged information from the original disk at the corresponding time point, and reading the original data under the changed address from the snapshot, and then integrating the original of the corresponding time point The full version of the disk. _ In the use of the logical disk, not all the data of the address will be modified. Therefore, the quick makeup space can be smaller than the corresponding logical disk space, which can meet the usual requirements. The advantage of low idle consumption for clone backups, but also, if the number of modified addresses on the logical disk exceeds the snapshot space, the snapshot will not finish writing 1296776

现險主要來自于空間的風險。 造成快照的失效。因此快照失效的 由於原始磁碟可能會持_進行修改或寫入, ,而需要在多個The main risk comes from the risk of space. Causes the snapshot to fail. Therefore, the snapshot is invalid. Since the original disk may be modified or written, it needs to be in multiple

不同日守間點快㈣*料會出現大量重覆的現象,因此增加了每個 快照的使用量,隨之也增加了總體快照的空間佔用量,加大了失 、刀、逑又’目此影響了邏輯磁碟資料備份的效率;另一 因為邏輯磁碟進行備份衫個快照之岐相互獨立的,在 效的風險。 【發明内容】 鑒於以上的問題,本發明的主要目的在於提供—種邏輯磁碟 管理器之快照管理方法,不僅可實縣照高速備份之功能,還節 省快照之儲存空間容量。 因此,為達上述目的,本發明所揭露之邏輯磁碟管理哭之快 照管理方法包括有下列步驟··在一邏輯磁碟對應建有複數個快照 的情況下,對邏輯磁碟執行寫前拷貝操作時,查找邏輯磁碟中即 將進行資料寫入之資料位址;其所對應不同時間點建立的快照 中,對最後時間點所建立的快照,依據寫前拷貝對即將進行資料 1296776 . 寫入之資料位址下之資料進行備份;當存在快照讀取請求時,判 斷讀取請求所對應之快照中是否存在請求資料位址;以及當快照 中不存在該請求資料位址’且快照之所對應時間點不是最後時間 點時’則向後查找晚於該快照之所對應時間點之複數個快照^ 覆查找各快财是否存在請求資料紐,直至查找騎求資料位 址’並項取清求資料位址下之快照資料。 依據本發明之邏輯磁碟管理器之快照管理方法,其中當快昭 中存在請求資料位址時,則直接讀取請求資料位址下之快照^^ 依據本發明之邏輯磁碟管理器之快照管理方法,其中 t不”請求資料位址,且快照所對應之時間點為最後 % ’則H取邏輯磁碟帽麟求轉位址下之原始資料。 依據本發明之邏輯之快照管理方法, 從複數個快照中刪除一快昭拄Rjnli A 八要 -最早時目/曝触之騎應時間點不是 取早_科,職刪除快财對應雜位 π 其前一快照中。 广心貝科添加到 對、羅独磁麵軸㈣有_建立__,t 對邏細碟執行一寫前拷貝操作時, ^係,在 作’因此不僅可以節約快照所需之儲存 避^有寫入勒 對其配衫谢域寫續導致之效麵低㈣響技術之 此外’如果軸幅㈣,透侧合併算法,將需 1296776 ΓΓΓ所記錄的_添蝴隸面躲财,可錢執行快 、、矛、喿作Q此’不會因為本發明之邏輯磁碟管理器之快照管 2法的各個快照的依雛,而使得某—快照的刪除導致其他快 照的賢料錯誤。 【實施方式】 實施例詳細說 有關本發_特徵與實作,!!配合圖式作最佳 明如下。 在“述本發明之邏輯磁碟管理器之快照管理方法之前,首 結合圖示對習知快照備份方法進行說明。 「第1圖」為在不同時間點之邏輯磁碟即將進行資料寫入之 二:=^示意圖;「第^圖」為依據習知技術之快 ^苐快照在不同時間點之示意圖;「第2b圖」為依 圖;以及 「ΐΓ:之快照備份方法之第二快照在不同時間點之示意圖; 弟允圖」為依據習知技術之快照備份方法之第三快照之示意 始資料示意圖 第3圖」為在不同時間點之快照對應的邏輯磁碟之原 次憾第1圖」為在不同時間點之邏触碟即將進行資料寫入之 及其貧料内容示意圖,如圖可知,邏輯塊區10,2〇及 刀另J為在日寸間點tl,t2以及t3對邏輯磁 資料位址及其對應的原始資料内容。 +寫入的 1296776 假設邏輯磁碟在t〇時刻的各個位址及其對應原始資料内容 如「第3圖」之資料區域301所示,「第3圖」為在不同時間點之 快照對應的邏輯磁碟之原始資料示意圖,其中以時間t與邏輯位 址的兩維變量所構成的表格3〇的形式給出 對 .當前猶㈣料建錄照犯,鱗為的;^照,即快 照中沒有記錄任何資料。如果在建立快照後某時間點tr,即tl ' <U時間點邏輯磁碟中有資料發生改變,例如資料位址〇下的資 ❿料由A〇變為A1,資料位址2下的資料由C0變為C1,其中上述資 料分別儲存在邏輯磁碟之儲存單元—邏輯區塊上。邏輯磁碟按 區塊”為單位儲存’在-磁碟組中的所有邏輯磁碟的區塊大小 是相同的。邏輯磁碟相當於非LVM系統中的分區,它在磁碟組上 建立’是-域準的區塊設備,可以在其上建立文⑽統。假設 邏輯磁碟的物理區塊之容量大小為備。當建立邏輯磁碟時,則 會建立邏輯區塊與物理區塊的一一映射關係。透過執行一寫前拷 貝操作則在tl日守間點所建立的快照首先將資料A〇和⑶記錄下 來’得到如「第2a圖」所示的快照S11内容,其上包括兩個邏輯 區塊所對應之邏輯位址下即將寫入的資料A〇與⑶。 第2b圖」為依據習知技術之快照備份方法,第二快昭 同時間點之示意圖,於此,第二快照係指快照犯。同樣,告在 =間點時又建立—個邏輯磁碟快照犯,此時快照仍然:空 t在隨後科_ t2',即tf<t2<t2時存在對邏輯磁碟之 貝料位址為4的資料E0進行修改,由E〇改為£1,則執行寫前拷 1296776 如⑷b目」_所轉議2内容,竭習知快照 進而織:快^12 _的資料寫入同時也有對快照sn進行寫入, 文為如「第2a圖」所示的快照sir内容 知快為包含原快照Sli及快照^^^ 時門:_“3、,則依據t3時建立的快照及邏輯磁碟纽 伊日=_=址6下的寫入操作’可得到如「第2c圖」所示的 昭,、、、,苐2c圖」為依據習知技術之快照備份方法,第三快 sii-r^S13之示意圖。同樣’快照S13的寫入同時也有快照 ”「S12的寫入’則此時快照su,與犯變為分別如「第% :」「及心圖」所示的快照S11…和犯、其中 圖」及「第2b圖」可知,這時快照S11…中包含原快 中勺人盾、決、、、S12與快照S13中所記錄的資料内容;而快照S12 中^原快照S12與快照S13中所記錄的資料内容。 入,、知,習知快照備份方法不僅會引起對多個快照的寫 的總母個快的備份資料量逐漸增加,進而增量所有快照 量^二曰、的佔用。快照備份的次數越多,所需的邏輯磁碟的容 所“1越大’在第三次快照的寫前拷貝操作之後,快照S11 一 ^各I達到16ΜΒ。 行說明。「二圖顿本發日狀邏輯磁碟管理11之快贿份方法進 不间0#第4圖」為本發明之邏輯磁碟管理器之快照備份方法在 守間點之快照示意圖,以及「第5圖」為本發明邏輯磁碟管 1296776 理器之快照管理方法之快_份步驟流程圖。 「A* 第4圖」為本發明之邏輯磁碑營理 间拄p, 而1 備份方法在不 ^間點之快照示意圖。假設邏輯磁碟在時間點tr,也及< 而要寫入的邏輯位址及資料如「第1 及的_。 Μ圖」所不,與習知技術所提 4 5圖」為本發鴨輯職之快辭财法之快照 的二;驟流:圖。如圖所示’在已經對邏輯磁碟建立複數個快照 ^士下,當在某-時間點存在對邏輯磁碟的寫人情況下,找到 ^日^點建立的快照(步驟m),並在最後時間點之快照中, j邏輯磁碟中即將進行資料寫人的資料位址(步驟㈣,然後 又康寫前拷貝操作,將查找到的即將進行資料寫人的資料位址下 2料記錄到此快照中(步驟1G3)在快照記錄後再執行對邏輯 口'、相應資料位址的資料寫入(步驟104)。顯然,如果邏輯磁碟 只對應建有—個快照,則本發明之邏輯麵管理器制快照管理方 u知快照備份技術的效果是姻的。關於本發明邏輯磁碟管 理益之快照管理方法之快照備份方法可結合「第4圖」及對習知 快照備份技術的說明進行。 ^同樣假設邏輯磁碟在to時刻的各個位址及其對應原始資料 ^谷如「第3圖」之資料區域301所示,而在某一時間點ti對當 前邏輯磁碟的資料建立㈣S21,此時快照中沒有記錄任何資料田。 在對貝料位址為〇和2的邏輯區塊於tl /,tl<tl /時間點執行 13 ^296776 邏輯=二…本發明之快照備份方法在需要對 得1=Γ=Γ軸分到起初建立的空快照中,從而 料位址為4的資料進1Γ t厂時存在對邏輯磁碟之資 點t2飞快昭S22内^文,則執行寫前拷貝操作得到對應時間 照歡中的資料n’r衣據本發明之快照備份方法,此時快 針對最後時間點之快照進行。同樣,在t3:=: 的時間點t3 一,即t2 - d^〜 、…、S23,在ρ过後 為6的資料η 時存在對邏輯磁碟之資料位址 的快昭s23改,則執行寫前拷貝操作得到對應時間點『 、 * ’而依據本㈣之快輯份方法,此雜昭咖 中的資料寫入時沒有對快昭S2 $1、S23 對最後時間點之快照進;;1 S22進订寫入,即寫前拷貝只針 當於㈣’快照s21所需之容量大小為8mb,僅相 當於快細而㈣微所需容量大小為働,相 量的空間大小’因此相比習知技術所得之快^^= 照所佔用之容量大小明顯減少。 本U之上迷快 進一=:發明之輯磁碟管理器之快照備份方法基礎上, 通柄明邏輯磁碟管理器之快照讀取方法。「第6圖」為 14 I2%776 本發明邏輯磁碟管理器之快照管理方法之快照讀取步驟流程圖。 如圖所示,在存在邏輯磁碟之一快照讀取請求時,依照此快 照讀取請求選中一快照(步驟1〇5),然後判斷所選的快照中是否 存在讀取請求之一資料位址(步驟106),若存在,則直接讀取快 / 照中请求資料位址所對應之一快照資料(步驟110);否則,判斷 . 當前快照對應之時間點是否為一最後時間點(步驟107),若是, 則前進至步驟109,讀取邏輯磁碟中對應請求資料位址所對應之 ♦-原始資料;若不是最後時間點,則向後查找晚於快照所對應之 時間點之複數個快照(步驟108),然後判斷查找的快照中是否存 在讀取請求之資料位址(步驟106),若存在,則前進至步驟11〇, 讀取快照巾請求資料位址麟應之—快照㈣,如此循環直至所 對應之時間點為一最後時間點之快照。 藉由本發明邏輯磁碟管理器之快照備份方法維護不同時間的 快照,在邏輯磁碟發生誤操作導致資料丟失的情況下,透過本發 •明邏輯磁碟管理器之快照讀取方法對其進行恢復。下面將結合「第 .3圖;1與帛4圖」對本發明之快照讀取方法或者稱作快照恢復 '方法進仃5兄明。假若快照S22存在—當前讀取請求,快照的選擇 /又輯磁碟内奋而要恢復的時間點有關,這裡選擇快照微即表 示需要對賴磁碟之請求麵紐在t2日細㈣容進行讀取。如 果要长對I、、S22中的貝料位址為4所對應之快照資料進行讀 取’從圖中可知,資料位址4存在於快照您中,所以直接對快Different days, the custodial point is fast (4) * There will be a lot of repeated phenomena, so the usage of each snapshot is increased, which also increases the space occupancy of the overall snapshot, increasing the loss, the knife, the 逑 and the ' This affects the efficiency of logical disk data backup; the other is because the logical disk is independent of each other, and the effect is effective. SUMMARY OF THE INVENTION In view of the above problems, the main object of the present invention is to provide a snapshot management method for a logical disk manager, which not only functions as a high-speed backup of the county, but also saves the storage space capacity of the snapshot. Therefore, in order to achieve the above objective, the logical disk management crying snapshot management method disclosed in the present invention includes the following steps: performing a pre-write copy on the logical disk in the case where a plurality of snapshots are corresponding to a logical disk. During operation, the data address of the data disk to be written in the logical disk is searched; in the snapshot established at different time points, the snapshot created at the last time point is written according to the pre-write copy to the upcoming data 1296776. The data under the data address is backed up; when there is a snapshot read request, it is judged whether there is a request data address in the snapshot corresponding to the read request; and when the snapshot does not exist in the snapshot, the request data address 'and the snapshot location If the corresponding time point is not the last time point, then look for a plurality of snapshots later than the corresponding time point of the snapshot. ^Find out whether there is a request data button for each fast money, until the search for the data address is found. Snapshot data under the data address. According to the snapshot management method of the logical disk manager of the present invention, when there is a request data address in the fast display, the snapshot under the request data address is directly read ^^ a snapshot of the logical disk manager according to the present invention The management method, wherein t does not "request the data address, and the time point corresponding to the snapshot is the last %", then H takes the original data under the logical disk capping address. According to the logic snapshot management method of the present invention, Remove a quick snapshot from a plurality of snapshots. Rjnli A. Eight to be - the earliest time / exposure of the ride should be taken at a time _ section, the job deletes the fast money corresponding to the miscellaneous π in its previous snapshot. Add to the pair, Luo single magnetic axis (four) has _establish __, t perform a pre-write operation on the logical thin disk, ^ system, in the process of 'so not only save the snapshot need to save the storage ^ write The effect of the continuation of his shirt is low. (4) In addition to the technique of 'Axis (4), the through-side merging algorithm will require 1296776 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Spear, 喿作Q this 'will not be due to the logic of the invention The snapshot of the disk manager's snapshot tube 2 method, so that the deletion of a certain snapshot causes the other snapshots to be wrong. [Embodiment] The embodiment details about the present invention _ features and implementation, !! The drawings are best described below. Before the description of the snapshot management method of the logical disk manager of the present invention, the conventional snapshot backup method will be described with reference to the drawings. "Pic 1" is the second data to be written at the logical disk at different points in time: =^ schematic diagram; "^^" is a schematic diagram of the snapshot according to the prior art at different time points; 2b diagram" is the diagram; and "ΐΓ: the second snapshot of the snapshot backup method is at a different time point; the brother map" is the schematic diagram of the third snapshot of the snapshot backup method according to the prior art. The figure is the original memory of the logical disk corresponding to the snapshot at different time points. Figure 1 is a schematic diagram of the data to be written at the different time points and the contents of the poor material. As shown in the figure, the logic block The area 10, 2 〇 and the knife J are the logical data address and its corresponding original data content between the time points tl, t2 and t3. +1296776 is written. It is assumed that the addresses of the logical disk at time t and their corresponding original data contents are as shown in the data area 301 of "Fig. 3", and "Fig. 3" corresponds to the snapshots at different time points. Schematic diagram of the original data of the logical disk, which is given in the form of a table 3〇 composed of two-dimensional variables of time t and logical address. The current Journey (four) materials are recorded and the scales are; No information was recorded in the book. If there is a data change at a certain time point tr after the snapshot is established, that is, tl ' <U time point logical disk, for example, the data under the data address is changed from A〇 to A1, under data address 2 The data is changed from C0 to C1, and the above data are respectively stored in the storage unit-logic block of the logical disk. The logical disk is stored in blocks. The block size of all logical disks in the disk group is the same. The logical disk is equivalent to the partition in the non-LVM system, which is built on the disk group. It is a domain-based block device on which the text (10) system can be established. It is assumed that the physical size of the logical disk is the size of the logical disk. When the logical disk is created, the logical block and the physical block are established. One-to-one mapping relationship. By performing a pre-write copy operation, the snapshot created at the tl-day punctuality point first records the data A〇 and (3) to obtain the snapshot S11 content as shown in the "2a map", which includes The data A〇 and (3) to be written under the logical address corresponding to the two logical blocks. Figure 2b is a snapshot backup method according to the prior art, and a second snapshot is a schematic diagram of a point at the same time. Here, the second snapshot refers to a snapshot. Similarly, when the = point is established, a logical disk snapshot is created. At this time, the snapshot is still: empty t in the subsequent section _t2', that is, tf<t2<t2, there is a beacon address for the logical disk. 4 The data E0 is modified, from E〇 to £1, then the pre-write copy 1296776 is executed. (4)b目”_Reported 2 contents, exhausted by the snapshot and then woven: the data of the fast ^12 _ is also written The snapshot sn is written, and the content of the snapshot sir as shown in "2a" is as fast as the original snapshot Sli and the snapshot ^^^ gate: _ "3, the snapshot and logical magnetic created according to t3 The disk write operation of 'New Zealand===address 6' can be obtained as shown in the "2c picture", ", ", ", 2c picture" is a snapshot backup method according to the conventional technology, the third fast sii -r^S13 schematic diagram. Similarly, the 'snapshot S13 write also has a snapshot at the same time." "S12 write". At this time, the snapshot su, and the commits become snapshots S11... and the crimes shown in "%:" and "heart map" respectively. And "2b", at this time, the snapshot S11... contains the contents of the original snapshot, the decision, the S12, and the snapshot S13; and the snapshot S12 is the original snapshot S12 and the snapshot S13. Recorded data content. Incoming, knowing, the conventional snapshot backup method not only causes the total amount of backup data of the total parent to be written to multiple snapshots to gradually increase, thereby increasing the occupancy of all snapshots. The more times the snapshot is backed up, the larger the required capacity of the logical disk is "1 is larger". After the pre-write copy operation of the third snapshot, the snapshot S11 and each I reach 16ΜΒ. Line Description. The snapshot of the snapshot of the logical disk manager of the present invention is a snapshot of the snapshot point, and the "figure 5" is The snapshot processing method of the logical disk processor 1296776 of the present invention is a quick step flow chart. "A* Figure 4" is a schematic diagram of the logical magnetic monument of the present invention, and the snapshot method of the backup method is not in the middle. Assume that the logical disk is at the time point tr, and the logical address and data to be written, such as "1st and _. Μ", and the conventional technology is based on the 4th figure. The second snapshot of the quick resignation of the ducks; the flow: map. As shown in the figure below, when a plurality of snapshots have been created for the logical disk, when there is a writer for the logical disk at a certain time point, a snapshot created by the ^ day is found (step m), and In the snapshot of the last point in time, the data address of the data writer will be recorded in the j logical disk (step (4), and then the copy operation will be performed before the write, and the data address of the upcoming data writer will be found. Recording into this snapshot (step 1G3), after the snapshot recording, the data writing to the logical port ', the corresponding data address is performed (step 104). Obviously, if the logical disk only has a snapshot, the present invention The logical face manager snapshot management party knows that the effect of the snapshot backup technology is a marriage. The snapshot backup method of the snapshot management method of the logical disk management of the present invention can be combined with the "figure 4" and the conventional snapshot backup technology. The description is carried out. ^ Also assume that the logical disk at each time of the address and its corresponding original data ^ valley as shown in the data area 301 of "Fig. 3", and at a certain point in time ti on the current logical disk Data establishment (4) S21 At this time, no data fields are recorded in the snapshot. In the logical block with the bucking address of 〇 and 2, tl /, tl < tl / time point is executed 13 ^ 296776 Logic = two... The snapshot backup method of the present invention is needed The 1=Γ=Γ axis is divided into the initial created empty snapshot, so that the material with the address of 4 is entered into the factory. When there is a resource for the logical disk, the point t2 is fast and S22, and then the write is performed. The copy operation obtains the data in the corresponding time photo. The snapshot backup method according to the present invention is performed on the snapshot at the last time point. Similarly, at time t3 of the t3:=: one, that is, t2 - d ^~,...,S23, when there is a data η of 6 after ρ, there is a fast s23 change to the data address of the logical disk, and then the pre-write copy operation is performed to obtain the corresponding time point 『, * ' and according to this (4) The quick copy method, when the data in this Zaojia coffee is written, there is no snapshot of the fast time S2 $1, S23 to the last time point; 1 S22 write write, that is, the copy before the write only when the (four)' The size required for the snapshot s21 is 8 mb, which is only equivalent to the fineness and (4) the required size of the micro is 働, the phasor The size of the space is therefore much faster than that obtained by the prior art. ^^= The size of the occupied capacity is significantly reduced. The U above is a fast-forward one=: The invention is based on the snapshot backup method of the disk manager. Logical disk manager snapshot reading method. "Figure 6" is a flowchart of the snapshot reading step of the 14 I2%776 snapshot management method of the logical disk manager of the present invention. As shown in the figure, there is a logical disk. When one of the snapshot reads the request, a snapshot is selected according to the snapshot read request (step 1〇5), and then it is determined whether there is a data address of the read request in the selected snapshot (step 106), if any, Then directly reading one of the snapshot data corresponding to the request data address in the fast/photo (step 110); otherwise, determining whether the time point corresponding to the current snapshot is a last time point (step 107), and if yes, proceeding to the step 109. Read the ♦-original data corresponding to the corresponding request data address in the logical disk; if not the last time point, search backward for a plurality of snapshots later than the time point corresponding to the snapshot (step 108), and then determine the search. Fast Whether there is a data address of the read request in the photo (step 106), if yes, proceed to step 11〇, read the snapshot towel request data address lining-snapshot (four), and so on until the corresponding time point is A snapshot of the last point in time. The snapshot backup method of the logical disk manager of the present invention maintains snapshots of different time, and recovers through the snapshot reading method of the present logical disk manager when the logical disk is mishandled and the data is lost. . In the following, the snapshot reading method of the present invention, or the snapshot recovery method, will be described in conjunction with "Fig. 3; 1 and 帛 4". If the snapshot S22 exists - the current read request, the selection of the snapshot / the time point of the recovery in the disk is related to the time point, here, the selection of the snapshot micro means that the request face of the floppy disk needs to be performed on the t2 day. Read. If you want to read the snapshot data corresponding to the beetle address in I and S22 for 4 times, it can be seen from the figure that the data address 4 exists in the snapshot, so it is directly

15 1296776 照資料E0讀取。如果S22之讀取請求要求讀取資料位址為6的快 照資料,透過判斷可知快照S22中無此資料位址,則接著判斷快 照S22對應之時間點是否為最後時間點,如圖示可知還存在一晚 於快照S22時間點的快照S23,因此向後查找快照S23,並判斷快 照S23中是否存在資料位址6。由於快照兕3中存在資料位址6, : 所以讀取此資料位址下的快照資料GO。另一種情況是,在快照敝 存在對資料位址3的讀取請求,無論是在快照微中還是在晚於 •快肖奶的快照S23巾均不存在此資料位址,則直接讀取資料位 址3在邏輯磁碟中的資料内容D()。即,當需要訪問快照微時, 其内容需要由快照S22與快照S23共同呈獻,進而得到t2時間點 邏輯磁碟的原始内容之正確結果,如「第3圖」之表格3〇的資料 區域303所无。 ' 叫埋,远過上述本發明之快照讀取方法可知,當訪問快照奶 時’則邏輯磁碟在ti時刻的内容需要由快照S21,S22及卿丘 同呈獻’如「第3圖」之表格3〇的資 ,、 S23則可直接讀取邏輯磁碟在t3 中的資料區域304所示。 依據本發明之邏輯磁碑普裡突、β β 之間存在__,除了.n、方法所得到的快照 此可以«要的情況下不被其他快照依賴,因 除’_造成其__二=::::隨:: 16 129677615 1296776 Read according to the data E0. If the read request of S22 requires reading the snapshot data of the data address of 6, the content of the snapshot is not determined by the snapshot S22, and then it is determined whether the time point corresponding to the snapshot S22 is the last time point, as shown in the figure. There is a snapshot S23 at a time point of the snapshot S22, so the snapshot S23 is searched backwards, and it is judged whether or not the data address 6 exists in the snapshot S23. Since the data address 6 exists in the snapshot 兕3, the snapshot material GO under this data address is read. In another case, there is a read request for the data address 3 in the snapshot, and whether the data address exists in the snapshot micro or in the snapshot S23 of the snapshot, the data is directly read. Address 3 is the data content D() in the logical disk. That is, when the snapshot micro is required to be accessed, its content needs to be jointly presented by the snapshot S22 and the snapshot S23, thereby obtaining the correct result of the original content of the logical disk at the time t2, such as the data area 303 of the table 3 of "Fig. 3". Nothing. 'Calling, far from the snapshot reading method of the present invention, it is known that when accessing the snapshot milk, the content of the logical disk at the time of ti needs to be presented by snapshots S21, S22 and Qingqiu, as shown in Figure 3. In Table 3, the S23 can directly read the logical disk as shown in the data area 304 in t3. According to the logic track of the present invention, there is a __ between the grammar and the ββ, except for the snapshot obtained by the method of .n, which can be relied on by other snapshots, because the __ is caused by the __ =::::With:: 16 1296776

由快照合併方式, 快照中。 、透過上述祝明可以看出,本發明邏輯磁碟管理器之快照管理 ^法不僅可_省快照儲存空間,而且減少了資料寫人量,進而 、…、備知的效率。此外,快照讀取方法巾檢*的資料量與習知 ^法中的檢索資料量烟,因此也不會對資料讀取的效率造成譽 —雖然本發前述之較佳實施纖露如上,然其並非用⑽ 定本發明,任域f相像技藝者,在秘離本發明之精神和範^ 内,當可作些許之更動錢飾,因此本發明之專利保護 ' 本說明書騎之_料概_界定者鱗。 ^ 【圖式簡單說明】 第1圖為在不同時間點之邏輯磁碟即將進行資料寫 位址及其資料内容示意圖; 快照在不同時 弟2a圖為依據習知技術之快照備份方法,第 間點之示意圖;By snapshot merge mode, in the snapshot. It can be seen from the above description that the snapshot management method of the logical disk manager of the present invention can not only save the snapshot storage space, but also reduce the amount of data writing, and thus, the efficiency of the knowledge. In addition, the amount of data in the snapshot reading method and the amount of data in the conventional method are not good for the efficiency of reading the data - although the preferred embodiment of the present invention is as described above, It is not intended to use (10) to define the present invention, and it is within the spirit and scope of the present invention, and the patent protection of the present invention is defined as a part of the invention. Scales. ^ [Simple description of the diagram] Figure 1 is a schematic diagram of the data write address and its data content of the logical disk at different time points. The snapshot is in different time. The 2a picture is based on the snapshot backup method of the prior art. Schematic diagram of the point;

間點之示意圖; ’第一快照在不同時 第2c圖為依據習知技術之快照備份方法 第二快照示意圖;Schematic diagram of the point; 'The first snapshot is not at the same time. FIG. 2c is a snapshot of the snapshot method according to the prior art.

1296776 意圖; 第4圖為本發明之邏輯磁碟管理器之快照備份方法在不同時 間點之快照示意圖; 第5圖為本發明邏輯磁碟管理器之快照管理方法之快照備份 / 步驟流程圖;以及 1 第6圖為本發明邏輯磁碟管理器之快照管理方法之快照讀取 φ 步驟流程圖。 【主要元件符號說明】 10 邏輯塊區 20 邏輯塊區 30 邏輯塊區 tf 時間點 t2 時間點 t3 時間點 S11 快照1296776 Intention; FIG. 4 is a schematic diagram of a snapshot backup method of a logical disk manager of the present invention at different time points; FIG. 5 is a snapshot backup/step flow chart of a snapshot management method of the logical disk manager of the present invention; And FIG. 6 is a flow chart of the snapshot read φ step of the snapshot management method of the logical disk manager of the present invention. [Main component symbol description] 10 Logic block area 20 Logic block area 30 Logic block area tf Time point t2 Time point t3 Time point S11 Snapshot

Slf 快照Slf snapshot

Sll^快照 18 1296776 S12 快照 S12 — 快照 S13 快照 S21 快照 S22 快照 S23 快照 30 表格 301 資料區域 302 資料區域 303 資料區域 304 資料區域 步驟101當某 後時間點的快照 料寫入時,找到最 入 步驟102在最後時間點之快照中,查找即將進行 的資料位址 ' 胃 入的資料 步驟103依據寫如拷貝操作,對即將進行資料寫 位址下之資料備份到快照中 19 1296776 步驟104執行邏輯磁碟之資料位址的寫入操作 步驟105依照快照讀取請求選中一快照 步驟106判斷快照中是否存在讀取請求之一資料位址? 步驟107快照所對應時間點是否為一最後時間點? 步驟108向後查找晚於快照所對應時間點之複數個快照 B 步驟109讀取邏輯磁碟中對應請求資料位址下原始資料 步驟110讀取快照中請求資料位址所對應之一快照資料Sll^ Snapshot 18 1296776 S12 Snapshot S12 - Snapshot S13 Snapshot S21 Snapshot S22 Snapshot S23 Snapshot 30 Table 301 Data Area 302 Data Area 303 Data Area 304 Data Area Step 101 When a snapshot of a later time point is written, find the most step In the snapshot of the last time point, the data address of the upcoming data address is searched for. The step 103 of the stomach input is performed according to the write copy operation, and the data under the data write address is backed up into the snapshot. 19 1296776 Step 104 Performing the logic magnetic The write operation step 105 of the data address of the disc selects a snapshot step 106 according to the snapshot read request to determine whether there is a data address of one of the read requests in the snapshot. Is the time point corresponding to the snapshot in step 107 a last time point? Step 108: searching for a plurality of snapshots later than the corresponding time point of the snapshot. Step 109: reading the original data under the corresponding request data address in the logical disk. Step 110: reading one snapshot data corresponding to the requested data address in the snapshot.

2020

Claims (1)

1296776 十、申請專利範圍: 1· · -種賴磁碟管驾之快絲财法,财法包括有下列步 驟· 〜在對一邏輯磁碟有資料寫人請求時,其中該邏輯磁碟中建有 複數個對應不同日^•間點的快照,查找該邏輯磁碟中即將進行資料 寫入之資料位址; ' 依據寫月〕拷貝知作對應之一最後時間點之快照,對該邏輯 磁碟即將進行㈣寫人之資料紐下之資料進行備份; 當存在-快照讀取請求時,判斷該讀取請求所對應之一快照 中是否存在一請求資料位址;以及 冨》亥〖夬了中不存在该請求資料位址,且該快照之該所對應時 間點不是-最餅_時’ _後韻晚於該㈣之該所對應時 鲁㈤點之賴數個快照’直至查找到該請求資料位址,並讀取該請 求資料位址下之一快照資料。 、如申明專利範圍弟1項所述之邏輯磁碟管理器之快照管理方 去其中當该快照中存在該請求資料位址時,則直接讀取該請求 資料位址下之一快照資料。 3·如申請專利範圍第1項所述之邏輯磁碟管理器之快照管理方 法,其中當該快照中不存在該請求資料位址,且該快照所對應之 ^亥蚪間點為該最後時間點時,則讀取該邏輯磁碟中對應該請求資 21 Γ296776 料位址下之一原始資料。 4土如申吻專利範圍第!項所述之邏輯磁碟管理器之快昭管理方 概7财赚-贿時,且該刪除快 應資料位址=====軸養照中對 L 一種邏輯_管翻之快辭财法,財法包括有下列步 *邵· 在對一邏輯磁猶資料以請求時,射闕輯磁碟中建有 複數個對應不同時_的快照,查找該邏輯磁碟中即將進行資料 寫入之資料位址;及 依據寫刚拷貝操作對應之一最後時間點之快照,對該邏輯 磁碟即將進行資料寫入之資料位址下之資料進行備份。 如申明專利域第5項所述之邏輯磁碟管理II之快照管理方 法’更包括下列步驟: /存在—_、讀取請求時,麟該讀取請求所對應之一快照 中是否存在一請求資料位址;以及 备忒快照中不存在該請求資料位址,且該快照之該所對應時 間點不疋-最後時間點…則向後查找晚於該快照之該所對應時 間』之顧數個快照,直至查酬輯求資料位址,並讀取該請 求資料位址下之一快照資料。 22 1296776 7·如申請專利範圍第6項所η、+、严站 ★ 貝所述之邏輯磁碟管理器之快照管理方 法’其中當該快照中存在琴七主*次 次 求貝料位址時,則直接讀取該請求 Μ料位址下之一'丨夬照資料。 、、士申#專他H第6項所述之邏輯磁碟管理器之快照管理方 • '、巾㈤"紙、、、巾不存在該請求:#料位址,且該賴所對應之 ;該時_為該最後時間點時,則讀取該邏輯磁碟中對應該請求資 料位址下之一原始資料。 9.如中請專利範圍第5項所述之邏輯磁碟f理器之快照管理方 T ’其中當需要從所述複數個快照中刪除一快照時,且該刪除快 知之该所對應時間點不是—最早時_時,則將該刪除快照中對 應資料位址下之資料添加到其前一快照中。 231296776 X. The scope of application for patents: 1 · · - The fast-track financial method of the magnetic disk drive, the financial law includes the following steps · When there is a request for information on a logical disk, the logical disk Build a plurality of snapshots corresponding to different days and points, find the data address of the logical disk to be written data; 'copy the month' to copy the last time point of the corresponding snapshot, the logic The disk is about to be performed (4) the data of the person's information is backed up; when there is a snapshot-reading request, it is determined whether there is a requested data address in one of the snapshots corresponding to the read request; The requested data address does not exist in the snapshot, and the corresponding time point of the snapshot is not - the most pie _ hour' _ after the rhyme is later than the (four) corresponding to the time (the fifth point) depends on the snapshot 'until the search The request data address and read one of the snapshot data under the request data address. For example, if the requesting data address exists in the snapshot, the snapshot data of the logical disk manager described in the claim 1 is directly read. 3. The snapshot management method of the logical disk manager as described in claim 1, wherein the request data address does not exist in the snapshot, and the corresponding time point of the snapshot is the last time When it is clicked, it reads the original data in the logical disk corresponding to one of the 21 Γ 296776 material addresses. 4 soil such as Shen kiss patent range! The logical disk manager described in the item is about to earn a bribe, and the deletion should be the address of the data. ===== Axis is in the photo. L is a logic. The law, the financial method includes the following steps: * Shao · In the case of a logical magnetic data request, the snapshot has a plurality of snapshots corresponding to different time_, to find the data to be written in the logical disk The data address; and the data under the data address to which the logical disk is to be written is backed up according to a snapshot of the last time point corresponding to the write copy operation. The snapshot management method of the logical disk management II described in claim 5 of the patent domain further includes the following steps: /presence__, when reading the request, whether there is a request in one of the snapshots corresponding to the read request The data address; and the request data address does not exist in the backup snapshot, and the corresponding time point of the snapshot is not 疋 - the last time point... then the backward looking for the corresponding time of the snapshot Snapshot, until the search for the data address, and read one of the snapshot data under the request data address. 22 1296776 7·If you apply for the Snapshot Management Method of the Logic Disk Manager described in item 6 of the scope of the patent application, the Snapshot Management Method of the Logic Manager is described in the Snapshot. At the time, the data of one of the request data addresses is directly read. ,, Shi Shen #Special H, the logical management of the logical disk manager described in the sixth item, ', towel (five) " paper,,, towel does not exist the request: #料 address, and the corresponding When the _ is the last time point, the original data in the logical disk corresponding to the requested data address is read. 9. The snapshot manager T' of the logical disk processor described in item 5 of the patent scope, wherein when a snapshot needs to be deleted from the plurality of snapshots, and the corresponding time point of the deletion is known If not—the earliest time _, the data under the corresponding data address in the deleted snapshot is added to its previous snapshot. twenty three
TW094142685A 2005-12-02 2005-12-02 Snapshot management method for a logical diskette manager TW200723102A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW094142685A TW200723102A (en) 2005-12-02 2005-12-02 Snapshot management method for a logical diskette manager

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW094142685A TW200723102A (en) 2005-12-02 2005-12-02 Snapshot management method for a logical diskette manager

Publications (2)

Publication Number Publication Date
TW200723102A TW200723102A (en) 2007-06-16
TWI296776B true TWI296776B (en) 2008-05-11

Family

ID=45068874

Family Applications (1)

Application Number Title Priority Date Filing Date
TW094142685A TW200723102A (en) 2005-12-02 2005-12-02 Snapshot management method for a logical diskette manager

Country Status (1)

Country Link
TW (1) TW200723102A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI421712B (en) * 2008-05-31 2014-01-01 Lsi Corp Storage area network system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI421712B (en) * 2008-05-31 2014-01-01 Lsi Corp Storage area network system

Also Published As

Publication number Publication date
TW200723102A (en) 2007-06-16

Similar Documents

Publication Publication Date Title
CN103514249B (en) A kind of automatic data reduction and system and storage device
JP5023018B2 (en) Storage system and data management method
CN106055431B (en) The method and device of backup and recovery based on the online rollback of snapshot
TWI291097B (en) File system snapshot with ditto address feature
CN107798130B (en) Method for storing snapshot in distributed mode
CN103761190B (en) Data processing method and apparatus
TW201205286A (en) Controller, data storage device, and program product
TW201220060A (en) Latency reduction associated with a response to a request in a storage system
JP2008243138A (en) Storage system and data restoration method
JP2004342050A (en) Method for maintaining a plurality of snapshots, server system and storage system
CN103365744A (en) System and method using metadata image backup and traditional backup
CN103617097B (en) File access pattern method and device
CN100504799C (en) Method for snapping magnetic disc using snap index
JP2006215868A (en) Backup generation device, recovery processor, backup generation method, recovery processing method and program
CN104281717B (en) A kind of method for setting up magnanimity ID mapping relations
CN105718217A (en) Method and device for maintaining data consistency of thin provisioning database
CN108604165A (en) Storage device
TWI353549B (en)
CN109144416A (en) The method and apparatus for inquiring data
CN102201005A (en) Method for distributing streaming media enhanced file of file system
CN102799542B (en) Disk protection system of tree-form multilayer cover layer of sector increment and implementing method thereof
CN108595589A (en) A kind of efficient access method of magnanimity science data picture
TWI358023B (en) Method and apparatus combining once-writeable and
TWI296776B (en)
JPWO2013046342A1 (en) Virtual tape device and control method of virtual tape device

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees