{"id":35800,"date":"2019-10-31T22:06:24","date_gmt":"2019-10-31T19:06:24","guid":{"rendered":"https:\/\/prohoster.info\/blog\/dizajn-virtualizovannogo-tsod\/"},"modified":"2019-10-31T22:06:24","modified_gmt":"2019-10-31T19:06:24","slug":"dizajn-virtualizovannogo-tsod","status":"publish","type":"post","link":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/dizajn-virtualizovannogo-tsod","title":{"rendered":"Design virtualizovan\u00e9ho datov\u00e9ho centra","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"Design
\n
\n\u00davod<\/b><\/p>\n

Informa\u010dn\u00ed syst\u00e9m je z pohledu u\u017eivatele dob\u0159e definov\u00e1n ve zn\u011bn\u00ed \u010cSN 51987 \u2013 \u201eautomatizovan\u00fd syst\u00e9m, jeho\u017e v\u00fdstupem je prezentace v\u00fdstupn\u00edch informac\u00ed pro n\u00e1sledn\u00e9 pou\u017eit\u00ed\u201c. Pokud se d\u00edv\u00e1me na vnit\u0159n\u00ed strukturu, ka\u017ed\u00e1 informa\u010dn\u00ed syst\u00e9m ve sv\u00e9 podstat\u011b p\u0159edstavuje syst\u00e9m vz\u00e1jemn\u011b propojen\u00fdch algoritm\u016f, realizovan\u00fdch v k\u00f3du. V \u0161ir\u0161\u00edm pojet\u00ed Turingovy-Churchovy teze algoritmus (a tud\u00ed\u017e i IS) prov\u00e1d\u00ed transformaci mno\u017estv\u00ed vstupn\u00edch dat na mno\u017estv\u00ed v\u00fdstupn\u00edch dat.
\nLze dokonce \u0159\u00edci, \u017ee v transformaci vstupn\u00edch dat spo\u010d\u00edv\u00e1 smysl existence informa\u010dn\u00edho syst\u00e9mu. Odpov\u00eddaj\u00edc\u00edm zp\u016fsobem hodnota IS a cel\u00e9ho komplexu IS se ur\u010duje prost\u0159ednictv\u00edm hodnoty vstupn\u00edch a v\u00fdstupn\u00edch dat.
\nNa z\u00e1klad\u011b toho by n\u00e1vrh m\u011bl za\u010d\u00ednat a br\u00e1t v \u00favahu data, p\u0159izp\u016fsobuj\u00edc\u00ed architekturu a metody struktu\u0159e a v\u00fdznamu dat.<\/p>\n

Ulo\u017een\u00e1 data<\/b>
\nKl\u00ed\u010dov\u00fdm krokem p\u0159i p\u0159\u00edprav\u011b na n\u00e1vrh je z\u00edsk\u00e1n\u00ed charakteristik v\u0161ech sad dat, kter\u00e9 se pl\u00e1nuj\u00ed zpracov\u00e1vat a uchov\u00e1vat. Tyto charakteristiky zahrnuj\u00ed:
\n \u2014 Objem dat;
\n \u2014 Informace o \u017eivotn\u00edm cyklu dat (n\u00e1r\u016fst nov\u00fdch dat, d\u00e9lka \u017eivota, zpracov\u00e1n\u00ed zastaral\u00fdch dat);
\n \u2014 Klasifikace dat z pohledu vlivu na hlavn\u00ed byznys spole\u010dnosti (t\u0159i aspekty d\u016fv\u011brnosti, integrity, dostupnosti) spolu s finan\u010dn\u00edmi ukazateli (nap\u0159. n\u00e1klady na ztr\u00e1tu dat za posledn\u00ed hodinu);
\n \u2014 Geografie zpracov\u00e1n\u00ed dat (fyzick\u00e9 um\u00edst\u011bn\u00ed syst\u00e9m\u016f zpracov\u00e1n\u00ed);
\n \u2014 Po\u017eadavky regul\u00e1tor\u016f na ka\u017edou t\u0159\u00eddu dat (nap\u0159. z\u00e1kon \u010d. 152, PCI DSS).<\/p>\n

<\/a><\/noindex><\/p>\n

Informa\u010dn\u00ed syst\u00e9my<\/b><\/p>\n

Data jsou nejen uchov\u00e1v\u00e1na, ale tak\u00e9 zpracov\u00e1v\u00e1na (transformov\u00e1na) informa\u010dn\u00edmi syst\u00e9my. Dal\u0161\u00edm krokem po z\u00edsk\u00e1n\u00ed charakteristik dat je co mo\u017en\u00e1 nej\u00fapln\u011bj\u0161\u00ed inventarizace informa\u010dn\u00edho syst\u00e9mu, jeho architektonick\u00fdch zvl\u00e1\u0161tnost\u00ed, vz\u00e1jemn\u00fdch z\u00e1vislost\u00ed a po\u017eadavk\u016f na infrastrukturu v podm\u00ednkov\u00fdch jednotk\u00e1ch pro \u010dty\u0159i druhy zdroj\u016f:
\n \u2014 Procesorov\u00fd v\u00fdpo\u010detn\u00ed v\u00fdkon;
\n \u2014 Objem opera\u010dn\u00ed pam\u011bti;
\n \u2014 Po\u017eadavky na objem a v\u00fdkon syst\u00e9mu pro ukl\u00e1d\u00e1n\u00ed dat;
\n \u2014 Po\u017eadavky na s\u00ed\u0165 pro p\u0159enos dat (extern\u00ed kan\u00e1ly, kan\u00e1ly mezi komponenty IS).
\nPo\u017eadavky mus\u00ed b\u00fdt uvedeny pro ka\u017edou slu\u017ebu\/mikroslu\u017ebu v r\u00e1mci IS.
\nJe t\u0159eba zm\u00ednit, \u017ee pro spr\u00e1vn\u00e9 navrhov\u00e1n\u00ed je nezbytn\u00e9 m\u00edt \u00fadaje o vlivu IS na hlavn\u00ed podnik\u00e1n\u00ed spole\u010dnosti ve form\u011b n\u00e1klad\u016f na v\u00fdpadek IS (korun za hodinu).<\/p>\n

Model hrozeb<\/b><\/p>\n

Jako povinnost mus\u00ed existovat form\u00e1ln\u00ed model hrozeb, proti kter\u00fdm se pl\u00e1nuje ochrana dat\/slu\u017eeb. Model hrozeb zahrnuje nejen aspekty d\u016fv\u011brnosti, ale tak\u00e9 integrity a dostupnosti. Tedy nap\u0159\u00edklad:
\n \u2014 V\u00fdpadek fyzick\u00e9ho serveru;
\n \u2014 V\u00fdpadek switchi top-of-the-rack;
\n \u2014 P\u0159eru\u0161en\u00ed optick\u00e9ho spojen\u00ed mezi datov\u00fdmi centry;
\n \u2014 V\u00fdpadek opera\u010dn\u00edho \u00falo\u017ei\u0161t\u011b celkov\u011b.
\nV n\u011bkter\u00fdch p\u0159\u00edpadech jsou modely hrozeb vytv\u00e1\u0159eny nejen pro infrastrukturn\u00ed komponenty, ale i pro konkr\u00e9tn\u00ed IS nebo jejich komponenty, nap\u0159\u00edklad selh\u00e1n\u00ed DBMS s logick\u00fdm naru\u0161en\u00edm struktury dat.
\nV\u0161echna rozhodnut\u00ed v r\u00e1mci projektu o ochran\u011b proti nepopisovan\u00e9 hrozb\u011b jsou nadbyte\u010dn\u00e1.<\/p>\n

Po\u017eadavky regul\u00e1tor\u016f<\/b><\/p>\n

Pokud se zpracov\u00e1van\u00e1 data \u0159\u00edd\u00ed zvl\u00e1\u0161tn\u00edmi pravidly stanoven\u00fdmi regul\u00e1tory, je nezbytn\u011b nutn\u00e9 m\u00edt informace o souborech dat a pravidlech zpracov\u00e1n\u00ed\/uchov\u00e1v\u00e1n\u00ed.<\/p>\n

C\u00edlov\u00e9 ukazatele RPO\/RTO<\/b><\/p>\n

Navrhov\u00e1n\u00ed jak\u00e9hokoli typu ochrany vy\u017eaduje existenci ukazatel\u016f c\u00edlov\u00e9 ztr\u00e1ty dat a c\u00edlov\u00e9ho \u010dasu na obnoven\u00ed slu\u017eby pro ka\u017edou z popsan\u00fdch hrozeb.
\nIde\u00e1ln\u011b by RPO a RTO m\u011bly m\u00edt asociovan\u00e9 n\u00e1klady na ztr\u00e1tu dat a v\u00fdpadek v jednotce \u010dasu.<\/p>\n

\"Design
\n
\nRozd\u011blen\u00ed na pooly zdroj\u016f<\/b><\/p>\n

Po shrom\u00e1\u017ed\u011bn\u00ed v\u0161ech po\u010d\u00e1te\u010dn\u00edch informac\u00ed je prvn\u00edm krokem seskupen\u00ed soubor\u016f dat a IS do pool\u016f na z\u00e1klad\u011b model\u016f hrozeb a po\u017eadavk\u016f regul\u00e1tor\u016f. Je ur\u010dena forma rozd\u011blen\u00ed r\u016fzn\u00fdch pool\u016f \u2013 programov\u011b na \u00farovni syst\u00e9mov\u00e9ho softwaru nebo fyzicky.
\nP\u0159\u00edklady:
\n \u2014 Okruh zpracov\u00e1vaj\u00edc\u00ed osobn\u00ed \u00fadaje je fyzicky odd\u011blen od ostatn\u00edch syst\u00e9m\u016f;
\n \u2014 Z\u00e1lo\u017en\u00ed kopie jsou uchov\u00e1v\u00e1ny na samostatn\u00e9m \u00falo\u017ei\u0161ti.<\/p>\n

P\u0159itom pooly mohou m\u00edt \u010d\u00e1ste\u010dnou nez\u00e1vislost, nap\u0159\u00edklad se ur\u010duj\u00ed dva pooly v\u00fdpo\u010detn\u00edch zdroj\u016f (v\u00fdpo\u010detn\u00ed v\u00fdkon + opera\u010dn\u00ed pam\u011b\u0165), kter\u00e9 vyu\u017e\u00edvaj\u00ed jednotn\u00fd pool \u00falo\u017ei\u0161t\u011b dat a jednotn\u00fd pool p\u0159enosov\u00fdch zdroj\u016f.<\/p>\n

V\u00fdpo\u010detn\u00ed v\u00fdkon<\/b><\/p>\n

\"Design
\n
\nAbstraktn\u00ed pot\u0159eby na procesorov\u00fd v\u00fdkon virtualizovan\u00e9ho datov\u00e9ho centra se m\u011b\u0159\u00ed po\u010dtem virtu\u00e1ln\u00edch procesor\u016f (vCPU) a koeficientem jejich konsolidace na fyzick\u00fdch procesorech (pCPU). V tomto konkr\u00e9tn\u00edm p\u0159\u00edpad\u011b 1 pCPU = 1 fyzick\u00e9 j\u00e1dro procesoru (bez zohledn\u011bn\u00ed Hyper-Threading). Po\u010det vCPU se s\u010d\u00edt\u00e1 ve v\u0161ech definovan\u00fdch zdrojov\u00fdch clusterech (z nich\u017e ka\u017ed\u00fd m\u016f\u017ee m\u00edt sv\u016fj koeficient konsolidace).
\nKoeficient konsolidace pro zat\u00ed\u017een\u00e9 syst\u00e9my se z\u00edsk\u00e1v\u00e1 empiricky, vych\u00e1zej\u00edc z ji\u017e existuj\u00edc\u00ed infrastruktury, nebo p\u0159i pilotn\u00ed instalaci a z\u00e1t\u011b\u017eov\u00e9m testov\u00e1n\u00ed. Pro nezat\u00ed\u017een\u00e9 syst\u00e9my se pou\u017e\u00edvaj\u00ed \u201ebest practice\u201c. Konkr\u00e9tn\u011b VMware uv\u00e1d\u00ed pr\u016fm\u011brn\u00fd koeficient 8:1.<\/p>\n

Opera\u010dn\u00ed pam\u011b\u0165<\/b><\/p>\n

Celkov\u00e1 pot\u0159eba opera\u010dn\u00ed pam\u011bti se z\u00edsk\u00e1 prost\u00fdm s\u010d\u00edt\u00e1n\u00edm. Pou\u017eit\u00ed oversubscription u opera\u010dn\u00ed pam\u011bti se nedoporu\u010duje.<\/p>\n

\u00dalo\u017en\u00e9 zdroje<\/b><\/p>\n

Po\u017eadavky na \u00falo\u017en\u00e9 zdroje se z\u00edsk\u00e1vaj\u00ed prost\u00fdm s\u010d\u00edt\u00e1n\u00edm v\u0161ech zdrojov\u00fdch clusterech podle objemu a v\u00fdkonu.
\nPo\u017eadavky na v\u00fdkon se vyjad\u0159uj\u00ed v IOPS v kombinaci s pr\u016fm\u011brn\u00fdm pom\u011brem \u010dten\u00ed\/z\u00e1pis a p\u0159i pot\u0159eb\u011b maxim\u00e1ln\u00ed latenc\u00ed odezvy.
\nSamostatn\u011b by m\u011bly b\u00fdt uvedeny po\u017eadavky na zaji\u0161t\u011bn\u00ed kvality slu\u017eby (QoS) pro konkr\u00e9tn\u00ed zdroje nebo syst\u00e9my.<\/p>\n

Zdroje s\u00edt\u011b pro p\u0159enos dat<\/b><\/p>\n

Po\u017eadavky na s\u00ed\u0165 pro p\u0159enos dat se z\u00edsk\u00e1vaj\u00ed prost\u00fdm s\u010d\u00edt\u00e1n\u00edm v\u0161ech zdrojov\u00fdch clusterech \u0161\u00ed\u0159ky p\u00e1sma.
\nSamostatn\u011b by m\u011bly b\u00fdt uvedeny po\u017eadavky na zaji\u0161t\u011bn\u00ed kvality slu\u017eby (QoS) a latence (RTT) pro konkr\u00e9tn\u00ed zdroje nebo syst\u00e9my.
\nV r\u00e1mci po\u017eadavk\u016f na zdroje s\u00edt\u011b pro p\u0159enos dat se tak\u00e9 uv\u00e1d\u011bj\u00ed po\u017eadavky na izolaci a\/nebo \u0161ifrov\u00e1n\u00ed s\u00ed\u0165ov\u00e9ho provozu a preferovan\u00e9 mechanismy (802.1q, IPSec atd.)<\/p>\n

V\u00fdb\u011br architektury<\/b><\/p>\n

V r\u00e1mci t\u00e9to p\u0159\u00edru\u010dky se nezva\u017euje jin\u00fd v\u00fdb\u011br ne\u017e architektura x86 a 100% virtualizace server\u016f. Proto se v\u00fdb\u011br architektury v\u00fdpo\u010detn\u00edho subsyst\u00e9mu omezuje na v\u00fdb\u011br platformy serverov\u00e9 virtualizace, form\u00e1tu server\u016f a obecn\u00fdch po\u017eadavk\u016f na konfiguraci server\u016f.<\/p>\n

Kl\u00ed\u010dov\u00fdm bodem volby je vyjasn\u011bn\u00ed pou\u017eit\u00ed klasick\u00e9ho p\u0159\u00edstupu s rozd\u011blen\u00edm funkc\u00ed zpracov\u00e1n\u00ed, ukl\u00e1d\u00e1n\u00ed a p\u0159enosu dat nebo konvergovan\u00e9ho.<\/p>\n

Klasick\u00e1 architektura<\/i> p\u0159edstavuje vyu\u017eit\u00ed inteligentn\u00edch extern\u00edch syst\u00e9m\u016f ukl\u00e1d\u00e1n\u00ed a p\u0159enosu dat, zat\u00edmco servery p\u0159in\u00e1\u0161ej\u00ed do spole\u010dn\u00e9ho fondu fyzick\u00fdch zdroj\u016f pouze procesorov\u00fd v\u00fdkon a opera\u010dn\u00ed pam\u011b\u0165. V krajn\u00edm p\u0159\u00edpad\u011b se servery st\u00e1vaj\u00ed zcela anonymn\u00edmi, nemaj\u00ed vlastn\u00ed disky ani syst\u00e9mov\u00fd identifik\u00e1tor. V tomto p\u0159\u00edpad\u011b se pou\u017e\u00edv\u00e1 spu\u0161t\u011bn\u00ed opera\u010dn\u00edho syst\u00e9mu nebo hypervizora z intern\u00edho flash \u00falo\u017ei\u0161t\u011b nebo extern\u00edho syst\u00e9mu ukl\u00e1d\u00e1n\u00ed dat (boot from SAN).
\nV r\u00e1mci klasick\u00e9 architektury se v\u00fdb\u011br mezi blade a rackov\u00fdmi servery prov\u00e1d\u00ed p\u0159edev\u0161\u00edm podle n\u00e1sleduj\u00edc\u00edch princip\u016f:
\n \u2014 Ekonomick\u00e1 efektivita (pr\u016fm\u011brn\u011b jsou rackov\u00e9 servery levn\u011bj\u0161\u00ed);
\n \u2014 V\u00fdpo\u010detn\u00ed hustota (u blade je vy\u0161\u0161\u00ed);
\n \u2014 Energetick\u00e1 spot\u0159eba a tepeln\u00fd v\u00fdkon (u blade je vy\u0161\u0161\u00ed specifick\u00e1 na jednotku);
\n \u2014 \u0160k\u00e1lovatelnost a spravovatelnost (blade obecn\u011b vy\u017eaduje m\u00e9n\u011b \u00fasil\u00ed p\u0159i v\u011bt\u0161\u00edch instalac\u00edch);
\n \u2014 Pou\u017eit\u00ed roz\u0161i\u0159uj\u00edc\u00edch karet (pro blade je velmi omezen\u00fd v\u00fdb\u011br).
\nKonvergentn\u00ed architektura<\/i> (tak\u00e9 zn\u00e1m\u00e1 jako hyperkonvergentn\u00ed<\/i>) p\u0159edpokl\u00e1d\u00e1 kombinaci funkc\u00ed zpracov\u00e1n\u00ed a ukl\u00e1d\u00e1n\u00ed dat, co\u017e vede k vyu\u017eit\u00ed m\u00edstn\u00edch disk\u016f server\u016f a n\u00e1sledn\u011b k opu\u0161t\u011bn\u00ed form\u00e1tu klasick\u00fdch blade. Pro konvergentn\u00ed syst\u00e9my se pou\u017e\u00edvaj\u00ed bu\u010f rackov\u00e9 servery, nebo clusterov\u00e9 syst\u00e9my spojuj\u00edc\u00ed v jednom pouzdru n\u011bkolik blade server\u016f a m\u00edstn\u00ed disky.<\/p>\n

CPU \/ Pam\u011b\u0165 <\/b><\/p>\n

Pro spr\u00e1vn\u00fd v\u00fdpo\u010det konfigurace je t\u0159eba pochopit typ z\u00e1t\u011b\u017ee pro prost\u0159ed\u00ed nebo ka\u017ed\u00fd z nez\u00e1visl\u00fdch cluster\u016f.
\nCPU bound<\/i> \u2013 prost\u0159ed\u00ed omezen\u00e9 v\u00fdkonnost\u00ed procesorov\u00e9ho v\u00fdkonu. P\u0159id\u00e1n\u00ed opera\u010dn\u00ed pam\u011bti nic nezm\u011bn\u00ed z hlediska v\u00fdkonu (po\u010det VM na serveru).
\nMemory bound<\/i> \u2013 prost\u0159ed\u00ed omezen\u00e9 opera\u010dn\u00ed pam\u011bt\u00ed. V\u011bt\u0161\u00ed mno\u017estv\u00ed opera\u010dn\u00ed pam\u011bti na serveru umo\u017e\u0148uje spustit v\u00edce VM na serveru.
\nGB \/ MHz (GB \/ pCPU) \u2013 pr\u016fm\u011brn\u00fd pom\u011br spot\u0159eby t\u00e9to konkr\u00e9tn\u00ed z\u00e1t\u011b\u017e\u00ed opera\u010dn\u00ed pam\u011bti a procesorov\u00e9ho v\u00fdkonu. M\u016f\u017ee b\u00fdt pou\u017eito pro v\u00fdpo\u010dty pot\u0159ebn\u00e9ho objemu pam\u011bti p\u0159i dan\u00e9 v\u00fdkonnosti a naopak. <\/p>\n

V\u00fdpo\u010det konfigurace serveru<\/b><\/p>\n

\"Design
\n
\nNejprve je t\u0159eba ur\u010dit v\u0161echny typy z\u00e1t\u011b\u017ee a rozhodnout, zda slou\u010dit nebo odd\u011blit r\u016fzn\u00e9 v\u00fdpo\u010detn\u00ed pooly podle r\u016fzn\u00fdch cluster\u016f.
\nD\u00e1le se pro ka\u017ed\u00fd z definovan\u00fdch cluster\u016f ur\u010duje pom\u011br GB \/ MHz p\u0159i zn\u00e1m\u00e9 p\u0159edem z\u00e1t\u011b\u017ei. Pokud nen\u00ed z\u00e1t\u011b\u017e zn\u00e1ma p\u0159edem, ale m\u00e1me p\u0159ibli\u017enou p\u0159edstavu o \u00farovni zat\u00ed\u017een\u00ed procesorov\u00e9ho v\u00fdkonu, m\u016f\u017eeme pou\u017e\u00edt standardn\u00ed koeficienty vCPU:pCPU pro p\u0159evod po\u017eadavk\u016f pool\u016f na fyzick\u00e9. <\/p>\n

Pro ka\u017ed\u00fd cluster d\u011bl\u00edme sou\u010det po\u017eadavk\u016f pool\u016f vCPU koeficientem:
\nvCPU_sou\u010det \/ vCPU:pCPU = pCPU_sou\u010det \u2013 po\u017eadovan\u00fd po\u010det fyzick\u00fdch jader
\npCPU_sou\u010det \/ 1.25 = pCPU_ht \u2013 po\u010det jader s opravou na Hyper-Threading
\nP\u0159edpokl\u00e1dejme, \u017ee je t\u0159eba prov\u00e9st v\u00fdpo\u010det clustera na 190 jader \/ 3.5TB RAM. P\u0159itom bereme c\u00edlovou 50% z\u00e1t\u011b\u017e procesorov\u00e9ho v\u00fdkonu a 75% vyu\u017eit\u00ed opera\u010dn\u00ed pam\u011bti.<\/p>\n

pCPU<\/b>
\n190
\nCPU vyu\u017eit\u00ed<\/b>
\n50%<\/p>\n

RAM<\/b>
\n3500
\nUtilizace RAM<\/b>
\n75%<\/p>\n

Socle<\/b>
\nCore<\/b>
\nSrv \/ CPU<\/b>
\nSrv RAM<\/b>
\nSrv \/ RAM<\/b><\/p>\n

2
\n6
\n25,3
\n128
\n36,5<\/p>\n

2
\n8
\n19,0
\n192
\n24,3<\/p>\n

2
\n10
\n15,2
\n256
\n18,2<\/p>\n

2
\n14
\n10,9
\n384
\n12,2<\/p>\n

2
\n18
\n8,4
\n512
\n9,1<\/p>\n

V tomto p\u0159\u00edpad\u011b v\u017edy pou\u017e\u00edv\u00e1me zaokroulen\u00ed na nejbli\u017e\u0161\u00ed cel\u00e9 \u010d\u00edslo nahoru (=ROUNDUP(A1;0)).
\nZ tabulky je jasn\u00e9, \u017ee jako vyv\u00e1\u017een\u00e9 podle c\u00edlov\u00fdch ukazatel\u016f existuje n\u011bkolik konfigurac\u00ed server\u016f:
\n \u2014 26 server\u016f 2*6c \/ 192 GB
\n \u2014 19 server\u016f 2*10c \/ 256 GB
\n \u2014 10 server\u016f 2*18c \/ 512 GB <\/p>\n

Volba z t\u011bchto konfigurac\u00ed by se m\u011bla d\u00e1le \u0159\u00eddit podle dal\u0161\u00edch faktor\u016f, jako jsou nap\u0159\u00edklad tepeln\u00fd v\u00fdkon a dostupn\u00e9 chlazen\u00ed, ji\u017e pou\u017e\u00edvan\u00e9 servery nebo cena.<\/p>\n

Charakteristiky v\u00fdb\u011bru konfigurace serveru<\/b><\/p>\n

\u0160irok\u00e9 VM. P\u0159i pot\u0159eb\u011b um\u00edst\u011bn\u00ed \u0161irok\u00fdch VM (srovnateln\u00fdch s 1 uzlem NUMA a v\u00edce) se doporu\u010duje vyb\u00edrat server s konfigurac\u00ed, kter\u00e1 umo\u017en\u00ed, aby takov\u00e9 VM z\u016fstaly v r\u00e1mci NUMA uzlu. P\u0159i velk\u00e9m po\u010dtu \u0161irok\u00fdch VM vznik\u00e1 nebezpe\u010d\u00ed fragmentace prost\u0159edk\u016f clusteru, a v tomto p\u0159\u00edpad\u011b se vyb\u00edraj\u00ed servery, kter\u00e9 umo\u017e\u0148uj\u00ed um\u00edstit \u0161irok\u00e9 VM maxim\u00e1ln\u011b bl\u00edzko sebe.<\/p>\n

Velikost dom\u00e9ny jedin\u00e9ho selh\u00e1n\u00ed.<\/b> <\/p>\n

Volba velikosti serveru se tak\u00e9 prov\u00e1d\u00ed na z\u00e1klad\u011b principu minimalizace dom\u00e9ny jedin\u00e9ho selh\u00e1n\u00ed. Nap\u0159\u00edklad p\u0159i rozhodov\u00e1n\u00ed mezi:
\n \u2014 3 x 4*10c \/ 512 GB
\n \u2014 6 x 2*10c \/ 256 GB
\nP\u0159i jinak stejn\u00fdch podm\u00ednk\u00e1ch je t\u0159eba zvolit druhou mo\u017enost, proto\u017ee p\u0159i selh\u00e1n\u00ed jednoho serveru (nebo jeho \u00fadr\u017eb\u011b) p\u0159ich\u00e1z\u00ed o 33% prost\u0159edk\u016f clusteru, ale pouze o 17%. Tak\u00e9 se p\u0159esn\u011b takto sni\u017euje po\u010det VM a IS, na kter\u00e9 m\u011blo nehoda dopad.<\/p>\n

V\u00fdpo\u010det klasick\u00e9ho \u00falo\u017ei\u0161t\u011b podle v\u00fdkonu<\/b><\/p>\n

\"Design
\n
\nKlasick\u00e9 \u00falo\u017ei\u0161t\u011b se v\u017edy po\u010d\u00edt\u00e1 podle nejhor\u0161\u00edho sc\u00e9n\u00e1\u0159e, s v\u00fdjimkou vlivu opera\u010dn\u00ed cache a optimalizace operac\u00ed.
\nJako z\u00e1kladn\u00ed ukazatele v\u00fdkonu pova\u017eujeme mechanick\u00fd v\u00fdkon z disku (IOPSdisk):
\n \u2014 7.2k \u2013 75 IOPS
\n \u2014 10k \u2013 125 IOPS
\n \u2014 15k \u2013 175 IOPS<\/p>\n

D\u00e1le se po\u010det disk\u016f v diskov\u00e9m poli vypo\u010d\u00edt\u00e1v\u00e1 podle n\u00e1sleduj\u00edc\u00edho vzorce: = TotalIOPS * ( RW + (1 \u2013RW) * RAIDPen) \/ IOPSdisk<\/i>. Kde:
\n \u2014 TotalIOPS<\/i> \u2013 celkov\u00fd po\u017eadovan\u00fd v\u00fdkon v IOPS z diskov\u00e9ho pole
\n \u2014 RW<\/i> \u2013 procentu\u00e1ln\u00ed pod\u00edl operac\u00ed \u010dten\u00ed
\n \u2014 RAIDpen<\/i> \u2013 RAID penalizace pro vybranou \u00farove\u0148 RAID<\/p>\n

V\u00edce informac\u00ed o za\u0159\u00edzen\u00ed RAID a RAID Penalty se dozv\u00edte zde \u2014 V\u00fdkon \u00falo\u017ei\u0161t\u011b. \u010c\u00e1st prvn\u00ed.<\/a><\/noindex> a V\u00fdkon \u00falo\u017ei\u0161t\u011b. \u010c\u00e1st druh\u00e1.<\/a><\/noindex> a V\u00fdkon \u00falo\u017ei\u0161t\u011b. \u010c\u00e1st t\u0159et\u00ed<\/a><\/noindex><\/p>\n

Na z\u00e1klad\u011b z\u00edskan\u00e9ho po\u010dtu disk\u016f se po\u010d\u00edtaj\u00ed mo\u017en\u00e9 varianty, kter\u00e9 vyhovuj\u00ed po\u017eadavk\u016fm na kapacitu \u00falo\u017ei\u0161t\u011b, v\u010detn\u011b variant s v\u00edcestup\u0148ov\u00fdm \u00falo\u017een\u00edm.
\nV\u00fdpo\u010det syst\u00e9m\u016f s pou\u017eit\u00edm SSD jako \u00farovn\u011b ukl\u00e1d\u00e1n\u00ed se posuzuje odd\u011blen\u011b.
\nZvl\u00e1\u0161tnosti v\u00fdpo\u010dtu syst\u00e9m\u016f s Flash Cache
\n<\/b><\/p>\n

Flash Cache<\/i> \u2013 obecn\u00fd n\u00e1zev pro v\u0161echny propriet\u00e1rn\u00ed technologie vyu\u017eit\u00ed flash pam\u011bti jako cache druh\u00e9 \u00farovn\u011b. P\u0159i pou\u017eit\u00ed flash cache se obvykle po\u010d\u00edt\u00e1 v\u00fdkon \u00falo\u017ei\u0161t\u011b pro zaji\u0161t\u011bn\u00ed ust\u00e1len\u00e9 z\u00e1t\u011b\u017ee z magnetick\u00fdch disk\u016f, zat\u00edmco vrcholov\u00e9 z\u00e1t\u011b\u017ee zpracov\u00e1v\u00e1 cache.
\nP\u0159itom je nutn\u00e9 ch\u00e1pat profil z\u00e1t\u011b\u017ee a m\u00edru lokalizace po\u017eadavk\u016f na bloky \u00falo\u017en\u00fdch svazk\u016f. Flash cache je technologie pro z\u00e1t\u011b\u017ee s vysokou lokalizac\u00ed po\u017eadavk\u016f a je prakticky neaplikovateln\u00e1 pro rovnom\u011brn\u011b zat\u00ed\u017een\u00e9 svazky (nap\u0159\u00edklad pro analytick\u00e9 syst\u00e9my). <\/p>\n

V\u00fdpo\u010det hybridn\u00edch syst\u00e9m\u016f low-end \/ mid-range<\/b><\/p>\n

Hybridn\u00ed syst\u00e9my ni\u017e\u0161\u00edch a st\u0159edn\u00edch t\u0159\u00edd vyu\u017e\u00edvaj\u00ed v\u00edcestup\u0148ov\u00e9 ukl\u00e1d\u00e1n\u00ed s p\u0159em\u00eds\u0165ov\u00e1n\u00edm dat mezi \u00farovn\u011bmi podle pl\u00e1nu. Velikost bloku v\u00edcestup\u0148ov\u00e9ho ukl\u00e1d\u00e1n\u00ed u nejlep\u0161\u00edch model\u016f dosahuje 256 MB. Tyto vlastnosti neumo\u017e\u0148uj\u00ed pova\u017eovat technologii v\u00edcestup\u0148ov\u00e9ho ukl\u00e1d\u00e1n\u00ed za technologii zvy\u0161ov\u00e1n\u00ed v\u00fdkonu, jak si mnoz\u00ed myln\u011b mysl\u00ed. V\u00edcestup\u0148ov\u00e9 ukl\u00e1d\u00e1n\u00ed v syst\u00e9mech ni\u017e\u0161\u00ed a st\u0159edn\u00ed t\u0159\u00eddy je technologi\u00ed optimalizace n\u00e1klad\u016f na ukl\u00e1d\u00e1n\u00ed pro syst\u00e9my s v\u00fdraznou nerovnom\u011brnost\u00ed zat\u00ed\u017een\u00ed.<\/p>\n

Pro v\u00edcestup\u0148ov\u00e9 ukl\u00e1d\u00e1n\u00ed se p\u0159edev\u0161\u00edm po\u010d\u00edt\u00e1 v\u00fdkon na vrcholu \u00farovn\u011b, zat\u00edmco doln\u00ed \u00farove\u0148 \u00falo\u017ei\u0161t\u011b se pova\u017euje pouze za p\u0159id\u00e1vaj\u00edc\u00ed chyb\u011bj\u00edc\u00ed kapacitu. Pro hybridn\u00ed v\u00edcestup\u0148ov\u00fd syst\u00e9m je nezbytn\u00e9 pou\u017eit\u00ed technologie flash cache pro v\u00edcestup\u0148ov\u00fd pool za \u00fa\u010delem kompenzace poklesu v\u00fdkonu pro n\u00e1hle zah\u0159\u00e1t\u00e1 data z doln\u00ed \u00farovn\u011b.<\/p>\n

Pou\u017eit\u00ed SSD v v\u00edcestup\u0148ov\u00e9m diskov\u00e9m poli<\/b><\/p>\n

\"Design
\n
\nPou\u017eit\u00ed SSD v v\u00edcestup\u0148ov\u00e9m diskov\u00e9m poli m\u00e1 variace, v z\u00e1vislosti na specifik\u00e1ch implementace algoritm\u016f flash cache dan\u00e9ho v\u00fdrobce.
\nObecn\u00e1 praxe politiky ukl\u00e1d\u00e1n\u00ed pro diskov\u00e9 pole s \u00farovn\u00ed SSD \u2014 SSD first.
\nRead Only Flash Cache.<\/i> Pro \u00falo\u017ei\u0161t\u011b flash cache pouze pro \u010dten\u00ed se \u00farove\u0148 ukl\u00e1d\u00e1n\u00ed na SSD objevuje p\u0159i v\u00fdznamn\u00e9 lokalizaci operac\u00ed z\u00e1pisu mimo cache.
\n\u010cten\u00ed \/ Z\u00e1pis Flash Cache.<\/i> V p\u0159\u00edpad\u011b flash cache pro z\u00e1pis se nejprve nastav\u00ed maxim\u00e1ln\u00ed objem cache, a \u00farove\u0148 ukl\u00e1d\u00e1n\u00ed na SSD se objevuje pouze p\u0159i nedostatku velikosti cache pro zpracov\u00e1n\u00ed cel\u00e9ho lokalizovan\u00e9ho zat\u00ed\u017een\u00ed.
\nV\u00fdpo\u010det v\u00fdkonu SSD a cache se prov\u00e1d\u00ed poka\u017ed\u00e9 na z\u00e1klad\u011b doporu\u010den\u00ed v\u00fdrobce, ale v\u017edy pro nejhor\u0161\u00ed variantu.
\n
Zdroj: habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"

\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u0418\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u0430\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u0430 \u0441 \u0442\u043e\u0447\u043a\u0438 \u0437\u0440\u0435\u043d\u0438\u044f \u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u0442\u0435\u043b\u044f \u0445\u043e\u0440\u043e\u0448\u043e \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u044f\u0435\u0442\u0441\u044f \u0432 \u0413\u041e\u0421\u0422 \u0420\u0412 51987 \u2014 \u00ab\u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u0437\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u0430\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u0430, \u0440\u0435\u0437\u0443\u043b\u044c\u0442\u0430\u0442\u043e\u043c \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f \u043a\u043e\u0442\u043e\u0440\u043e\u0439 \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d\u0438\u0435 \u0432\u044b\u0445\u043e\u0434\u043d\u043e\u0439 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u0438 \u0434\u043b\u044f \u043f\u043e\u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u0433\u043e \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u043d\u0438\u044f\u00bb. \u0415\u0441\u043b\u0438 \u0440\u0430\u0441\u0441\u043c\u0430\u0442\u0440\u0438\u0432\u0430\u0442\u044c \u0432\u043d\u0443\u0442\u0440\u0435\u043d\u043d\u044e\u044e \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0443, \u0442\u043e \u043f\u043e \u0441\u0443\u0442\u0438 \u043b\u044e\u0431\u0430\u044f \u0418\u0421 \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u043e\u0439 \u0440\u0435\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u043d\u043d\u044b\u0445 \u0432 \u043a\u043e\u0434\u0435 \u0432\u0437\u0430\u0438\u043c\u043e\u0441\u0432\u044f\u0437\u0430\u043d\u043d\u044b\u0445 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u043e\u0432. \u0412 \u0448\u0438\u0440\u043e\u043a\u043e\u043c \u043f\u043e\u043d\u0438\u043c\u0430\u043d\u0438\u0438 \u0442\u0435\u0437\u0438\u0441\u0430 \u0422\u044c\u044e\u0440\u0438\u043d\u0433\u0430-\u0427\u0435\u0440\u0447\u0430 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c (\u0430 \u0441\u043b-\u043d\u043e \u0418\u0421) \u043e\u0441\u0443\u0449\u0435\u0441\u0442\u0432\u043b\u044f\u0435\u0442 \u0442\u0440\u0430\u043d\u0441\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u044e \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u0430 \u0432\u0445\u043e\u0434\u043d\u044b\u0445 […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":26806,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-35800","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n","aioseo_head_json":{"title":"\ud83e\udd47Design virtualizovan\u00e9ho datov\u00e9ho centra | ProHoster","description":"\u00davod Informa\u010dn\u00ed syst\u00e9m s bodem.","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/dizajn-virtualizovannogo-tsod","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\u0414\u0438\u0437\u0430\u0439\u043d \u0432\u0438\u0440\u0442\u0443\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u043d\u043d\u043e\u0433\u043e \u0426\u041e\u0414 | ProHoster","og:description":"\u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u0418\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u0430\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u0430 \u0441 \u0442\u043e\u0447\u043a\u0438.","og:url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/dizajn-virtualizovannogo-tsod","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-31T19:06:24+00:00","article:modified_time":"2019-10-31T19:06:24+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"35800","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-01-22 00:48:20","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 18:06:24","updated":"2026-01-22 00:48:20","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\/35800","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=35800"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/35800\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/26806"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=35800"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=35800"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=35800"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}