{"id":32477,"date":"2019-10-31T21:47:17","date_gmt":"2019-10-31T18:47:17","guid":{"rendered":"https:\/\/prohoster.info\/blog\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\/"},"modified":"2019-10-31T21:47:17","modified_gmt":"2019-10-31T18:47:17","slug":"rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","status":"publish","type":"post","link":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","title":{"rendered":"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><img decoding=\"async\" alt=\"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed\" src=\"\/wp-content\/uploads\/2019\/04\/08d5ae9677c96628896868d3e19efd8f.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\nPro\u010d je d\u016fle\u017eit\u00e9 d\u011blat z\u00e1lohy? V\u017edy\u0165 hardware je velmi spolehliv\u00fd a nav\u00edc existuj\u00ed \u201ecloudy\u201c, kter\u00e9 jsou spolehliv\u011bj\u0161\u00ed ne\u017e fyzick\u00e9 servery: p\u0159i spr\u00e1vn\u00e9m nastaven\u00ed \u201ecloudov\u00fd\u201c server snadno p\u0159e\u017eije selh\u00e1n\u00ed fyzick\u00e9ho infrastrukturn\u00edho serveru, a z pohledu u\u017eivatel\u016f slu\u017eeb dojde k nepatrn\u00e9mu, t\u00e9m\u011b\u0159 nepost\u0159ehnuteln\u00e9mu n\u00e1r\u016fstu doby zpracov\u00e1n\u00ed. Nav\u00edc duplikace informac\u00ed \u010dasto vy\u017eaduje zaplatit za \u201enadbyte\u010dn\u00fd\u201c procesorov\u00fd \u010das, diskovou z\u00e1t\u011b\u017e a s\u00ed\u0165ov\u00fd provoz.<br \/>\n<noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<blockquote><p>Ide\u00e1ln\u00ed program rychle pracuje, nezat\u011b\u017euje opera\u010dn\u00ed pam\u011b\u0165, nem\u00e1 chyby a neexistuje.<\/p>\n<p>\u2014Nezn\u00e1m\u00fd<\/p><\/blockquote>\n<p> Proto\u017ee programy st\u00e1le p\u00ed\u0161\u00ed lidsk\u00fd v\u00fdvoj\u00e1\u0159i a proces testov\u00e1n\u00ed \u010dasto chyb\u00ed, nav\u00edc se dod\u00e1vka program\u016f velmi z\u0159\u00eddka prov\u00e1d\u00ed za pou\u017eit\u00ed \u201ebest practices\u201c (kter\u00e9 jsou samy o sob\u011b tak\u00e9 programy, a tud\u00ed\u017e nejsou dokonal\u00e9), syst\u00e9mov\u00fdm administr\u00e1tor\u016fm \u010dasto p\u0159ich\u00e1z\u00ed \u0159e\u0161it \u00fakoly, kter\u00e9 zn\u00ed stru\u010dn\u011b, ale v\u00fdsti\u017en\u011b: \u201evr\u00e1tit zp\u011bt, jak to bylo\u201c, \u201edostat datab\u00e1zi do norm\u00e1ln\u00edho stavu\u201c, \u201efunguje pomalu\u2014vr\u00e1t\u00edme to zp\u011bt\u201c a tak\u00e9 m\u016fj obl\u00edben\u00fd \u201enev\u00edm co, ale oprav\u201c.<\/p>\n<p>Krom\u011b logick\u00fdch chyb, kter\u00e9 se objevuj\u00ed v d\u016fsledku nepe\u010dliv\u00e9 pr\u00e1ce v\u00fdvoj\u00e1\u0159\u016f nebo souhrou okolnost\u00ed, a tak\u00e9 ne\u00fapln\u00e9ho pochopen\u00ed nebo znalost\u00ed drobn\u00fdch aspekt\u016f v\u00fdvoje program\u016f \u2014 v\u010detn\u011b vazebn\u00edch a syst\u00e9mov\u00fdch, jako jsou opera\u010dn\u00ed syst\u00e9my, ovlada\u010de a firmware \u2014 existuj\u00ed tak\u00e9 jin\u00e9 chyby. Nap\u0159\u00edklad v\u011bt\u0161ina v\u00fdvoj\u00e1\u0159\u016f se spol\u00e9h\u00e1 na runtime, zcela zapom\u00ednaje na fyzik\u00e1ln\u00ed z\u00e1kony, kter\u00e9 nelze obch\u00e1zet pomoc\u00ed program\u016f. To zahrnuje bezmezn\u00e9 spolehlivosti diskov\u00e9ho subsyst\u00e9mu a jak\u00e9hokoli syst\u00e9mu pro ukl\u00e1d\u00e1n\u00ed dat (v\u010detn\u011b opera\u010dn\u00ed pam\u011bti a procesorov\u00e9 cache!), nulov\u00fd \u010das zpracov\u00e1n\u00ed na procesoru, a absence chyb p\u0159i p\u0159enosu po s\u00edti a p\u0159i zpracov\u00e1n\u00ed na procesoru, a zpo\u017ed\u011bn\u00ed s\u00edt\u011b, kter\u00e9 jsou rovny 0. Nen\u00ed dobr\u00e9 podce\u0148ovat ani proslul\u00fd term\u00edn dod\u00e1n\u00ed, proto\u017ee pokud se nedodr\u017e\u00ed \u2014 budou probl\u00e9my mnohem v\u00edc ne\u017e jemnosti pr\u00e1ce s\u00edt\u011b a disku.<\/p>\n<p><img decoding=\"async\" alt=\"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed\" src=\"\/wp-content\/uploads\/2019\/04\/fed33628de53de522bae208f52fd7811.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nJak si poradit s probl\u00e9my, kter\u00e9 se naskytuj\u00ed a vis\u00ed nad cenn\u00fdmi daty? \u017div\u00e9 v\u00fdvoj\u00e1\u0159e nelze nahradit a nen\u00ed jist\u00e9, \u017ee to bude mo\u017en\u00e9 v bl\u00edzk\u00e9 dob\u011b. Na druhou stranu pln\u011b prok\u00e1zat, \u017ee program bude fungovat tak, jak bylo zam\u00fd\u0161leno, se poda\u0159ilo pouze n\u011bkolika projekt\u016fm, a rozhodn\u011b nebude v\u017edy mo\u017en\u00e9 vz\u00edt a pou\u017e\u00edt d\u016fkazy na jin\u00e9 podobn\u00e9 projekty. Takov\u00e9 d\u016fkazy nav\u00edc zab\u00edraj\u00ed spoustu \u010dasu a vy\u017eaduj\u00ed specifick\u00e9 dovednosti a znalosti, co\u017e prakticky minimalizuje mo\u017enost jejich pou\u017eit\u00ed s ohledem na term\u00edny. Krom\u011b toho je\u0161t\u011b neum\u00edme vytvo\u0159it superrychl\u00e9, levn\u00e9 a nekone\u010dn\u011b spolehliv\u00e9 technologie pro ukl\u00e1d\u00e1n\u00ed, zpracov\u00e1n\u00ed a p\u0159enos informac\u00ed. Takov\u00e9 technologie, pokud v\u016fbec existuj\u00ed, jsou v\u011bt\u0161inou v podob\u011b koncept\u016f nebo \u2014 \u010dast\u011bji \u2014 pouze ve fantastick\u00fdch knih\u00e1ch a filmech.<\/p>\n<blockquote><p>Dob\u0159\u00ed um\u011blci kop\u00edruj\u00ed, velc\u00ed um\u011blci kradou.<\/p>\n<p>\u2014Pablo Picasso.<\/p><\/blockquote>\n<p> Ty nej\u00fasp\u011b\u0161n\u011bj\u0161\u00ed \u0159e\u0161en\u00ed a p\u0159ekvapiv\u011b jednoduch\u00e9 v\u011bci obvykle vznikaj\u00ed tam, kde se setk\u00e1vaj\u00ed na prvn\u00ed pohled naprosto neslu\u010diteln\u00e9 pojmy, technologie, znalosti a oblasti v\u011bdy.<\/p>\n<p>Nap\u0159\u00edklad pt\u00e1ci a letadla maj\u00ed k\u0159\u00eddla, p\u0159esto\u017ee i p\u0159es funk\u010dn\u00ed podobnost \u2014 v n\u011bkter\u00fdch re\u017eimech se principy shoduj\u00ed a technick\u00e9 probl\u00e9my se \u0159e\u0161\u00ed podobn\u011b: dut\u00e9 kosti, pou\u017eit\u00ed pevn\u00fdch a lehk\u00fdch materi\u00e1l\u016f atd. \u2014 v\u00fdsledky jsou naprosto odli\u0161n\u00e9, i kdy\u017e velmi podobn\u00e9. Nejlep\u0161\u00ed vzory, kter\u00e9 pozorujeme v na\u0161\u00ed technologii, jsou tak\u00e9 v\u011bt\u0161inou p\u0159evzaty z p\u0159\u00edrody: hermetick\u00e9 prostory u lod\u00ed a ponorek \u2014 p\u0159\u00edm\u00e1 analogie s krou\u017ekov\u00fdmi \u010dervy; stavba raid-masiv\u016f a kontrola integrity dat \u2014 duplicita DNA \u0159et\u011bzce; a tak\u00e9 p\u00e1rov\u00e9 org\u00e1ny, nez\u00e1vislost pr\u00e1ce r\u016fzn\u00fdch org\u00e1n\u016f na CNS (automatika pr\u00e1ce srdce) a reflexy \u2014 autonomn\u00ed syst\u00e9my na internetu. Samoz\u0159ejm\u011b br\u00e1t a aplikovat hotov\u00e1 \u0159e\u0161en\u00ed \u201ez fleku\u201c je zr\u00e1dn\u00e9, ale kdo v\u00ed, mo\u017en\u00e1 jin\u00e1 \u0159e\u0161en\u00ed ani neexistuj\u00ed.<\/p>\n<blockquote><p>Kdybych jen v\u011bd\u011bl, kde spadnu \u2014 podlo\u017eil bych si sl\u00e1mu!<\/p>\n<p>\u2014B\u011blorusk\u00e9 lidov\u00e9 p\u0159\u00edslov\u00ed<\/p><\/blockquote>\n<p> Tak\u017ee z\u00e1lohy jsou \u017eivotn\u011b nezbytn\u00e9 pro ty, kdo cht\u011bj\u00ed:<\/p>\n<ul>\n<li>M\u00edt mo\u017enost obnovit chod sv\u00fdch syst\u00e9m\u016f s minim\u00e1ln\u00edmi prostoji, a klidn\u011b i bez nich.<\/li>\n<li>Jednejte odv\u00e1\u017en\u011b, proto\u017ee v p\u0159\u00edpad\u011b chyby je v\u017edy mo\u017enost vr\u00e1tit se zp\u011bt.<\/li>\n<li>Minimalizovat n\u00e1sledky \u00famysln\u00e9ho po\u0161kozen\u00ed dat.<\/li>\n<\/ul>\n<p>\n<b class=\"spoiler_title\">Zde je trochu teorie.<\/b><\/p>\n<blockquote><p>Jak\u00e1koliv klasifikace je libovoln\u00e1. P\u0159\u00edroda nekategoruje. Kategorizujeme my, proto\u017ee n\u00e1m to usnad\u0148uje pr\u00e1ci. A klasifikujeme podle \u00fadaj\u016f, kter\u00e9 rovn\u011b\u017e vol\u00edme libovoln\u011b.<\/p>\n<p>\u2014Jean Bruy\u00e8re<\/p><\/blockquote>\n<p> Bez ohledu na fyzick\u00fd zp\u016fsob uchov\u00e1n\u00ed lze logick\u00e9 ukl\u00e1d\u00e1n\u00ed dat naprosto zjednodu\u0161en\u011b rozd\u011blit na 2 zp\u016fsoby p\u0159\u00edstupu k t\u011bmto dat\u016fm: blokov\u00fd a souborov\u00fd. Toto rozd\u011blen\u00ed je v posledn\u00ed dob\u011b velmi nejasn\u00e9, proto\u017ee \u010dist\u011b blokov\u00e1 i \u010dist\u011b souborov\u00e1 logick\u00e1 \u00falo\u017ei\u0161t\u011b neexistuj\u00ed. Nicm\u00e9n\u011b pro jednodu\u0161\u0161\u00ed p\u0159edstavu budeme p\u0159edpokl\u00e1dat, \u017ee existuj\u00ed.<\/p>\n<p>Blokov\u00e9 ukl\u00e1d\u00e1n\u00ed dat znamen\u00e1, \u017ee existuje fyzick\u00e9 za\u0159\u00edzen\u00ed, na kter\u00e9 se ukl\u00e1daj\u00ed data v ur\u010dit\u00fdch pevn\u00fdch porc\u00edch, bloc\u00edch. P\u0159\u00edstup k blok\u016fm prob\u00edh\u00e1 na z\u00e1klad\u011b ur\u010dit\u00e9 adresy, ka\u017ed\u00fd blok m\u00e1 sv\u016fj vlastn\u00ed adresu v r\u00e1mci za\u0159\u00edzen\u00ed.<\/p>\n<p>Z\u00e1loha se obvykle prov\u00e1d\u00ed kop\u00edrov\u00e1n\u00edm blok\u016f dat. Aby byla zaji\u0161t\u011bna integrita dat v okam\u017eiku kop\u00edrov\u00e1n\u00ed, je pozastaveno zapisov\u00e1n\u00ed nov\u00fdch blok\u016f a tak\u00e9 zm\u011bna st\u00e1vaj\u00edc\u00edch. Pokud pou\u017eijeme analogii z b\u011b\u017en\u00e9ho sv\u011bta \u2014 nejbl\u00ed\u017ee je to sk\u0159\u00ed\u0148 s identicky \u010d\u00edslovan\u00fdmi p\u0159ihr\u00e1dkami.<\/p>\n<p><img decoding=\"async\" alt=\"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed\" src=\"\/wp-content\/uploads\/2019\/04\/32408012dbd29ec2e227602351d4bba6.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nSouborov\u00e9 ukl\u00e1d\u00e1n\u00ed dat na principu logick\u00e9ho za\u0159\u00edzen\u00ed je bl\u00edzk\u00e9 blokov\u00e9mu a \u010dasto se organizuje nad n\u00edm. Hlavn\u00ed rozd\u00edly spo\u010d\u00edvaj\u00ed v existenci hierarchie ukl\u00e1d\u00e1n\u00ed a lidsky \u010diteln\u00fdch n\u00e1zvech. Vytv\u00e1\u0159\u00ed se abstrakce ve form\u011b souboru \u2014 pojmenovan\u00e9 oblasti dat, a tak\u00e9 adres\u00e1\u0159e \u2014 speci\u00e1ln\u00edho souboru, ve kter\u00e9m se uchov\u00e1vaj\u00ed popisy a p\u0159\u00edstupy k dal\u0161\u00edm soubor\u016fm. Soubory mohou b\u00fdt dopln\u011bny o dal\u0161\u00ed metadata: \u010das vytvo\u0159en\u00ed, p\u0159\u00edstupov\u00e9 vlajky atd. Z\u00e1lohov\u00e1n\u00ed obvykle prob\u00edh\u00e1 takto: hledaj\u00ed se zm\u011bn\u011bn\u00e9 soubory, kter\u00e9 se pot\u00e9 kop\u00edruj\u00ed do jin\u00e9ho, strukturovan\u011b podobn\u00e9ho souborov\u00e9ho \u00falo\u017ei\u0161t\u011b. Integrita dat se obvykle zaji\u0161\u0165uje t\u00edm, \u017ee neexistuj\u00ed soubory, do kter\u00fdch se zapisuje. Metadata soubor\u016f se z\u00e1lohuj\u00ed podobn\u011b. Nejlep\u0161\u00ed analogie \u2014 knihovna, ve kter\u00e9 existuj\u00ed sekce s r\u016fzn\u00fdmi knihami a tak\u00e9 katalog s lidsky \u010diteln\u00fdmi n\u00e1zvy knih.<\/p>\n<p><img decoding=\"async\" alt=\"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed\" src=\"\/wp-content\/uploads\/2019\/04\/796162e24eb255a27c51c6077bcb1f07.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nV posledn\u00ed dob\u011b se ob\u010das popisuje dal\u0161\u00ed varianta, od kter\u00e9 v podstat\u011b za\u010dalo souborov\u00e9 ukl\u00e1d\u00e1n\u00ed dat a kter\u00e1 m\u00e1 stejn\u00e9 archaick\u00e9 rysy: objektov\u00e9 ukl\u00e1d\u00e1n\u00ed dat.<\/p>\n<p>Na souborov\u00e9m \u00falo\u017ei\u0161ti se li\u0161\u00ed t\u00edm, \u017ee nem\u00e1 v\u00edce ne\u017e jedno vno\u0159en\u00ed (ploch\u00e9 sch\u00e9ma), a i kdy\u017e jsou n\u00e1zvy soubor\u016f lid\u0161t\u011b \u010diteln\u00e9, jsou p\u0159esto v\u00edce p\u0159izp\u016fsobeny pro strojov\u00e9 zpracov\u00e1n\u00ed. P\u0159i z\u00e1lohov\u00e1n\u00ed se objektov\u00e1 \u00falo\u017ei\u0161t\u011b v\u011bt\u0161inou zpracov\u00e1vaj\u00ed podobn\u011b jako souborov\u00e1, ale ob\u010das existuj\u00ed i jin\u00e9 varianty.<\/p>\n<blockquote><p> \u2014 Existuj\u00ed dva druhy syst\u00e9mov\u00fdch administr\u00e1tor\u016f: ti, kte\u0159\u00ed ned\u011blaj\u00ed z\u00e1lohy, a ti, kte\u0159\u00ed JI\u017d d\u011blaj\u00ed.<br \/>\n\u2014 Ve skute\u010dnosti existuj\u00ed t\u0159i druhy: jsou je\u0161t\u011b ti, kte\u0159\u00ed kontroluj\u00ed, \u017ee z\u00e1lohy lze obnovit.<\/p>\n<p>\u2014Nezn\u00e1m\u00fd<\/p><\/blockquote>\n<p> Je tak\u00e9 d\u016fle\u017eit\u00e9 rozum\u011bt tomu, \u017ee samotn\u00fd proces z\u00e1lohov\u00e1n\u00ed dat je \u0159\u00edzen programy, tak\u017ee m\u00e1 v\u0161echny stejn\u00e9 nev\u00fdhody jako jin\u00fd program. Abychom se zbavili (ne vylou\u010dili!) z\u00e1vislosti na lidsk\u00e9m faktoru, stejn\u011b jako zvl\u00e1\u0161tnostech \u2013 kter\u00e9 jednotliv\u011b nemus\u00ed m\u00edt velk\u00fd vliv, ale dohromady mohou m\u00edt v\u00fdrazn\u00fd efekt \u2013 pou\u017e\u00edv\u00e1 se takzvan\u00e9 pravidlo 3-2-1. Existuje mnoho variant, jak to vylo\u017eit, ale mn\u011b se v\u00edce l\u00edb\u00ed n\u00e1sleduj\u00edc\u00ed v\u00fdklad: je t\u0159eba uchov\u00e1vat 3 sady stejn\u00fdch dat, 2 sady je t\u0159eba uchov\u00e1vat v r\u016fzn\u00fdch form\u00e1tech a tak\u00e9 1 sada mus\u00ed b\u00fdt na geograficky vzd\u00e1len\u00e9m \u00falo\u017ei\u0161ti.<\/p>\n<p>Pod form\u00e1tem ukl\u00e1d\u00e1n\u00ed se rozum\u00ed n\u00e1sleduj\u00edc\u00ed:<\/p>\n<ul>\n<li>Pokud existuje z\u00e1vislost na fyzick\u00e9m zp\u016fsobu ukl\u00e1d\u00e1n\u00ed \u2014 zm\u011bn\u00edme fyzick\u00fd zp\u016fsob.<\/li>\n<li>Pokud existuje z\u00e1vislost na logick\u00e9m zp\u016fsobu ukl\u00e1d\u00e1n\u00ed \u2014 zm\u011bn\u00edme logick\u00fd zp\u016fsob.<\/li>\n<\/ul>\n<p>\nPro dosa\u017een\u00ed maxim\u00e1ln\u00edho efektu pravidla 3-2-1 se doporu\u010duje m\u011bnit form\u00e1t ukl\u00e1d\u00e1n\u00ed ob\u011bma zp\u016fsoby.<\/p>\n<p>Z hlediska p\u0159ipravenosti z\u00e1lohy pro jej\u00ed p\u0159\u00edm\u00fd \u00fa\u010del \u2014 obnoven\u00ed funk\u010dnosti \u2014 se rozli\u0161uj\u00ed \u201ehork\u00e9\u201c a \u201echladn\u00e9\u201c z\u00e1lohy. Hork\u00e9 se od chladn\u00fdch li\u0161\u00ed pouze jedn\u00edm: jsou okam\u017eit\u011b p\u0159ipraveny k pou\u017eit\u00ed, zat\u00edmco chladn\u00e9 pro obnoven\u00ed vy\u017eaduj\u00ed n\u011bkter\u00e9 dal\u0161\u00ed akce: de\u0161ifrov\u00e1n\u00ed, extrakci z archivu atd.<\/p>\n<p>Nen\u00ed dobr\u00e9 zam\u011b\u0148ovat hork\u00e9 a studen\u00e9 kopie s online a offline kopiemi, kter\u00e9 znamenaj\u00ed fyzickou izolaci dat, a v podstat\u011b p\u0159edstavuj\u00ed jin\u00fd zp\u016fsob klasifikace z\u00e1lohovac\u00edch metod. Offline kopie \u2013 kter\u00e1 nen\u00ed p\u0159\u00edmo p\u0159ipojena k syst\u00e9mu, ze kter\u00e9ho m\u00e1 b\u00fdt obnovena \u2013 m\u016f\u017ee b\u00fdt jak hork\u00e1, tak studen\u00e1 (z pohledu p\u0159ipravenosti k obnoven\u00ed). Online kopie m\u016f\u017ee b\u00fdt dostupn\u00e1 p\u0159\u00edmo tam, kde m\u00e1 b\u00fdt obnovena, a \u010dasto b\u00fdv\u00e1 hork\u00e1, av\u0161ak mohou existovat i studen\u00e9 kopie.<\/p>\n<p>Krom\u011b toho nesm\u00edme zapom\u00ednat, \u017ee samotn\u00fd proces vytv\u00e1\u0159en\u00ed z\u00e1loh obvykle nekon\u010d\u00ed vytvo\u0159en\u00edm jedn\u00e9 z\u00e1lohy, ale z\u00e1loh m\u016f\u017ee b\u00fdt pom\u011brn\u011b velk\u00fd po\u010det. Proto je t\u0159eba rozli\u0161ovat mezi \u00fapln\u00fdmi z\u00e1lohami, tedy t\u011bmi, kter\u00e9 lze obnovit nez\u00e1visle na ostatn\u00edch z\u00e1loh\u00e1ch, a tak\u00e9 mezi rozd\u00edlov\u00fdmi (inkrement\u00e1ln\u00edmi, diferen\u010dn\u00edmi, dekrement\u00e1ln\u00edmi atd.) kopiemi \u2013 tedy t\u011bmi, kter\u00e9 nelze obnovit samostatn\u011b a vy\u017eaduj\u00ed p\u0159edchoz\u00ed obnovu jedn\u00e9 nebo n\u011bkolika dal\u0161\u00edch z\u00e1loh.<\/p>\n<p>Rozd\u00edlov\u00e9 inkrement\u00e1ln\u00ed kopie jsou pokusem u\u0161et\u0159it m\u00edsto pro ukl\u00e1d\u00e1n\u00ed z\u00e1loh. Tak\u017ee do z\u00e1lohy se zapisuj\u00ed pouze zm\u011bn\u011bn\u00e1 data od posledn\u00ed z\u00e1lohy.<\/p>\n<p>Rozd\u00edlov\u00e9 dekrement\u00e1ln\u00ed kopie se vytv\u00e1\u0159ej\u00ed se stejn\u00fdm c\u00edlem, ale trochu jin\u00fdm zp\u016fsobem: vytvo\u0159\u00ed se \u00fapln\u00e1 z\u00e1loha, ale ve skute\u010dnosti se uchov\u00e1v\u00e1 pouze rozd\u00edl mezi aktu\u00e1ln\u00ed kopi\u00ed a p\u0159edchoz\u00ed.<\/p>\n<p>Separ\u00e1tn\u011b je t\u0159eba zv\u00e1\u017eit proces z\u00e1lohov\u00e1n\u00ed nad \u00falo\u017ei\u0161t\u011bm, kter\u00e9 podporuje absenci duplicitn\u00edho ukl\u00e1d\u00e1n\u00ed. Tak\u017ee pokud se nad n\u00edm p\u00ed\u0161\u00ed \u00fapln\u00e9 z\u00e1lohy, ve skute\u010dnosti se zap\u00ed\u0161e pouze rozd\u00edl mezi z\u00e1lohami, av\u0161ak proces obnovy z\u00e1loh prob\u011bhne obdobn\u011b jako obnovov\u00e1n\u00ed z \u00fapln\u00e9 kopie a zcela transparentn\u011b.<\/p>\n<blockquote><p>Quis custodiet ipsos custodes?<\/p>\n<p>(Kdo str\u00e1\u017e\u00ed str\u00e1\u017ece? \u2014 lat.)<\/p><\/blockquote>\n<p>Je velmi nep\u0159\u00edjemn\u00e9, kdy\u017e z\u00e1lohy chyb\u00ed, av\u0161ak mnohem hor\u0161\u00ed je, pokud je z\u00e1loha sice provedena, ale p\u0159i obnov\u011b se zjist\u00ed, \u017ee nelze obnovit, proto\u017ee:<\/p>\n<ul>\n<li>Integrita p\u016fvodn\u00edch dat byla poru\u0161ena.<\/li>\n<li>\u00dalo\u017ei\u0161t\u011b se z\u00e1lohami je po\u0161kozeno.<\/li>\n<li>Obnova prob\u00edh\u00e1 pom\u011brn\u011b pomalu, nelze pou\u017e\u00edvat data, kter\u00e1 byla \u010d\u00e1ste\u010dn\u011b obnovena.<\/li>\n<\/ul>\n<p>Spr\u00e1vn\u011b nastaven\u00fd proces z\u00e1lohov\u00e1n\u00ed by m\u011bl br\u00e1t v \u00favahu podobn\u00e9 pozn\u00e1mky, zejm\u00e9na prvn\u00ed dv\u011b.<\/p>\n<p>Integritu p\u016fvodn\u00edch dat lze zaru\u010dit n\u011bkolika zp\u016fsoby. Nej\u010dast\u011bji se pou\u017e\u00edvaj\u00ed n\u00e1sleduj\u00edc\u00ed: a) tvorba sn\u00edmk\u016f souborov\u00e9ho syst\u00e9mu na \u00farovni blok\u016f, b) 'zmrazen\u00ed' stavu souborov\u00e9ho syst\u00e9mu, c) speci\u00e1ln\u00ed blokov\u00e9 za\u0159\u00edzen\u00ed s ukl\u00e1d\u00e1n\u00edm verz\u00ed, d) sekven\u010dn\u00ed z\u00e1pis soubor\u016f nebo blok\u016f. Tak\u00e9 se pou\u017e\u00edvaj\u00ed kontroln\u00ed sou\u010dty pro zaji\u0161t\u011bn\u00ed kontroly dat p\u0159i obnov\u011b.<\/p>\n<p>Po\u0161kozen\u00ed \u00falo\u017ei\u0161t\u011b lze tak\u00e9 odhalit pomoc\u00ed kontroln\u00edch sou\u010dt\u016f. Dal\u0161\u00ed metodou je pou\u017eit\u00ed specializovan\u00fdch za\u0159\u00edzen\u00ed nebo souborov\u00fdch syst\u00e9m\u016f, ve kter\u00fdch nelze m\u011bnit ji\u017e zapsan\u00e1 data, ale lze p\u0159id\u00e1vat nov\u00e1.<\/p>\n<p>Pro urychlen\u00ed obnovy se pou\u017e\u00edv\u00e1 obnoven\u00ed dat s n\u011bkolika procesy pro obnovu - za p\u0159edpokladu, \u017ee neexistuje '\u00fazk\u00e9 hrdlo' v podob\u011b pomal\u00e9 s\u00edt\u011b nebo pomal\u00e9ho diskov\u00e9ho syst\u00e9mu. Aby se p\u0159ede\u0161lo situaci s \u010d\u00e1ste\u010dn\u011b obnoven\u00fdmi daty, lze proces z\u00e1lohov\u00e1n\u00ed rozd\u011blit na relativn\u011b mal\u00e9 pod\u00fakoly, z nich\u017e ka\u017ed\u00fd se prov\u00e1d\u00ed samostatn\u011b. Takov\u00fdm zp\u016fsobem vznik\u00e1 mo\u017enost sekven\u010dn\u011b obnovit funk\u010dnost s p\u0159edpokladem \u010dasu obnovy. Tento probl\u00e9m \u010dasto le\u017e\u00ed v organiza\u010dn\u00ed rovin\u011b (SLA), proto se na to nebudeme podrobn\u011bji zastavovat.<\/p>\n<blockquote><p>O ko\u0159en\u00ed v\u00ed nejl\u00e9pe ten, kdo je nep\u0159id\u00e1v\u00e1 do ka\u017ed\u00e9ho j\u00eddla, ale ten, kdo nikdy do n\u011bj ned\u00e1 nic zbyte\u010dn\u00e9ho.<\/p>\n<p>\u2014V. Sinjavskij<\/p><\/blockquote>\n<p>Praxe v pou\u017e\u00edvan\u00e9m softwaru u syst\u00e9mov\u00fdch administr\u00e1tor\u016f se m\u016f\u017ee li\u0161it, ale obecn\u00e9 principy jsou p\u0159esto, tak \u010di onak, stejn\u00e9, a to zejm\u00e9na:<\/p>\n<ul>\n<li>D\u016frazn\u011b se doporu\u010duje pou\u017e\u00edvat hotov\u00e1 \u0159e\u0161en\u00ed.<\/li>\n<li>Programy by m\u011bly fungovat p\u0159edv\u00eddateln\u011b, tj. nem\u011bly by existovat nedokumentovan\u00e9 vlastnosti nebo \u00fazk\u00e1 m\u00edsta.<\/li>\n<li>Nastaven\u00ed ka\u017ed\u00e9ho programu by m\u011blo b\u00fdt dostate\u010dn\u011b jednoduch\u00e9, aby se ka\u017edou chv\u00edli nemusela \u010d\u00edst p\u0159\u00edru\u010dka nebo tah\u00e1k.<\/li>\n<li>\u0158e\u0161en\u00ed by m\u011blo b\u00fdt co nejv\u00edce univerz\u00e1ln\u00ed, proto\u017ee servery se mohou v\u00fdrazn\u011b li\u0161it sv\u00fdmi hardwarov\u00fdmi charakteristikami.<\/li>\n<\/ul>\n<p>Pro z\u00e1lohov\u00e1n\u00ed z blokov\u00fdch za\u0159\u00edzen\u00ed existuj\u00ed n\u00e1sleduj\u00edc\u00ed b\u011b\u017en\u00e9 programy:<\/p>\n<ul>\n<li>dd, zn\u00e1m\u00fd veter\u00e1n\u016fm syst\u00e9mov\u00e9ho administrativy, sem pat\u0159\u00ed tak\u00e9 podobn\u00e9 programy (nap\u0159\u00edklad dd_rescue).<\/li>\n<li>Vestav\u011bn\u00e9 programy (n\u00e1stroje) n\u011bkter\u00fdch souborov\u00fdch syst\u00e9m\u016f, kter\u00e9 vytv\u00e1\u0159ej\u00ed kopii (dump) souborov\u00e9ho syst\u00e9mu.<\/li>\n<li>V\u0161eobecn\u00e9 n\u00e1stroje; nap\u0159\u00edklad partclone.<\/li>\n<li>Vlastn\u00ed, \u010dasto propriet\u00e1rn\u00ed \u0159e\u0161en\u00ed; nap\u0159\u00edklad NortonGhost a nov\u011bj\u0161\u00ed verze.<\/li>\n<\/ul>\n<p>Pro souborov\u00e9 syst\u00e9my lze \u00falohu z\u00e1lohov\u00e1n\u00ed \u010d\u00e1ste\u010dn\u011b vy\u0159e\u0161it pomoc\u00ed metod aplikovan\u00fdch na blokov\u00e1 za\u0159\u00edzen\u00ed, ale je mo\u017en\u00e9 ji vy\u0159e\u0161it i efektivn\u011bji, nap\u0159\u00edklad:<\/p>\n<ul>\n<li>Rsync, univerz\u00e1ln\u00ed program a protokol pro synchronizaci stavu souborov\u00fdch syst\u00e9m\u016f.<\/li>\n<li>Vestav\u011bn\u00e9 n\u00e1stroje pro archivaci (ZFS).<\/li>\n<li>Extern\u00ed n\u00e1stroje pro archivaci; nejpopul\u00e1rn\u011bj\u0161\u00ed z nich je tar. Existuj\u00ed i dal\u0161\u00ed, nap\u0159\u00edklad dar \u2014 n\u00e1hrada tar zam\u011b\u0159en\u00e1 na modern\u00ed syst\u00e9my.<\/li>\n<\/ul>\n<p>\nSamostatn\u011b je t\u0159eba zm\u00ednit software pro zaji\u0161t\u011bn\u00ed konzistence dat p\u0159i vytv\u00e1\u0159en\u00ed z\u00e1loh. Nej\u010dast\u011bji se pou\u017e\u00edvaj\u00ed n\u00e1sleduj\u00edc\u00ed varianty:<\/p>\n<ul>\n<li>P\u0159ipojen\u00ed souborov\u00e9ho syst\u00e9mu v re\u017eimu pouze pro \u010dten\u00ed (ReadOnly) nebo zmrazen\u00ed souborov\u00e9ho syst\u00e9mu (freeze) \u2014 metoda je vyu\u017eiteln\u00e1 omezen\u011b.<\/li>\n<li>Vytv\u00e1\u0159en\u00ed kopi\u00ed stavu souborov\u00e9ho syst\u00e9mu nebo blokov\u00e9ho za\u0159\u00edzen\u00ed (LVM, ZFS).<\/li>\n<li>Pou\u017eit\u00ed extern\u00edch n\u00e1stroj\u016f pro organizaci kopi\u00ed, i kdy\u017e p\u0159edchoz\u00ed body nelze z n\u011bjak\u00e9ho d\u016fvodu zajistit (programy typu hotcopy).<\/li>\n<li>Technika kop\u00edrov\u00e1n\u00ed p\u0159i zm\u011bn\u011b (CopyOnWrite), nicm\u00e9n\u011b je v\u011bt\u0161inou v\u00e1zan\u00e1 na pou\u017e\u00edv\u00e1n\u00ed souborov\u00e9ho syst\u00e9mu (BTRFS, ZFS).<\/li>\n<\/ul>\n<p>Tak\u017ee pro mal\u00fd server je t\u0159eba zajistit sch\u00e9ma z\u00e1lohov\u00e1n\u00ed, kter\u00e9 spl\u0148uje n\u00e1sleduj\u00edc\u00ed po\u017eadavky:<\/p>\n<ul>\n<li>Jednoduch\u00e9 na pou\u017e\u00edv\u00e1n\u00ed \u2014 nevy\u017eaduje \u017e\u00e1dn\u00e9 speci\u00e1ln\u00ed dodate\u010dn\u00e9 \u00fakony, minim\u00e1ln\u00ed \u010dinnosti p\u0159i vytv\u00e1\u0159en\u00ed a obnov\u011b kopi\u00ed.<\/li>\n<li>Univerz\u00e1ln\u00ed \u2014 funguje jak na velk\u00fdch, tak na mal\u00fdch serverech; to je d\u016fle\u017eit\u00e9 p\u0159i zvy\u0161ov\u00e1n\u00ed po\u010dtu <a class=\"wpil_keyword_link\" href=\"https:\/\/prohoster.info\/cs\/server\/\"   title=\"servery\" data-wpil-keyword-link=\"linked\"  data-wpil-monitor-id=\"1319\">servery<\/a> nebo \u0161k\u00e1lov\u00e1n\u00ed.<\/li>\n<li>Instaluje se pomoc\u00ed bal\u00ed\u010dkov\u00e9ho mana\u017eeru nebo v jednom a\u017e dvou p\u0159\u00edkazech typu \u201est\u00e1hnout a rozbalit\u201c.<\/li>\n<li>Stabiln\u00ed - pou\u017e\u00edv\u00e1 standardn\u00ed nebo ji\u017e dlouho zaveden\u00fd form\u00e1t ukl\u00e1d\u00e1n\u00ed.<\/li>\n<li>Rychl\u00e1 v pr\u00e1ci.<\/li>\n<\/ul>\n<p>\nKandid\u00e1ti, kte\u0159\u00ed v\u00edce \u010di m\u00e9n\u011b spl\u0148uj\u00ed po\u017eadavky:<\/p>\n<ul>\n<li>rdiff-backup<\/li>\n<li>rsnapshot<\/li>\n<li>burp<\/li>\n<li>duplicati<\/li>\n<li>duplicity<\/li>\n<li>deja dup<\/li>\n<li>dar<\/li>\n<li>zbackup<\/li>\n<li>restic<\/li>\n<li>borgbackup<\/li>\n<\/ul>\n<p>\n<img decoding=\"async\" alt=\"Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed\" src=\"\/wp-content\/uploads\/2019\/04\/bc9e31c37656c1b6998f08939763a563.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nJako testovac\u00ed stanice bude pou\u017eita virtu\u00e1ln\u00ed stroj (na b\u00e1zi XenServer) s n\u00e1sleduj\u00edc\u00edmi parametry:<\/p>\n<ul>\n<li>4 j\u00e1dra 2,5 GHz,<\/li>\n<li>16 GB opera\u010dn\u00ed pam\u011bti,<\/li>\n<li>50 GB hybridn\u00ed \u00falo\u017ei\u0161t\u011b (\u00falo\u017ei\u0161t\u011b s ke\u0161ov\u00e1n\u00edm na SSD o 20 % velikosti virtu\u00e1ln\u00edho disku) ve form\u011b samostatn\u00e9ho virtu\u00e1ln\u00edho disku bez odd\u011blen\u00ed,<\/li>\n<li>200 Mbit\/s kan\u00e1l do Internetu.<\/li>\n<\/ul>\n<p>\nJako server pro p\u0159\u00edjem z\u00e1loh bude pou\u017eita prakticky stejn\u00e1 ma\u0161ina, pouze s pevn\u00fdm diskem o velikosti 500 GB.<\/p>\n<p>Opera\u010dn\u00ed syst\u00e9m \u2014 Centos 7 x64: rozd\u011blen\u00ed standardn\u00ed, dal\u0161\u00ed \u010d\u00e1st bude pou\u017eita jako zdroj dat.<\/p>\n<p>Jako vstupn\u00ed data vezmeme web na wordpressu s m\u00e9dii o velikosti 40 GB a datab\u00e1z\u00ed na mysql. Vzhledem k tomu, <a class=\"wpil_keyword_link\" href=\"https:\/\/prohoster.info\/cs\/vps\/\"   title=\"virtu\u00e1ln\u00ed servery\" data-wpil-keyword-link=\"linked\"  data-wpil-monitor-id=\"1262\">virtu\u00e1ln\u00ed servery<\/a> v\u00fdrazn\u011b se li\u0161\u00ed podle charakteristik, a tak\u00e9 pro lep\u0161\u00ed reprodukovatelnost, zde jsou <\/p>\n<p><b class=\"spoiler_title\">v\u00fdsledky testov\u00e1n\u00ed serveru pomoc\u00ed sysbench.<\/b>sysbench \u2014threads=4 \u2014time=30 \u2014cpu-max-prime=20000 cpu run<br \/>\nsysbench 1.1.0-18a9f86 (pou\u017e\u00edv\u00e1 zabudovan\u00fd LuaJIT 2.1.0-beta3)<br \/>\nProv\u00e1d\u00ed test s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nPo\u010det vl\u00e1ken: 4<br \/>\nInicializace gener\u00e1toru n\u00e1hodn\u00fdch \u010d\u00edsel z aktu\u00e1ln\u00edho \u010dasu<\/p>\n<p>Limit prvo\u010d\u00edsel: 20000<\/p>\n<p>Inicializace pracovn\u00edch vl\u00e1ken\u2026<\/p>\n<p>Vl\u00e1ken za\u010dalo!<\/p>\n<p>Rychlost CPU:<br \/>\nud\u00e1lost\u00ed za sekundu: 836,69<\/p>\n<p>Pr\u016fchodnost:<br \/>\nud\u00e1lost\u00ed\/s (eps): 836,6908<br \/>\nuplynul\u00fd \u010das: 30,0039s<br \/>\ncelkov\u00fd po\u010det ud\u00e1lost\u00ed: 25104<\/p>\n<p>Latence (ms):<br \/>\nmin: 2,38<br \/>\navg: 4,78<br \/>\nmax: 22,39<br \/>\n95. percentil: 10,46<br \/>\nsou\u010det: 119923,64<\/p>\n<p>Spravedlnost vl\u00e1ken:<br \/>\nud\u00e1losti (avg\/stddev): 6276,0000\/13,91<br \/>\ndoba vykon\u00e1v\u00e1n\u00ed (avg\/stddev): 29,9809\/0,01<\/p>\n<p>sysbench \u2014threads=4 \u2014time=30 \u2014memory-block-size=1K \u2014memory-scope=global \u2014memory-total-size=100G \u2014memory-oper=read memory run<br \/>\nsysbench 1.1.0-18a9f86 (pou\u017e\u00edv\u00e1 zabudovan\u00fd LuaJIT 2.1.0-beta3)<br \/>\nProv\u00e1d\u00ed test s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nPo\u010det vl\u00e1ken: 4<br \/>\nInicializace gener\u00e1toru n\u00e1hodn\u00fdch \u010d\u00edsel z aktu\u00e1ln\u00edho \u010dasu<\/p>\n<p>Prov\u00e1d\u011bn\u00ed testu rychlosti pam\u011bti s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nvelikost bloku: 1KiB<br \/>\ncelkov\u00e1 velikost: 102400MiB<br \/>\noperace: \u010dten\u00ed<br \/>\nrozsah: glob\u00e1ln\u00ed<\/p>\n<p>Inicializace pracovn\u00edch vl\u00e1ken\u2026<\/p>\n<p>Vl\u00e1ken za\u010dalo!<\/p>\n<p>Celkov\u00fd po\u010det operac\u00ed: 50900446 (1696677,10 za sekundu)<\/p>\n<p>49707,47 MiB p\u0159eneseno (1656,91 MiB\/s)<\/p>\n<p>Pr\u016fchodnost:<br \/>\nud\u00e1lost\u00ed\/s (eps): 1696677,1017<br \/>\nuplynul\u00fd \u010das: 30,0001s<br \/>\ncelkov\u00fd po\u010det ud\u00e1lost\u00ed: 50900446<\/p>\n<p>Latence (ms):<br \/>\nmin: 0,00<br \/>\navg: 0,00<br \/>\nmax: 24,01<br \/>\n95. percentil: 0,00<br \/>\nsou\u010det: 39106,74<\/p>\n<p>Spravedlnost vl\u00e1ken:<br \/>\nud\u00e1losti (avg\/stddev): 12725111,5000\/137775,15<br \/>\ndoba vykon\u00e1v\u00e1n\u00ed (avg\/stddev): 9,7767\/0,10<\/p>\n<p>sysbench \u2014threads=4 \u2014time=30 \u2014memory-block-size=1K \u2014memory-scope=global \u2014memory-total-size=100G \u2014memory-oper=write memory run<br \/>\nsysbench 1.1.0-18a9f86 (pou\u017e\u00edv\u00e1 zabudovan\u00fd LuaJIT 2.1.0-beta3)<br \/>\nProv\u00e1d\u00ed test s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nPo\u010det vl\u00e1ken: 4<br \/>\nInicializace gener\u00e1toru n\u00e1hodn\u00fdch \u010d\u00edsel z aktu\u00e1ln\u00edho \u010dasu<\/p>\n<p>Prov\u00e1d\u011bn\u00ed testu rychlosti pam\u011bti s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nvelikost bloku: 1KiB<br \/>\ncelkov\u00e1 velikost: 102400MiB<br \/>\noperace: z\u00e1pis<br \/>\nrozsah: glob\u00e1ln\u00ed<\/p>\n<p>Inicializace pracovn\u00edch vl\u00e1ken\u2026<\/p>\n<p>Vl\u00e1ken za\u010dalo!<\/p>\n<p>Celkov\u00fd po\u010det operac\u00ed: 35910413 (1197008,62 za sekundu)<\/p>\n<p>35068,76 MiB p\u0159eneseno (1168,95 MiB\/s)<\/p>\n<p>Pr\u016fchodnost:<br \/>\nud\u00e1lost\u00ed\/s (eps): 1197008,6179<br \/>\nuplynul\u00fd \u010das: 30,0001s<br \/>\ncelkov\u00fd po\u010det ud\u00e1lost\u00ed: 35910413<\/p>\n<p>Latence (ms):<br \/>\nmin: 0,00<br \/>\navg: 0,00<br \/>\nmax: 16,90<br \/>\n95. percentil: 0,00<br \/>\nsou\u010det: 43604,83<\/p>\n<p>Spravedlnost vl\u00e1ken:<br \/>\nud\u00e1losti (avg\/stddev): 8977603,2500\/233905,84<br \/>\ndoba vykon\u00e1v\u00e1n\u00ed (avg\/stddev): 10,9012\/0,41<\/p>\n<p>sysbench \u2014threads=4 \u2014file-test-mode=rndrw \u2014time=60 \u2014file-block-size=4K \u2014file-total-size=1G fileio run<br \/>\nsysbench 1.1.0-18a9f86 (pou\u017e\u00edv\u00e1 zabudovan\u00fd LuaJIT 2.1.0-beta3)<br \/>\nProv\u00e1d\u00ed test s n\u00e1sleduj\u00edc\u00edmi mo\u017enostmi:<br \/>\nPo\u010det vl\u00e1ken: 4<br \/>\nInicializace gener\u00e1toru n\u00e1hodn\u00fdch \u010d\u00edsel z aktu\u00e1ln\u00edho \u010dasu<\/p>\n<p>Dodate\u010dn\u00e9 p\u0159\u00edznaky pro otev\u0159en\u00ed souboru: (\u017e\u00e1dn\u00e9)<br \/>\n128 soubor\u016f, 8 MiB ka\u017ed\u00fd<br \/>\nCelkov\u00e1 velikost souboru 1 GiB<br \/>\nVelikost bloku 4 KiB<br \/>\nPo\u010det IO po\u017eadavk\u016f: 0<br \/>\nPom\u011br \u010dten\u00ed\/z\u00e1pisu pro kombinovan\u00fd test n\u00e1hodn\u00e9ho IO: 1,50<br \/>\nPeriodick\u00e9 FSYNC povoleno, vol\u00e1n\u00ed fsync() ka\u017ed\u00fdch 100 po\u017eadavk\u016f.<br \/>\nVol\u00e1n\u00ed fsync() na konci testu, povoleno.<br \/>\nPou\u017e\u00edv\u00e1n\u00ed synchronn\u00edho I\/O m\u00f3du<br \/>\nProv\u00e1d\u011bn\u00ed n\u00e1hodn\u00e9ho testu r\/w<br \/>\nInicializace pracovn\u00edch vl\u00e1ken\u2026<\/p>\n<p>Vl\u00e1ken za\u010dalo!<\/p>\n<p>Pr\u016fchodnost:<br \/>\n\u010dten\u00ed: IOPS=3868,21 15,11 MiB\/s (15,84 MB\/s)<br \/>\nz\u00e1pis: IOPS=2578,83 10,07 MiB\/s (10,56 MB\/s)<br \/>\nfsync: IOPS=8226.98<\/p>\n<p>Latence (ms):<br \/>\nmin: 0,00<br \/>\navg: 0.27<br \/>\nmax: 18.01<br \/>\n95. percentil: 1.08<br \/>\nsum: 238469.45<\/p>\n<p>Tento \u010dl\u00e1nek zahajuje rozs\u00e1hl\u00fd <\/p>\n<p><b class=\"spoiler_title\">cyklus \u010dl\u00e1nk\u016f o z\u00e1lohov\u00e1n\u00ed<\/b><\/p>\n<ol>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: Pro\u010d je z\u00e1lohov\u00e1n\u00ed d\u016fle\u017eit\u00e9, p\u0159ehled metod, technologi\u00ed<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 2: P\u0159ehled a testov\u00e1n\u00ed n\u00e1stroj\u016f pro z\u00e1lohov\u00e1n\u00ed zalo\u017een\u00fdch na rsync<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 3: P\u0159ehled a testov\u00e1n\u00ed duplicity, duplicaty, deja dup<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 4: P\u0159ehled a testov\u00e1n\u00ed zbackup, restic, borgbackup<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 5: Testov\u00e1n\u00ed Bacula a Veeam Backup pro Linux<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 6: Srovn\u00e1n\u00ed n\u00e1stroj\u016f pro z\u00e1lohov\u00e1n\u00ed<\/li>\n<li> Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 7: Z\u00e1v\u011bry<\/li>\n<\/ol>\n<p>Zdroj: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/southbridge\/blog\/449282\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e \u0434\u0435\u043b\u0430\u0442\u044c \u0440\u0435\u0437\u0435\u0440\u0432\u043d\u044b\u0435 \u043a\u043e\u043f\u0438\u0438? \u0412\u0435\u0434\u044c \u043e\u0431\u043e\u0440\u0443\u0434\u043e\u0432\u0430\u043d\u0438\u0435 \u0432\u0435\u0441\u044c\u043c\u0430 \u0438 \u0432\u0435\u0441\u044c\u043c\u0430 \u043d\u0430\u0434\u0435\u0436\u043d\u043e\u0435, \u043a \u0442\u043e\u043c\u0443 \u0436\u0435 \u0435\u0441\u0442\u044c \u00ab\u043e\u0431\u043b\u0430\u043a\u0430\u00bb, \u043a\u043e\u0442\u043e\u0440\u044b\u0435 \u043f\u043e \u043d\u0430\u0434\u0435\u0436\u043d\u043e\u0441\u0442\u0438 \u043b\u0443\u0447\u0448\u0435 \u0444\u0438\u0437\u0438\u0447\u0435\u0441\u043a\u0438\u0445 \u0441\u0435\u0440\u0432\u0435\u0440\u043e\u0432: \u043f\u0440\u0438 \u043f\u0440\u0430\u0432\u0438\u043b\u044c\u043d\u043e\u0439 \u043d\u0430\u0441\u0442\u0440\u043e\u0439\u043a\u0435 \u00ab\u043e\u0431\u043b\u0430\u0447\u043d\u044b\u0439\u00bb \u0441\u0435\u0440\u0432\u0435\u0440 \u0437\u0430\u043f\u0440\u043e\u0441\u0442\u043e \u043f\u0435\u0440\u0435\u0436\u0438\u0432\u0435\u0442 \u043e\u0442\u043a\u0430\u0437 \u0438\u043d\u0444\u0440\u0430\u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u043d\u043e\u0433\u043e \u0444\u0438\u0437\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0441\u0435\u0440\u0432\u0435\u0440\u0430, \u0430 \u0441 \u0442\u043e\u0447\u043a\u0438 \u0437\u0440\u0435\u043d\u0438\u044f \u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u0442\u0435\u043b\u0435\u0439 \u0441\u0435\u0440\u0432\u0438\u0441\u043e\u0432, \u0431\u0443\u0434\u0435\u0442 \u043d\u0435\u0431\u043e\u043b\u044c\u0448\u043e\u0439, \u0435\u043b\u0435 \u0437\u0430\u043c\u0435\u0442\u043d\u044b\u0439 \u0441\u043a\u0430\u0447\u043e\u043a \u0432\u0440\u0435\u043c\u0435\u043d\u0438 \u043e\u0431\u0441\u043b\u0443\u0436\u0438\u0432\u0430\u043d\u0438\u044f. \u041a \u0442\u043e\u043c\u0443 \u0436\u0435 \u0434\u0443\u0431\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u0438 \u0437\u0430\u0447\u0430\u0441\u0442\u0443\u044e \u0442\u0440\u0435\u0431\u0443\u0435\u0442 \u043e\u043f\u043b\u0430\u0442\u0438\u0442\u044c [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":24281,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-32477","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.3 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.3\" \/>\n\t\t<meta property=\"og:locale\" content=\"cs_CZ\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u0420\u0435\u0437\u0435\u0440\u0432\u043d\u043e\u0435 \u043a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435, \u0447\u0430\u0441\u0442\u044c 1: \u041d\u0430\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435, \u043e\u0431\u0437\u043e\u0440 \u043c\u0435\u0442\u043e\u0434\u043e\u0432 \u0438 \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0439 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-10-31T18:47:17+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:47:17+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Z\u00e1lohov\u00e1n\u00ed, \u010d\u00e1st 1: \u00da\u010del, p\u0159ehled metod a technologi\u00ed | ProHoster","description":"Pro\u010d je to pot\u0159eba.","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"cs_CZ","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u0420\u0435\u0437\u0435\u0440\u0432\u043d\u043e\u0435 \u043a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435, \u0447\u0430\u0441\u0442\u044c 1: \u041d\u0430\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435, \u043e\u0431\u0437\u043e\u0440 \u043c\u0435\u0442\u043e\u0434\u043e\u0432 \u0438 \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0439 | ProHoster","og:description":"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.","og:url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-10-31T18:47:17+00:00","article:modified_time":"2019-10-31T18:47:17+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"32477","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-02-09 17:02:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 15:35:23","updated":"2026-02-09 17:02:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/32477","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/comments?post=32477"}],"version-history":[{"count":2,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/32477\/revisions"}],"predecessor-version":[{"id":158563,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/32477\/revisions\/158563"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/24281"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=32477"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=32477"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=32477"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}