{"id":35091,"date":"2019-10-31T22:02:18","date_gmt":"2019-10-31T19:02:18","guid":{"rendered":"https:\/\/prohoster.info\/blog\/19-golov-gidry-bolshoj-obzor-programmy\/"},"modified":"2019-10-31T22:02:18","modified_gmt":"2019-10-31T19:02:18","slug":"19-golov-gidry-bolshoj-obzor-programmy","status":"publish","type":"post","link":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy","title":{"rendered":"19 hydras galvas. Liels programmas apskats","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p>11-12. j\u016blij\u0101 Sanktp\u0113terburg\u0101 notiks konference <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/?utm_source=habr&amp;utm_medium=453832\">Hydra<\/a><\/noindex>, kas velt\u012bta paral\u0113lo un izklied\u0113to sist\u0113mu izstr\u0101dei. Hidras \u012bpa\u0161\u012bba ir t\u0101, ka t\u0101 apvieno lieliskus zin\u0101tniekus (kuras parasti var atrast tikai \u0101rzemju zin\u0101tniskaj\u0101s konferenc\u0113s) un zin\u0101mus praktiz\u0113jo\u0161os in\u017eenierus vien\u0101 liel\u0101 programm\u0101, kas atrodas uz zin\u0101tnes un prakses robe\u017eas.<\/p>\n<p><\/p>\n<p>Hidra ir viena no m\u016bsu svar\u012bg\u0101kaj\u0101m konferenc\u0113m p\u0113d\u0113jo gadu laik\u0101. Tai bija nepiecie\u0161ama \u013coti nopietna sagatavo\u0161ana, run\u0101t\u0101ju un zi\u0146ojumu atlase. Pag\u0101ju\u0161aj\u0101 ned\u0113\u013c\u0101 par to <noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/jugru\/blog\/453952\/\">izn\u0101ca Habra-intervija<\/a><\/noindex> ar uz\u0146\u0113muma JUG.ru Group direktoriju Alekseju Fedorovu (<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/users\/23derevo\/\" class=\"user_link\">23derevo<\/a><\/noindex>). <\/p>\n<p><\/p>\n<p>M\u0113s <noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/jugru\/blog\/445730\/\">jau st\u0101st\u012bj\u0101m<\/a><\/noindex> par trim svar\u012bgajiem dal\u012bbniekiem, izklied\u0113to sist\u0113mu teorijas pamatlic\u0113jiem \u2014 Lesliju Lempelortu, Morisu Herlihi un Maiklu Skotu. Ir pien\u0101cis laiks detaliz\u0113t\u0101k apspriest visu programmu!<\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/55b262908f46159cbd3638f00772215c.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h2 id=\"motivaciya\">Motiv\u0101cija<\/h2>\n<p><\/p>\n<p>Ja j\u016bs nodarbojaties ar programm\u0113\u0161anu, tad, t\u0101 vai cit\u0101di, esat sask\u0101ries ar daudzdz\u012bslu programm\u0113\u0161anu un izklied\u0113tiem skait\u013cojumiem. Attiec\u012bgaj\u0101 jom\u0101 str\u0101d\u0101jo\u0161ie speci\u0101listi str\u0101d\u0101 tie\u0161i ar tiem, ta\u010du neizteikti izklied\u0113t\u012bba skat\u0101s uz mums no vis\u0101m pus\u0113m: jebkur\u0101 daudzkodolu dator\u0101 vai izklied\u0113t\u0101 dienest\u0101 atrad\u012bsies kaut kas, kas vienlaic\u012bgi veic skait\u013cojumus.<\/p>\n<p><\/p>\n<p>Eksist\u0113 daudzas konferences, kas atkl\u0101j noteiktus pielietojam\u0101s programm\u0113\u0161anas aspektus. Spektra otr\u0101 pus\u0113 mums ir speci\u0101las zin\u0101tnisk\u0101s skolas, kuras lekciju form\u0101t\u0101 atkl\u0101j milz\u012bgus saspringtas teorijas apjomus. Piem\u0113ram, paral\u0113li Hidr\u0101m P\u0113terburg\u0101 notiek <noindex><a rel=\"nofollow\" href=\"https:\/\/sptdc.ru\/?utm_source=habr&amp;utm_medium=453832\">skola SPTDC<\/a><\/noindex>. <strong>Konferenc\u0113 Hidra m\u0113s cent\u0101mies savienot gan cieto praksi, gan zin\u0101tni, gan visu, kas ir uz vi\u0146u robe\u017eas.<\/strong> <\/p>\n<p><\/p>\n<p>Padom\u0101jiet par ko: m\u0113s dz\u012bvojam br\u012bni\u0161\u0137\u012bg\u0101 laik\u0101, kad ir iesp\u0113jams kl\u0101tien\u0113 satikt zin\u0101tnes un in\u017eenierijas jomas dibin\u0101t\u0101jus, ar kuriem m\u0113s nodarbojamies. Fizik\u0101 nevienam neb\u016bs iesp\u0113ja satikt Neitonu vai Ejn\u0161teinu \u2014 vilciens ir aizg\u0101jis. Ta\u010du blakus mums joproj\u0101m dz\u012bvo tie, kas izveidoja izklied\u0113to sist\u0113mu teorijas pamatus, izgudroja popul\u0101ras programm\u0113\u0161anas valodas, pirmo reizi \u012bstenoja visu to str\u0101d\u0101jo\u0161os prototipos. \u0160ie cilv\u0113ki nav atst\u0101ju\u0161i savu darbu pusce\u013c\u0101, tie tie\u0161i \u0161obr\u012bd nodarbojas ar aktu\u0101l\u0101m probl\u0113m\u0101m pasaul\u0113 zin\u0101mos universit\u0101t\u0113s un uz\u0146\u0113mumos, un ir visliel\u0101kie zin\u0101\u0161anu un pieredzes avoti m\u016bsdien\u0101s. <\/p>\n<p><\/p>\n<p>No otras palabras, la posibilidad de encontrarse con ellos suele ser puramente te\u00f3rica: pocos de nosotros podemos monitorear constantemente eventos p\u00fablicos en alguna universidad de Rochester para luego viajar a EE. UU. y de regreso para una conferencia con Michael Scott. Visitar a todos los participantes de Hydra costar\u00eda una peque\u00f1a fortuna, sin contar el vasto tiempo perdido (aunque eso suena como una misi\u00f3n interesante).<\/p>\n<p><\/p>\n<p>Por otro lado, tenemos muchos ingenieros destacados que est\u00e1n trabajando en problemas actuales de sistemas distribuidos, y definitivamente tienen mucho que contar. Pero aqu\u00ed est\u00e1 el problema: ellos <em>str\u0101d\u0101<\/em>, y su tiempo es valioso. S\u00ed, si trabajas para Microsoft, Google o JetBrains, la probabilidad de encontrarte con uno de los conocidos ponentes en un evento interno aumenta dr\u00e1sticamente, pero en general, no sucede todos los d\u00edas.<\/p>\n<p><\/p>\n<p>As\u00ed, la conferencia Hydra cumple una importante funci\u00f3n que la mayor\u00eda de nosotros no podemos hacer por nuestra cuenta: re\u00fane en un mismo lugar y tiempo a personas cuyas ideas o interacciones pueden cambiar tu vida. Admito que no todo el mundo necesita sistemas distribuidos o temas complejos y fundamentales. Se puede programar CRUD en PHP durante toda la vida y seguir siendo bastante feliz. Pero si los necesitas, esta es tu oportunidad.<\/p>\n<p><\/p>\n<p>Desde el primer anuncio de la conferencia Hydra en Habr, ha pasado bastante tiempo. Durante este tiempo, se ha realizado un gran trabajo, y ahora tenemos una lista de casi todas las ponencias. \u00a1Nada de algoritmos unipuntoletales, solo puro hardcore distribuido! Terminemos con las palabras generales y veamos qu\u00e9 tenemos ahora.<\/p>\n<p><\/p>\n<h2 id=\"keynouty\">Keynotes<\/h2>\n<p><\/p>\n<p>Las keynotes abren y cierran los d\u00edas de la conferencia. Generalmente, el prop\u00f3sito de la keynote de apertura es establecer el esp\u00edritu general y la direcci\u00f3n de la conferencia. La keynote de clausura resume y explica c\u00f3mo vivir con los conocimientos y habilidades adquiridos durante los d\u00edas de la conferencia. El comienzo y el final: lo que se recordar\u00e1 mejor y, en general, tiene un significado especial.<\/p>\n<p><\/p>\n<h3 id=\"cliff-click--the-h2o-distributed-kv-algorithmhttpshydraconfru2019talks1urihjc39wzahcg3lbxbtqutm_sourcehabrutm_medium453832\">Cliff Click \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/1urihjc39wzahcg3lbxbtq\/?utm_source=habr&amp;utm_medium=453832\">El algoritmo K\/V distribuido H2O<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/2a1b4f1e305a3c4f32dc88e84cfe504f.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Cliff es una leyenda en el mundo de Java. A finales de los a\u00f1os 90, escribi\u00f3 una tesis para su PhD titulada <noindex>\u00abCombinando An\u00e1lisis, Combinando Optimizations\u00bb<\/noindex>, kas p\u0113c k\u0101da laika k\u013cuva par pamatu HotSpot JVM Server Compiler. P\u0113c diviem gadiem vi\u0146\u0161 jau str\u0101d\u0101ja Sun Microsystems pie JVM un par\u0101d\u012bja pasaulei, ka JIT ir peln\u012bjusi past\u0101v\u0113t. Visa \u0161\u012b st\u0101sts par to, ka Java ir viens no \u0101tr\u0101kajiem m\u016bsdienu laika ierakstiem ar visinteli\u0123ent\u0101kajiem un \u0101tr\u0101kajiem optimiz\u0101ciju risin\u0101jumiem, n\u0101k tie\u0161i no Klifa Klika. S\u0101kum\u0101 tika uzskat\u012bts, ka, ja kaut kas ir pieejams statiskajam kompilatoram, tad to pat nevajadz\u0113tu m\u0113\u0123in\u0101t d\u017eit\u012bt. Pateicoties Klifa un komandas darbam, visi jaunie valodas s\u0101ka tikt izstr\u0101d\u0101ti ar JIT-kompil\u0101ciju k\u0101 noklus\u0113jumu. Nebija \u0161aubu, ka t\u0101 bija ne viena cilv\u0113ka darba rezult\u0101ts, bet Klifs sp\u0113l\u0113ja taj\u0101 \u013coti svar\u012bgu lomu.<\/p>\n<p><\/p>\n<p>Atkl\u0101jo\u0161aj\u0101 keynot\u0101 Klifs past\u0101st\u012bs par citu savu uzs\u0101kumu \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/h2oai\/h2o-3\">H20<\/a><\/noindex>, atmi\u0146\u0101 balst\u012bta platforma izplat\u012btai un skalojamai ma\u0161\u012bnm\u0101c\u012b\u0161an\u0101s industri\u0101lai pielieto\u0161anai. Prec\u012bz\u0101k \u2014 par izplat\u012btu atsl\u0113gas-v\u0113rt\u012bbas p\u0101ru kr\u0101tuvi iek\u0161\u0101. T\u0101 ir \u013coti \u0101tra kr\u0101tuve ar daudziem interesantiem \u012bpa\u0161umiem (prec\u012bzs saraksts ir atrodams <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/1urihjc39wzahcg3lbxbtq\/?utm_source=habr&amp;utm_medium=453832\">aprakst\u0101<\/a><\/noindex>), kuri \u013cauj izmantot l\u012bdz\u012bgus risin\u0101jumus lielo datu straum\u0113\u0161anas matematik\u0101.<\/p>\n<p><\/p>\n<p>V\u0113l viens refer\u0101ts, ar kuru uzst\u0101sies Klifs \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/2jix5mst7iduyp9linqhfj\/?utm_source=habr&amp;utm_medium=453832\">The Azul Hardware Transactional Memory experience<\/a><\/noindex>. Otra da\u013ca vi\u0146a biogr\u0101fij\u0101 \u2014 desmit gadi <noindex>darba Azula<\/noindex>, kur vi\u0146\u0161 atjaunin\u0101ja un uzlaboja daudz ko dzel\u017eos un Azula tehnolo\u0123iju kaudz\u0113: JIT-kompilatorus, laika ierakstus, pavedienu modeli, k\u013c\u016bdu apstr\u0101di, darbu ar steku, aparat\u016bras trauc\u0113jumus, kla\u0161u iel\u0101di un t\u0101 t\u0101l\u0101k \u2014 nu, j\u016bs saprat\u0101t.<\/p>\n<p><\/p>\n<p>Visinteresant\u0101k\u0101 da\u013ca s\u0101k\u0101s, kad vi\u0146i izstr\u0101d\u0101ja aparat\u016bru lielajam biznesam \u2014 superdators Java palai\u0161anai. T\u0101 bija diezgan inovat\u012bva lieta, kas bija \u012bpa\u0161i paredz\u0113ta Java, kurai ir \u012bpa\u0161as pras\u012bbas \u2014 atmi\u0146as barjeras las\u012b\u0161anai zemas kav\u0113\u0161an\u0101s izs\u0113jo\u0161anas mekl\u0113\u0161anai, mas\u012bvi ar robe\u017eu p\u0101rbaudi, virtu\u0101lie izsaukumi\u2026 Viens no aizraujo\u0161ajiem risin\u0101jumiem ir aparat\u016bras transakciju atmi\u0146a. Visi L1 no 864 kodoliem var\u0113ja piedal\u012bties transakciju pierakstos, kas ir \u012bpa\u0161i svar\u012bgi Java blo\u0137\u0113\u0161anas darbam (synchronized blokiem var darboties paral\u0113li, kam\u0113r nav re\u0101lu konflikti par atmi\u0146u). Bet skaist\u0101 ideja sadur\u0101s ar skarbo realit\u0101ti \u2014 un \u0161aj\u0101 refer\u0101t\u0101 Klifs past\u0101st\u012bs, k\u0101p\u0113c HTM un STM nav \u013coti labi piem\u0113roti praktiskaj\u0101m vajadz\u012bb\u0101m daudz pavedienu apr\u0113\u0137in\u0101\u0161an\u0101.<\/p>\n<p><\/p>\n<h3 id=\"michael-scott--dual-data-structureshttpshydraconfru2019talkslnhqpq8cz5kzgjmhlqpicutm_sourcehabrutm_medium453832\">Maikls Skots \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/lnhqpq8cz5kzgjmhlqpic\/?utm_source=habr&amp;utm_medium=453832\">Divu datu strukt\u016bras<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/5270050098dc1230d469e60362b6930a.jpeg\" style=\"display:block;margin: 0 auto;\" \/> <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Michael_L._Scott\">Maikls Skots<\/a><\/noindex> \u2014 profesors datorzin\u0101tn\u0113 Ri\u010dmondas universit\u0101t\u0113, ar kuru liktenis vi\u0146u saist\u012bjis <noindex>jau 34 gadus<\/noindex>, bet dzimtaj\u0101 universit\u0101t\u0113 Wisconsin\u2013Madison vi\u0146\u0161 bija dek\u0101ns piecus gadus. Vi\u0146\u0161 p\u0113ta paral\u0113lo un izplat\u012bto programm\u0113\u0161anu un valodu dizainu un m\u0101ca to studentiem.<\/p>\n<p><\/p>\n<p>Visu pasauli Maikls paz\u012bst pateicoties m\u0101c\u012bbu gr\u0101matai <noindex><a rel=\"nofollow\" href=\"https:\/\/www.amazon.com\/Programming-Language-Pragmatics-Michael-Scott\/dp\/0124104096\/ref=sr_1_1?crid=265ZYWXFSUF4&amp;keywords=programming+language+pragmatics&amp;qid=1558916067&amp;s=gateway&amp;sprefix=Programming+Language+Pragmatics%2Caps%2C324&amp;sr=8-1\">\u201eProgramming Language Pragmatics\u201d<\/a><\/noindex>, p\u0113d\u0113jais izdevums, kas izn\u0101ca sal\u012bdzino\u0161i nesen \u2014 2015. gad\u0101. Vi\u0146a darbs <noindex><a rel=\"nofollow\" href=\"http:\/\/web.mit.edu\/6.173\/www\/currentsemester\/readings\/R06-scalable-synchronization-1991.pdf\">\u201eAlgorithms for scalable synchronization on shared-memory multiprocessors\u201d<\/a><\/noindex> ieg\u0101d\u0101j\u0101s <noindex><a rel=\"nofollow\" href=\"https:\/\/ru.wikipedia.org\/wiki\/%D0%9F%D1%80%D0%B5%D0%BC%D0%B8%D1%8F_%D0%94%D0%B5%D0%B9%D0%BA%D1%81%D1%82%D1%80%D1%8B\">Dijkstra balvu<\/a><\/noindex> k\u0101 viens no vispaz\u012bstam\u0101kajiem izplat\u012bto skait\u013co\u0161anas jom\u0101 un <noindex><a rel=\"nofollow\" href=\"https:\/\/www.cs.rochester.edu\/u\/scott\/papers\/1991_TOCS_synch.pdf\">br\u012bvi pieejams<\/a><\/noindex> Ri\u010dmondas universit\u0101tes tie\u0161saistes bibliot\u0113k\u0101. J\u016bs varat ar\u012b zin\u0101t vi\u0146u k\u0101 t\u0101 autora, kur\u0161 izstr\u0101d\u0101ja Maikla-Skota algoritmu no <noindex><a rel=\"nofollow\" href=\"https:\/\/www.cs.rochester.edu\/u\/scott\/papers\/1996_PODC_queues.pdf\">\u201eSimple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms\u201d<\/a><\/noindex>.<\/p>\n<p><\/p>\n<p>Kas attiecas uz Java pasauli, tad \u0161eit ir \u012bpa\u0161a situ\u0101cija: kop\u0101 ar Doug Lea vi\u0146\u0161 izstr\u0101d\u0101ja tos neblok\u0113jo\u0161os algoritmus un sinhron\u0101s rindas, uz kur\u0101m balst\u0101s Java bibliot\u0113kas. Par to ar\u012b b\u016bs galven\u0101 runa \u201eDivu datu strukt\u016bras\u201d \u2014 \u0161o strukt\u016bru ievie\u0161ana Java SE 6 \u013c\u0101va uzlabot veiktsp\u0113ju desmitk\u0101rt. <code>java.util.concurrent.ThreadPoolExecutor<\/code>. Ja jums iepriek\u0161 ir interese, kas ir \u0161\u012bs \u201eDivu datu strukt\u016bras\u201d, tad par to ir <noindex><a rel=\"nofollow\" href=\"https:\/\/www.cs.rochester.edu\/research\/synchronization\/pseudocode\/duals.html\">atbilsto\u0161s darbs<\/a><\/noindex>. <\/p>\n<p><\/p>\n<h3 id=\"maurice-herlihy--blockchains-and-the-future-of-distributed-computinghttpshydraconfru2019talks6ayncxk5m9q7g6dn80b7bcutm_sourcehabrutm_medium453832\">Moriss Herlihi \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/6ayncxk5m9q7g6dn80b7bc\/?utm_source=habr&amp;utm_medium=453832\">Blok\u0137\u0113des un izplat\u012bt\u0101s skait\u013co\u0161anas n\u0101kotne<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/807a70783be0a9825a85eca0e73b6a70.jpeg\" style=\"display:block;margin: 0 auto;\" \/> <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Maurice_Herlihy\">Moriss H\u0113rlihs<\/a><\/noindex> \u2014 divu Dijkstra balvu ieguv\u0113js. Pirm\u0101 \u2014 par darbu pie <noindex><a rel=\"nofollow\" href=\"https:\/\/cs.brown.edu\/~mph\/Herlihy91\/p124-herlihy.pdf\">\u00abWait-Free Synchronization\u00bb<\/a><\/noindex> (Braunova universit\u0101te), un otr\u0101, jaun\u0101ka \u2014 <noindex><a rel=\"nofollow\" href=\"http:\/\/courses.cs.vt.edu\/cs5204\/fall09-kafura\/Papers\/TransactionalMemory\/Architecture-Support.pdf\">\u00abTransactional Memory: Architectural Support for Lock-Free Data Structures\u00bb<\/a><\/noindex> (Virg\u012bnijas Tehnolo\u0123iju universit\u0101te). Dijkstra balvu pie\u0161\u0137ir par darbiem, kuru noz\u012bme un ietekme ir bijusi paman\u0101ma ne maz\u0101k k\u0101 desmit gadus, un ac\u012bmredzot Moriss ir viens no vispaz\u012bstam\u0101kajiem speci\u0101listiem \u0161aj\u0101 jom\u0101. Pa\u0161laik vi\u0146\u0161 str\u0101d\u0101 par profesoru Braunova universit\u0101t\u0113 un ir guvis daudz sasniegumu gar\u0101 rind\u0101.<\/p>\n<p><\/p>\n<p>\u0160aj\u0101 nosl\u0113dzo\u0161aj\u0101 galvenaj\u0101 run\u0101 Moriss run\u0101s par blok\u0137\u0113\u017eu izplat\u012bto sist\u0113mu teoriju un praksi no klasisk\u0101s izplat\u012bto skait\u013co\u0161anas skatpunkta un par to, k\u0101 tas atvieglo daudzus saist\u012btus jaut\u0101jumus. \u0160is b\u016bs runa ekskluz\u012bvi par konferen\u010du t\u0113mu \u2014 nevis par ieguves augstumu, bet dr\u012bz\u0101k par to, cik efekt\u012bvi un attiec\u012bgi m\u016bsu zin\u0101\u0161anas var izmantot da\u017e\u0101du uzdevumu risin\u0101\u0161anai.<\/p>\n<p><\/p>\n<p>2017. gada j\u016blij\u0101 Moriss jau apmekl\u0113ja Krieviju uz SPTDC skolu, piedal\u012bj\u0101s JUG.ru meetup\u0101, un ierakstu var skat\u012bt YouTube:<\/p>\n<p>\n<center><div class=\"youtube-placeholder\" data-id=\"S3Fx-7avfs4\" onclick=\"loadVideo(this)\">\r\n        <img decoding=\"async\" src=\"https:\/\/img.youtube.com\/vi\/S3Fx-7avfs4\/hqdefault.jpg\" alt=\"Atska\u0146ot video\" loading=\"lazy\" width=\"480\" height=\"360\" style=\"width:100%;height:auto;\">\r\n        <div class=\"play-button\"><\/div>\r\n    <\/div><\/center><\/p>\n<h2 id=\"osnovnaya-programma\">Pamatprogramma<\/h2>\n<p><\/p>\n<p>T\u0101l\u0101k b\u016bs neliels p\u0101rskats par refer\u0101tiem, kas iek\u013cauti programm\u0101. Da\u013ca refer\u0101tu \u0161eit tiek aprakst\u012bta detaliz\u0113ti, da\u013ca \u2014 \u012bs\u0101k. Gar\u0101s aprakstus sa\u0146\u0113ma, galvenok\u0101rt, angliski run\u0101jo\u0161ajiem refer\u0101tiem, kuriem ir vajadz\u012bgas atsauces uz zin\u0101tniskajiem darbiem, terminiem Vikip\u0113dij\u0101 un taml\u012bdz\u012bgi. Pilnu sarakstu var <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/#schedule\">redz\u0113t konferences m\u0101jaslap\u0101<\/a><\/noindex>. Saraksts m\u0101jaslap\u0101 tiks atjaunin\u0101ts un papildin\u0101ts. <\/p>\n<p><\/p>\n<h3 id=\"leslie-lamport--q--ahttpshydraconfru2019talks6evatt1mvwvpnwfxxveivwutm_sourcehabrutm_medium453832\">Leslie Lamport \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/6evatt1mvwvpnwfxxveivw\/?utm_source=habr&amp;utm_medium=453832\">Jaut\u0101jumi un atbildes<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/4c6d5928be31af95cd3e2a7812e86854.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Leslijs Lempports ir pamatu autors teor\u0113tiskaj\u0101 inform\u0101tik\u0101. <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/LaTeX\">\u00abLaTeX\u00bb<\/a><\/noindex> ir sa\u012bsin\u0101jums no \u00abLamport TeX\u00bb. Tie\u0161i vi\u0146\u0161 pirmo reizi, v\u0113l 1979. gad\u0101, ieviesa j\u0113dzienu <noindex><a rel=\"nofollow\" href=\"http:\/\/lamport.azurewebsites.net\/pubs\/multi.pdf\">sekven\u010du saska\u0146ot\u012bbas<\/a><\/noindex>, un vi\u0146a raksts <noindex><a rel=\"nofollow\" href=\"http:\/\/lamport.azurewebsites.net\/pubs\/time-clocks.pdf\">\u00abHow to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs\u00bb<\/a><\/noindex> sa\u0146\u0113ma Dijkstra pr\u0113miju.<\/p>\n<p><\/p>\n<p>\u0160\u012b ir visneparast\u0101k\u0101 form\u0101ta da\u013ca no programmas, jo t\u0101 nav pat refer\u0101ts, bet jaut\u0101jumu un atbil\u017eu sesija. Kad b\u016btiska da\u013ca auditorijas jau ir paz\u012bstama (vai var\u0113s saprast) ar visda\u017e\u0101d\u0101kajiem darbiem, kas balst\u012bti uz \u00abLemporta teoriju\u00bb, vi\u0146a pa\u0161a rakstiem un refer\u0101tiem, ir svar\u012bgi izt\u0113r\u0113t visu pieejamo laiku tie\u0161ai komunik\u0101cijai.<\/p>\n<p><\/p>\n<p>Ideja ir vienk\u0101r\u0161a \u2014 j\u016bs skat\u0101ties divus video YouTube: <noindex><a rel=\"nofollow\" href=\"https:\/\/youtu.be\/6QsTfL-uXd8\">\u00abProgramm\u0113\u0161anai j\u0101b\u016bt vair\u0101k nek\u0101 kod\u0113\u0161anai\u00bb<\/a><\/noindex> un <noindex><a rel=\"nofollow\" href=\"https:\/\/www.heidelberg-laureate-forum.org\/blog\/video\/lecture-monday-september-24-2018-leslie-lamport\/\">\u00abJa, ja neesi programm\u0113jis, nelietojiet programm\u0113\u0161anas valodu\u00bb<\/a><\/noindex> un sagatavojat vismaz vienu jaut\u0101jumu, uz kuru atbild\u0113s Leslijs.<\/p>\n<p><\/p>\n<p>Pirmais no \u0161iem diviem video m\u0113s jau <noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/jugru\/blog\/454898\/\">p\u0101rveidoj\u0101m par rakstu<\/a><\/noindex>. Ja jums nav stundas laika video skat\u012b\u0161anai, varat to \u0101tri izlas\u012bt k\u0101 tekstu.<\/p>\n<p><\/p>\n<p>Piez\u012bmei: YouTube ir daudz vair\u0101k video ar Lesliju Lempportu. Piem\u0113ram, ir lieliska <noindex><a rel=\"nofollow\" href=\"https:\/\/www.youtube.com\/watch?v=p54W-XOIEF8&amp;list=PLWAv2Etpa7AOAwkreYImYt0gIpOdWQevD\">kursu par TLA+<\/a><\/noindex>. Offline versija par visu \u0161o kursu ir pieejama <noindex><a rel=\"nofollow\" href=\"http:\/\/lamport.azurewebsites.net\/video\/videos.html\">autora m\u0101jaslap\u0101<\/a><\/noindex>, un YouTube vi\u0146\u0161 to ievietoja \u0113rt\u0101kai skat\u012b\u0161anai uz mobilaj\u0101m ier\u012bc\u0113m.<\/p>\n<p><\/p>\n<h3 id=\"martin-kleppmann--syncing-data-across-user-devices-for-distributed-collaborationhttpshydraconfru2019talks6i4lkw8pwjnadgff5ylr11utm_sourcehabrutm_medium453832\">Martin Kleppmann \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/6i4lkw8pwjnadgff5ylr11\/?utm_source=habr&amp;utm_medium=453832\">Datu sinhroniz\u0101cija starp lietot\u0101ju ier\u012bc\u0113m sadal\u012btai sadarb\u012bbai<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/09af25ab1ce915ba13ec6ee1013878f6.jpeg\" style=\"display:block;margin: 0 auto;\" \/> M\u0101rti\u0146\u0161 Kl\u0113pmans ir p\u0113tnieks Kembrid\u017eas universit\u0101t\u0113, str\u0101d\u0101jot pie CRDT un form\u0101las verifik\u0101cijas algoritmiem. M\u0101rti\u0146a gr\u0101mata <noindex>\u00abDatu intens\u012bvas lietojumprogrammas\u00bb<\/noindex>, kas public\u0113ta 2017. gad\u0101, izr\u0101d\u012bj\u0101s \u013coti veiksm\u012bga un iek\u013cuva p\u0101rdot\u0101ko sarakstos datu uzglab\u0101\u0161anas un apstr\u0101des jom\u0101. Kevins Skots, CTO Microsoft\u0101, <noindex><a rel=\"nofollow\" href=\"https:\/\/martin.kleppmann.com\/2017\/03\/27\/designing-data-intensive-applications.html\">k\u0101dreiz teica<\/a><\/noindex>: \u00ab\u0160ai gr\u0101matai j\u0101b\u016bt oblig\u0101tai in\u017eenieriem un izstr\u0101d\u0101t\u0101jiem. Tas ir reti sastopams resurss, kas apvieno teoriju unpraksi, pal\u012bdzot izstr\u0101d\u0101t\u0101jiem gudr\u0101k veidot un \u012bstenot infrastrukt\u016bru un datu apstr\u0101des sist\u0113mas\u00bb.<\/p>\n<p><\/p>\n<p>Pirms piev\u0113r\u0161an\u0101s akad\u0113miskajiem p\u0113t\u012bjumiem, M\u0101rti\u0146\u0161 str\u0101d\u0101ja nozar\u0113 un k\u013cuva par divu veiksm\u012bgu jaunizveidoto uz\u0146\u0113mumu l\u012bdz\u012bpa\u0161nieku:<\/p>\n<p><\/p>\n<ul>\n<li>Rapportive, kas bija velt\u012bts soci\u0101l\u0101 profila att\u0113lo\u0161anai j\u016bsu e-pasta kontaktu sarakst\u0101, kuru LinkedIn ieg\u0101d\u0101j\u0101s 2012. gad\u0101;<\/li>\n<li>Go Test It, pakalpojums autom\u0101tiskai t\u012bmek\u013ca viet\u0146u p\u0101rbaudei da\u017e\u0101d\u0101s p\u0101rl\u016bkprogramm\u0101s, kuru RedGate ieg\u0101d\u0101j\u0101s 2009. gad\u0101.<\/li>\n<\/ul>\n<p><\/p>\n<p>Kopum\u0101 M\u0101rti\u0146\u0161, kaut ar\u012b ir maz\u0101k paz\u012bstams nek\u0101 m\u016bsu galvenie run\u0101t\u0101ji, jau ir sp\u0113jis sniegt savu ieguld\u012bjumu gan sadal\u012bto skait\u013co\u0161anas, gan nozares att\u012bst\u012bb\u0101.<\/p>\n<p><\/p>\n<p>\u0160aj\u0101 zi\u0146ojum\u0101 M\u0101rti\u0146\u0161 run\u0101s par t\u0113mu, kas ir tuv\u0101ka vi\u0146a akad\u0113miskajiem p\u0113t\u012bjumiem. Google Docs un l\u012bdz\u012bgiem dokumentu koplabo\u0161anas programmat\u016bras izstr\u0101d\u0101jumiem \"koplabo\u0161ana\" noz\u012bm\u0113 repliku izplat\u012b\u0161anu: katram lietot\u0101jam ir sava kopija kop\u012bg\u0101 dokument\u0101, ko vi\u0146i p\u0113c tam maina, un visas izmai\u0146as tiek nos\u016bt\u012btas pa t\u012bklu citiem dal\u012bbniekiem. Dokumentu izmai\u0146as bezsaist\u0113 rada pagaidu nesakrit\u012bbu attiec\u012bb\u0101 pret p\u0101r\u0113jiem dal\u012bbniekiem, un atk\u0101rtota sinhroniz\u0101cija prasa konfliktu apstr\u0101di. Tie\u0161i tam ir paredz\u0113ti <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Conflict-free_replicated_data_type\">konfliktus neietekm\u0113jo\u0161ie replik\u0101cijas datu tipi<\/a><\/noindex> (CRDT), b\u016bt\u012bb\u0101 \u2014 diezgan jauna lieta, kuras b\u016bt\u012bba tika formul\u0113ta tikai 2011. gad\u0101. \u0160aj\u0101 zi\u0146ojum\u0101 tiek apspriests, kas ir noticis kop\u0161 t\u0101 laika CRDT pasaul\u0113, k\u0101di ir p\u0113d\u0113jie sasniegumi, tiek apspriests pieejas rad\u012b\u0161ana local-first lietojumprogramm\u0101m visp\u0101r un open-source bibliot\u0113kas <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/automerge\/automerge\">Automerge<\/a><\/noindex> \u012bpa\u0161i.<\/p>\n<p><\/p>\n<blockquote><p>N\u0101kamned\u0113\u013c m\u0113s public\u0113sim lielu interviju ar M\u0101rti\u0146u Habr\u0101, tas b\u016bs interesanti.<\/p><\/blockquote>\n<p><\/p>\n<h3 id=\"pedro-ramalhete--wait-free-data-structures-and-wait-free-transactionshttpshydraconfru2019talks1jwmdzkmjcalsclwavttxkutm_sourcehabrutm_medium453832\">Pedro Ramalhete \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/1jwmdzkmjcalsclwavttxk\/?utm_source=habr&amp;utm_medium=453832\">Gaidas br\u012bvas datu strukt\u016bras un gaidas br\u012bvas transakcijas<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/be9b98f5ab95d0f6646dfcb4cee38978.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Pedros str\u0101d\u0101 uz\u0146\u0113mum\u0101 Cisco un p\u0113d\u0113jos desmit gadus izstr\u0101d\u0101 paral\u0113los algoritmus, tostarp sinhroniz\u0101cijas meh\u0101nismus, lock-free un wait-free datu strukt\u016bras, un visu, ko j\u016bs varat iedom\u0101ties \u0161aj\u0101 jom\u0101. Vi\u0146a pa\u0161reiz\u0113jie zin\u0101tniskie un in\u017eeniertehniskie interes\u0113 ir koncentr\u0113ti uz Univers\u0101laj\u0101m b\u016bv\u0113m, programmat\u016bras transakciju atmi\u0146u, notur\u012bgo atmi\u0146u un l\u012bdz\u012bg\u0101m tehnolo\u0123ij\u0101m, kas \u013cauj realiz\u0113t korektas, skalojamas un k\u013c\u016bdu iztur\u012bgas lietojumprogrammas. Un vi\u0146\u0161 ir ar\u012b paz\u012bstam\u0101 bloga autors <noindex><a rel=\"nofollow\" href=\"http:\/\/concurrencyfreaks.blogspot.com\/\">Concurrency Freaks<\/a><\/noindex>.<\/p>\n<p><\/p>\n<p>Liel\u0101k\u0101 da\u013ca daudzpl\u016bsmu lietojumprogrammu \u0161obr\u012bd str\u0101d\u0101 ar paral\u0113l\u0101m datu strukt\u016br\u0101m, s\u0101kot ar zi\u0146ojumu rind\u0101m starp aktoriem un beidzot ar indeks\u0113t\u0101m datu strukt\u016br\u0101m key-value glab\u0101tuv\u0113s. Java JDK t\u0101s veiksm\u012bgi darbojas jau daudzus gadus, un C++ ar\u012b pak\u0101peniski pievieno \u0161\u0101das iesp\u0113jas.<\/p>\n<p><\/p>\n<p>Vienk\u0101r\u0161\u0101kais veids, k\u0101 \u012bstenot paral\u0113lu datu strukt\u016bru, ir sec\u012bga (viena pl\u016bsmas) \u012bsteno\u0161ana, kur\u0101 metodes ir aizsarg\u0101tas ar mutexiem. Tas ir pieejams ikvienam junioram, ta\u010du tam ir ac\u012bmredzamas probl\u0113mas ar m\u0113rogojam\u012bbu un veiktsp\u0113ju. Taj\u0101 pa\u0161\u0101 laik\u0101, lock-free un wait-free datu strukt\u016bras ne tikai lab\u0101k tiek gal\u0101 ar k\u013c\u016bd\u0101m, bet t\u0101m ir ar\u012b izdev\u012bg\u0101ks veiktsp\u0113jas profils \u2013 tom\u0113r to izstr\u0101dei nepiecie\u0161ama dzi\u013ca ekspert\u012bze un piel\u0101go\u0161ana konkr\u0113tajai izmanto\u0161anas metodei. Viena nepareiza koda rinda var saboj\u0101t visu.<\/p>\n<p><\/p>\n<p>K\u0101 pan\u0101kt, lai pat neeksperti var\u0113tu projekt\u0113t un \u012bstenot \u0161\u0101das datu strukt\u016bras? Ir zin\u0101ms, ka jebkuru sec\u012bgu algoritmu var padar\u012bt dro\u0161u pret pl\u016bsm\u0101m, izmantojot vai nu <noindex><a rel=\"nofollow\" href=\"https:\/\/hal.inria.fr\/hal-01397265v1\/document\">univers\u0101lu konstrukciju<\/a><\/noindex>, vai ar\u012b transakciju atmi\u0146u. Abas \u0161\u012bs pieejas var samazin\u0101t iebrauk\u0161anas slieksni, risinot \u0161o uzdevumu. Tom\u0113r abas \u0161o risin\u0101jumu parasti noved pie neefekt\u012bvas \u012bsteno\u0161anas. Pedros st\u0101st\u012bs, k\u0101 vi\u0146iem izdev\u0101s padar\u012bt \u0161os konstrukcijas efekt\u012bv\u0101kas un k\u0101 t\u0101s var izmantot vi\u0146u algoritmos.<\/p>\n<p><\/p>\n<h3 id=\"heidi-howard---liberating-distributed-consensushttpshydraconfru2019talks5z2xknkq9mozvqzhhgfoeiutm_sourcehabrutm_medium453832\">Heidi Howard \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/5z2xknkq9mozvqzhhgfoei\/?utm_source=habr&amp;utm_medium=453832\">Atbr\u012bvojo\u0161a izdal\u012bta konsensusa<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/09dd05684fde1015a87818f0b6804680.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Heidi Hov\u0101rda \u2014 l\u012bdz\u012bgi k\u0101 Martins, ir izp\u0113tes speci\u0101liste izdal\u012btu sist\u0113mu jom\u0101 Kembrid\u017eas universit\u0101t\u0113. Vi\u0146as specializ\u0101cija ir konsekvence, k\u013c\u016bdu tolerances, veiktsp\u0113ja un izdal\u012bts konsensuss. Vi\u0146a ir vislab\u0101k paz\u012bstama ar Paksos algoritma visp\u0101rin\u0101\u0161anu, kuru sauc par <noindex><a rel=\"nofollow\" href=\"https:\/\/fpaxos.github.io\/\">Elast\u012bgo Paksos<\/a><\/noindex>. <\/p>\n<p><\/p>\n<p>Atg\u0101din\u0101sim, ka <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Paxos_(computer_science)\">Paxos<\/a><\/noindex> \u2014 protokolu kopumu, ko izmanto konsensusa probl\u0113mas risin\u0101\u0161anai, str\u0101d\u0101jot ar neuzticamiem apr\u0113\u0137inu mezgliem, un t\u0101 pamat\u0101 ir Leslija Lamparta darbi. T\u0101d\u0113j\u0101di da\u017ei no m\u016bsu run\u0101t\u0101jiem str\u0101d\u0101 pie uzdevumiem, kurus s\u0101kotn\u0113ji pied\u0101v\u0101ja citi m\u016bsu run\u0101t\u0101ji \u2014 un tas ir br\u012bni\u0161\u0137\u012bgi.<\/p>\n<p><\/p>\n<p>Iesp\u0113ja atrast konsensu starp vair\u0101kiem hostiem \u2013 adres\u0113\u0161anai, l\u012bdera izv\u0113lei, blo\u0137\u0113\u0161anai vai koordin\u0101cijai \u2013 ir pamatjaut\u0101jums m\u016bsdienu sadal\u012btaj\u0101s sist\u0113m\u0101s. Paxos \u0161obr\u012bd ir galven\u0101 metode konsensa probl\u0113mu risin\u0101\u0161anai, un ap to norisin\u0101s daudzi p\u0113t\u012bjumi, kuru m\u0113r\u0137is ir papla\u0161in\u0101t un optimiz\u0113t algoritmu da\u017e\u0101d\u0101m praktisk\u0101m vajadz\u012bb\u0101m. <\/p>\n<p><\/p>\n<p>\u0160aj\u0101 zi\u0146ojum\u0101 m\u0113s p\u0101rskat\u012bsim Paxos teor\u0113tiskos pamatus, v\u0101jinojot s\u0101kotn\u0113j\u0101s pras\u012bbas un visp\u0101rinot algoritmu. M\u0113s redz\u0113sim, ka Paxos, b\u016bt\u012bb\u0101, ir tikai viens no variantiem milz\u012bg\u0101 pieeju spektr\u0101 konsensam, un ka citas spektra da\u013cas ar\u012b ir \u013coti noder\u012bgas labu sadal\u012btu sist\u0113mu veido\u0161an\u0101.<\/p>\n<p><\/p>\n<h3 id=\"alex-petrov--reduce-your-storage-costs-with-transient-replication-and-cheap-quorumshttpshydraconfru2019talks6eb39udg8bxsgmimkexd6jutm_sourcehabrutm_medium453832\">Aleks Petrov \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/6eb39udg8bxsgmimkexd6j\/?utm_source=habr&amp;utm_medium=453832\">Samaziniet uzglab\u0101\u0161anas izmaksas ar pagaidu replik\u0101ciju un l\u0113tiem kvorumiem<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/178a1db3cf49b5ff73a0c9101ab3845c.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Aleks ir datu b\u0101zu un uzglab\u0101\u0161anas sist\u0113mu speci\u0101lists, un, kas ir svar\u012bgi m\u016bsu vajadz\u012bb\u0101m, komit\u0113t\u0101js <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Apache_Cassandra\">Cassandra<\/a><\/noindex>. Kop\u0101 ar O'Reilly vi\u0146\u0161 \u0161obr\u012bd str\u0101d\u0101 pie gr\u0101matas Database Internals.<\/p>\n<p><\/p>\n<p>Sist\u0113m\u0101m ar <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Eventual_consistency\">eventual consistency<\/a><\/noindex> (krievu terminolo\u0123ij\u0101 \u2013 \u201esaska\u0146o\u0161ana galu gal\u0101\u201d), p\u0113c mezgla kri\u0161anas vai t\u012bkla sadal\u012b\u0161anas ir j\u0101izlemj n\u0101kam\u0101 dilemm\u0101: turpin\u0101t izpild\u012bt piepras\u012bjumus, upur\u0113jot saska\u0146ot\u012bbu, vai atteikt to izpildi un upur\u0113t pieejam\u012bbu. \u0160\u0101d\u0101 sist\u0113m\u0101 kvorumi, p\u0101rkl\u0101jo\u0161i mezglu apak\u0161kopas, kas garant\u0113, ka vismaz viens mezgls satur\u0113s jaun\u0101ko v\u0113rt\u012bbu, var k\u013c\u016bt par labu robe\u017erisin\u0101jumu. Var iztur\u0113t av\u0101rijas un savienojuma zudumu da\u017eu mezglu p\u0113d\u0113j\u0101 gad\u012bjum\u0101, turpinot atbild\u0113t ar visjaun\u0101kaj\u0101m v\u0113rt\u012bb\u0101m.<\/p>\n<p><\/p>\n<p>Tom\u0113r viss maks\u0101 savu cenu. Kvorumu replik\u0101cijas sh\u0113ma noz\u012bm\u0113 paaugstin\u0101tas uzglab\u0101\u0161anas izmaksas: ir nepiecie\u0161ams glab\u0101t liekos datus vair\u0101kos mezglos vienlaic\u012bgi, lai garant\u0113tu pietiekamu pieejamo kopiju skaitu probl\u0113mas gad\u012bjum\u0101. Izr\u0101d\u0101s, ka nav nepiecie\u0161ams glab\u0101t visus datus vis\u0101s replik\u0101s. Var samazin\u0101t slodzi uz glab\u0101\u0161anu, ja tur datu tikai da\u013c\u0101 mezglu, bet trauc\u0113jumu apstr\u0101dei izmantot speci\u0101las noder\u012bgas noderes (Transient Replica).<\/p>\n<p><\/p>\n<p>Zi\u0146ojuma gait\u0101 m\u0113s apskat\u012bsim <noindex><a rel=\"nofollow\" href=\"http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.146.3429&amp;rep=rep1&amp;type=pdf\">Witness Replicas<\/a><\/noindex>, replik\u0101cijas sh\u0113ma, kas tiek izmantota <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Spanner_(database)\">Spanner<\/a><\/noindex> un <noindex><a rel=\"nofollow\" href=\"http:\/\/cidrdb.org\/cidr2011\/Papers\/CIDR11_Paper32.pdf\">Megastore<\/a><\/noindex>, un \u0161\u012bs koncepcijas \u012bstenojumu Apache Cassandra ar nosaukumu <noindex><a rel=\"nofollow\" href=\"https:\/\/jira.apache.org\/jira\/browse\/CASSANDRA-14404?subTaskView=all\">Transient Replication &amp; Cheap Quorums<\/a><\/noindex>.<\/p>\n<p><\/p>\n<h3 id=\"dmitriy-vyukov---goroutines-exposedhttpshydraconfru2019talks7336ginp0kke7n4yxxjvldutm_sourcehabrutm_medium453832\">Dmitrijs Vjukovs \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/7336ginp0kke7n4yxxjvld\/?utm_source=habr&amp;utm_medium=453832\">Goroutines exposed<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/94ce38f8cc366bbd2ee53b9636e4650d.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Dmitrijs \u2014 izstr\u0101d\u0101t\u0101js uz\u0146\u0113mum\u0101 Google, kur\u0161 str\u0101d\u0101 pie dinamisk\u0101s test\u0113\u0161anas C\/C++ un Go \u2014 Address\/Memory\/ThreadSanitizer, k\u0101 ar\u012b pie l\u012bdz\u012bgiem r\u012bkiem Linux kodol\u0101. Vi\u0146\u0161 ir piedal\u012bjies Go m\u0113rogojam\u0101 gorut\u012bnu pl\u0101not\u0101ja, t\u012bkla pollera un paral\u0113l\u0101 atkritumu sav\u0101c\u0113ja izstr\u0101d\u0113. Vi\u0146\u0161 ir daudzu jauno neblo\u0137\u0113jo\u0161o algoritmu eksperts un \u012bpa\u0161nieks. <noindex><a rel=\"nofollow\" href=\"https:\/\/software.intel.com\/en-us\/blackbelt\">Melna josta<\/a><\/noindex> Intel.<\/p>\n<p><\/p>\n<p>Tagad nedaudz par pa\u0161u zi\u0146ojumu. Valod\u0101 Go ir ieb\u016bv\u0113ta atbalsts daudzpl\u016bsmas veik\u0161anai, izmantojot gorut\u012bnas (viegl\u0101s pavedienus) un kan\u0101lus (FIFO rindas). \u0160o meh\u0101nismu d\u0113\u013c lietot\u0101jiem ir \u013coti viegli un pat\u012bkami rakst\u012bt m\u016bsdien\u012bgas daudzpl\u016bsmas lietojumprogrammas, un tas izskat\u0101s k\u0101 ma\u0123ija. K\u0101 m\u0113s saprotam, \u0161eit nav nek\u0101das ma\u0123ijas. \u0160aj\u0101 zi\u0146ojum\u0101 Dmitrijs iedzi\u013cin\u0101s Go pl\u0101not\u0101ja darb\u012bbas smalkumos un par\u0101d\u012bs \u0161\u012bs \u00abma\u0123ijas\u00bb \u012bsteno\u0161anas nosl\u0113pumus. S\u0101kum\u0101 vi\u0146\u0161 sniegs p\u0101rskatu par galvenajiem pl\u0101not\u0101ja komponentiem un past\u0101st\u012bs, k\u0101 tas darbojas. P\u0113c tam m\u0113s tuv\u0101k iepaz\u012bsimies ar atsevi\u0161\u0137iem aspektiem, piem\u0113ram, st\u0101v\u0113\u0161anas\/unparking strat\u0113\u0123iju un blo\u0137\u0113jo\u0161o sist\u0113mas izsaukumu apstr\u0101di. Visbeidzot, Dmitrijs nedaudz past\u0101st\u012bs par iesp\u0113jamajiem uzlabojumiem pl\u0101not\u0101j\u0101.<\/p>\n<p><\/p>\n<h3 id=\"dmitriy-bugaychenko---uskoryaem-raspredelennyy-analiz-grafov-s-pomoschyu-veroyatnostnyh-sketchey-i-ne-tolkohttpshydraconfru2019talks1po7b00j6m4vst3df7aqtoutm_sourcehabrutm_medium453832\">Dmitrijs Buga\u010denko \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/1po7b00j6m4vst3df7aqto\/?utm_source=habr&amp;utm_medium=453832\">Pa\u0101trin\u0101m sadal\u012btu grafu anal\u012bzi, izmantojot probabilistiskos ski\u010dus un ne tikai<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/f963ef8ac1a37011aa387016dc938b3c.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Dmitrijs gandr\u012bz 9 gadus ir str\u0101d\u0101jis \u0101rpakalpojum\u0101, nezaud\u0113jot saikni ar universit\u0101ti un zin\u0101tnisko vidi. Lielo datu anal\u012bze uz\u0146\u0113mum\u0101 Odnoklassniki bija vi\u0146am unik\u0101la iesp\u0113ja apvienot teor\u0113tisko sagatavot\u012bbu un zin\u0101tnisko pamatu ar re\u0101lu, piepras\u012btu produktu izstr\u0101di.<\/p>\n<p><\/p>\n<p>Sadal\u012bt\u0101 grafu anal\u012bze joproj\u0101m ir sare\u017e\u0123\u012bts uzdevums: kad ir nepiecie\u0161ams ieg\u016bt inform\u0101ciju par tuv\u0101 kaimi\u0146a sait\u0113m, datus bie\u017ei n\u0101kas p\u0101rs\u016bt\u012bt starp ma\u0161\u012bn\u0101m, kas palielina izpildes laiku un slodzi uz t\u012bkla infrastrukt\u016bru. \u0160aj\u0101 zi\u0146ojum\u0101 m\u0113s redz\u0113sim, k\u0101 var ieg\u016bt noz\u012bm\u012bgu apstr\u0101des pa\u0101trin\u0101jumu, izmantojot probabilistisk\u0101s datu strukt\u016bras vai faktus, piem\u0113ram, soci\u0101lo t\u012bklu draudz\u012bbas grafu simetriju. Viss tas tiek ilustr\u0113ts ar kodu piem\u0113riem, izmantojot Apache Spark.<\/p>\n<p><\/p>\n<h3 id=\"denis-ryscov--reduce-your-storage-costs-with-transient-replication-and-cheap-quorumshttpshydraconfru2019talks5e3yibth8vha0jbyoywpm6utm_sourcehabrutm_medium453832\">Deniss R\u0131scovs \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/5e3yibth8vha0jbyoywpm6\/?utm_source=habr&amp;utm_medium=453832\">Samaziniet uzglab\u0101\u0161anas izmaksas ar pagaidu replik\u0101ciju un l\u0113tiem kvorumiem<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/700bfb1a35280932f654a9c34413e2d4.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Deniss \u2014 izstr\u0101d\u0101t\u0101js <noindex><a rel=\"nofollow\" href=\"https:\/\/en.wikipedia.org\/wiki\/Cosmos_DB\">Cosmos DB<\/a><\/noindex>, eksperts mode\u013cu konsekven\u010du p\u0101rbaud\u0113, konsensa algoritmos un izklied\u0113taj\u0101s dar\u012bjumu sist\u0113m\u0101s. \u0160obr\u012bd vi\u0146\u0161 str\u0101d\u0101 Microsoft, bet pirms tam darboj\u0101s izklied\u0113taj\u0101s sist\u0113m\u0101s Amazon un Yandex.<\/p>\n<p><\/p>\n<p>\u0160aj\u0101 refer\u0101t\u0101 m\u0113s iepaz\u012bsimies ar p\u0113d\u0113jo gadu laik\u0101 izstr\u0101d\u0101tajiem izklied\u0113to dar\u012bjumu protokoliem, kurus iesp\u0113jams realiz\u0113t klienta pus\u0113 virs jebkura datu kr\u0101tuves, kas atbalsta nosac\u012bjuma atjaunin\u0101\u0161anu (compare and set). Jaut\u0101jums ir t\u0101ds, ka dz\u012bve nebeidzas ar divf\u0101\u017eu apstiprin\u0101\u0161anu; dar\u012bjumus var pievienot virs jebkur\u0101m datu b\u0101z\u0113m \u2014 lietojumprogrammas l\u012bmen\u012b, ta\u010du da\u017e\u0101diem protokoliem (2PC, Percolator, RAMP) ir da\u017e\u0101di kompromisi un to ieg\u016b\u0161ana nav bezmaksas.<\/p>\n<p><\/p>\n<h3 id=\"aleksey-zinovev--ne-vse-ml-algoritmy-popadayut-v-raspredelennyy-rayhttpshydraconfru2019talks3jd0bgsoa0qtcijgblidjsutm_sourcehabrutm_medium453832\">Alexejs Zinovjevs \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/3jd0bgsoa0qtcijgblidjs\/?utm_source=habr&amp;utm_medium=453832\">Ne visi ML algoritmi non\u0101k izklied\u0113taj\u0101 parad\u012bz\u0113<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/eb412d59dec5dcc4a04f603b32d12575.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Alexejs (<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/users\/zaleslaw\/\" class=\"user_link\">zaleslaw<\/a><\/noindex>) \u2014 m\u016bsu ilgtermi\u0146a run\u0101t\u0101js un programmas komiteju locek\u013ci cit\u0101s konferenc\u0113s. Prakses treneris uz\u0146\u0113mum\u0101 EPAM Systems un ar Hadoop\/Spark un citu lielo datu tehnolo\u0123ij\u0101m draudz\u0113jas kop\u0161 2012. gada.<\/p>\n<p><\/p>\n<p>\u0160aj\u0101 refer\u0101t\u0101 Alexejs run\u0101s par klasisko ma\u0161\u012bnm\u0101c\u012b\u0161an\u0101s algoritmu piel\u0101go\u0161anas probl\u0113m\u0101m izklied\u0113t\u0101 re\u017e\u012bm\u0101, balstoties uz savu pieredzi darb\u0101 ar Apache Spark ML, Apache Mahout, Apache Flink ML un pieredzi Apache Ignite ML izstr\u0101d\u0113. T\u0101pat Alexejs run\u0101s par izklied\u0113to ML algoritmu realiz\u0101ciju \u0161ajos ietvaros.<\/p>\n<p><\/p>\n<p>Un nosl\u0113gum\u0101 \u2014 divi refer\u0101ti no uz\u0146\u0113muma Yandex par Yandex Database.<\/p>\n<p><\/p>\n<h3 id=\"vladislav-kuznecov--yandex-database--kak-my-obespechivaem-otkazoustoychivosthttpshydraconfru2019talksmuxomfgqembsb3st7i3ciutm_sourcehabrutm_medium453832\">Vladislavs Kuz\u0146ecovs \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/muxomfgqembsb3st7i3ci\/?utm_source=habr&amp;utm_medium=453832\">Yandex Database \u2014 k\u0101 m\u0113s nodro\u0161in\u0101m uztic\u012bbu<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/3bdb3bec0ec0eb71db373e85afad6260.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Vladislavs ir izstr\u0101d\u0101t\u0101js Yandex izklied\u0113t\u0101s platformas grup\u0101. Yandex Database \u2014 horizont\u0101li m\u0113rogojama \u0123eogr\u0101fiski izklied\u0113ta uzticama DBMS, kas sp\u0113j iztur\u0113t disku, serveru, skapju un datu centru atteices bez konsekvences p\u0101rtrauk\u0161anas. Lai nodro\u0161in\u0101tu uztic\u012bbu, tiek izmantots pa\u0161a izstr\u0101d\u0101ts izklied\u0113t\u0101 konsensa sasnieg\u0161anas algoritms, k\u0101 ar\u012b virkni tehnisku risin\u0101jumu, kas detaliz\u0113ti apspriesti refer\u0101t\u0101. Refer\u0101ts var b\u016bt interesants gan DBMS izstr\u0101d\u0101t\u0101jiem, gan att\u012bst\u012bt\u0101jiem, kas str\u0101d\u0101 ar DBMS risin\u0101jumiem.<br clear=\"all\">\n<\/p>\n<p><\/p>\n<h3 id=\"semen-checherinda--raspredelennye-tranzakcii-v-ydbhttpshydraconfru2019talks3ubxfwi4ikpxdjcdqswjihutm_sourcehabrutm_medium453832\">Semen \u010ce\u010derinda \u2014 <noindex><a rel=\"nofollow\" href=\"https:\/\/hydraconf.ru\/2019\/talks\/3ubxfwi4ikpxdjcdqswjih\/?utm_source=habr&amp;utm_medium=453832\">Izklied\u0113tie dar\u012bjumi YDB<\/a><\/noindex><\/h3>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"19 hydras galvas. Liels programmas apskats\" src=\"\/wp-content\/uploads\/2019\/06\/0cf2b40fcabfba1a774f00c9f245b8f1.jpeg\" style=\"display:block;margin: 0 auto;\" \/> Semen ir izstr\u0101d\u0101t\u0101js Yandex izklied\u0113t\u0101s platformas grup\u0101, str\u0101d\u0101jot pie iesp\u0113jas vair\u0101ku nomnieku izmanto\u0161anai YDB instal\u0101cij\u0101.<\/p>\n<p><\/p>\n<p>Yandex Database ir paredz\u0113ta OLTP vaic\u0101jumiem un atbilst ACID pras\u012bb\u0101m dar\u012bjumu sist\u0113mai. \u0160aj\u0101 zi\u0146ojum\u0101 apl\u016bkosim dar\u012bjumu pl\u0101no\u0161anas algoritmu, kas ir YDB dar\u012bjumu sist\u0113mas pamat\u0101. Izp\u0113t\u012bsim, k\u0101di objekti piedal\u0101s dar\u012bjumos, kur\u0161 pie\u0161\u0137ir dar\u012bjumiem glob\u0101lo sec\u012bbu, k\u0101 tiek nodro\u0161in\u0101ta dar\u012bjumu atomarit\u0101te, uzticam\u012bba un stingrs izol\u0101cijas l\u012bmenis. Piem\u0113r\u0101 ar izplat\u012btu uzdevumu apskat\u012bsim dar\u012bjumu \u012bstenojumus ar divf\u0101\u017eu komit\u0113\u0161anu un deterministiskajiem dar\u012bjumiem. Apspried\u012bsim to at\u0161\u0137ir\u012bbas.<\/p>\n<p><\/p>\n<h2 id=\"chto-dalshe\">Kas t\u0101l\u0101k?<\/h2>\n<p><\/p>\n<p>Konferences programma turpina papildin\u0101ties ar jaun\u0101m prezent\u0101cij\u0101m. Proti, m\u0113s gaid\u0101m zi\u0146ojumu no <strong>Nikitas Kovala<\/strong> (<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/users\/ndkoval\/\" class=\"user_link\">ndkoval<\/a><\/noindex>) no JetBrains un <strong>Olega Anastasjeva<\/strong> (<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/users\/m0nstermind\/\" class=\"user_link\">ltalal<\/a><\/noindex>) no komp\u0101nijas Odnoklassniki. Nikita nodarbojas ar algoritmiem korutin\u0101m Kotlin komand\u0101, bet Oleg izstr\u0101d\u0101 arhitekt\u016bru un risin\u0101jumus augstas slodzes sist\u0113m\u0101m uz\u0146\u0113muma Odnoklassniki platform\u0101. Turkl\u0101t ir v\u0113l 1 nosac\u012bti br\u012bvs slots, ar kandid\u0101tiem, ar kuriem pa\u0161reiz str\u0101d\u0101 programmas komiteja.<\/p>\n<p><\/p>\n<p>Konference Hydra notiks 11.-12. j\u016blij\u0101 Sanktp\u0113terburg\u0101. Bi\u013cetes var <noindex>ieg\u0101d\u0101ties ofici\u0101laj\u0101 m\u0101jaslap\u0101<\/noindex>. V\u0113r\u0161am uzman\u012bbu uz Online bi\u013cet\u0113m \u2014 ja j\u016bs kaut k\u0101d\u0101 veid\u0101 nevarat kl\u0101tien\u0113 doties uz P\u0113terburgu \u0161aj\u0101s dien\u0101s.<\/p>\n<p><\/p>\n<p>Tiksimies Hydra!<\/p>\n<p>Avots: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/jugru\/blog\/453832\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>11-12 \u0438\u044e\u043b\u044f \u0432 \u0421\u0430\u043d\u043a\u0442-\u041f\u0435\u0442\u0435\u0440\u0431\u0443\u0440\u0433\u0435 \u0441\u043e\u0441\u0442\u043e\u0438\u0442\u0441\u044f \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f Hydra, \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u043d\u0430\u044f \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u043a\u0435 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u0438 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c. \u0424\u0438\u0448\u043a\u0430 \u0413\u0438\u0434\u0440\u044b \u0432 \u0442\u043e\u043c, \u0447\u0442\u043e \u043e\u043d\u0430 \u043e\u0431\u044a\u0435\u0434\u0438\u043d\u044f\u0435\u0442 \u043a\u0440\u0443\u0442\u044b\u0445 \u0443\u0447\u0451\u043d\u044b\u0445 (\u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u043e\u0431\u044b\u0447\u043d\u043e \u043c\u043e\u0436\u043d\u043e \u043d\u0430\u0439\u0442\u0438 \u0442\u043e\u043b\u044c\u043a\u043e \u043d\u0430 \u0437\u0430\u0440\u0443\u0431\u0435\u0436\u043d\u044b\u0445 \u043d\u0430\u0443\u0447\u043d\u044b\u0445 \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f\u0445) \u0438 \u0438\u0437\u0432\u0435\u0441\u0442\u043d\u044b\u0445 \u043f\u0440\u0430\u043a\u0442\u0438\u043a\u0443\u044e\u0449\u0438\u0445 \u0438\u043d\u0436\u0435\u043d\u0435\u0440\u043e\u0432, \u0432 \u043e\u0434\u043d\u0443 \u0431\u043e\u043b\u044c\u0448\u0443\u044e \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u0443 \u043d\u0430 \u0441\u0442\u044b\u043a\u0435 \u043d\u0430\u0443\u043a\u0438 \u0438 \u043f\u0440\u0430\u043a\u0442\u0438\u043a\u0438. Hydra \u2014 \u043e\u0434\u043d\u0430 \u0438\u0437 \u0441\u0430\u043c\u044b\u0445 \u0432\u0430\u0436\u043d\u044b\u0445 \u043d\u0430\u0448\u0438\u0445 \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u0439 \u0437\u0430 \u043f\u043e\u0441\u043b\u0435\u0434\u043d\u0438\u0435 \u043d\u0435\u0441\u043a\u043e\u043b\u044c\u043a\u043e [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":26388,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-35091","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.5.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"11-12 \u0438\u044e\u043b\u044f \u0432 \u0421\u0430\u043d\u043a\u0442-\u041f\u0435\u0442\u0435\u0440\u0431\u0443\u0440\u0433\u0435 \u0441\u043e\u0441\u0442\u043e\u0438\u0442\u0441\u044f \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f Hydra, \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u043d\u0430\u044f \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u043a\u0435 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u0438 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u044b\u0445.\" \/>\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\/lv\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.5.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"lv_LV\" \/>\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\udd4719 \u0433\u043e\u043b\u043e\u0432 \u0433\u0438\u0434\u0440\u044b. \u0411\u043e\u043b\u044c\u0448\u043e\u0439 \u043e\u0431\u0437\u043e\u0440 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u044b | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"11-12 \u0438\u044e\u043b\u044f \u0432 \u0421\u0430\u043d\u043a\u0442-\u041f\u0435\u0442\u0435\u0440\u0431\u0443\u0440\u0433\u0435 \u0441\u043e\u0441\u0442\u043e\u0438\u0442\u0441\u044f \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f Hydra, \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u043d\u0430\u044f \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u043a\u0435 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u0438 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u044b\u0445.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy\" \/>\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-31T19:02:18+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T19:02:18+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\udd4719 hydr\u0101m galvas. Liels programmas apskats | ProHoster","description":"11.-12. j\u016blij\u0101 Sanktp\u0113terburg\u0101 notiks konference Hydra, kas velt\u012bta paral\u0113lo un izplat\u012bto sist\u0113mu izstr\u0101dei.","canonical_url":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"lv_LV","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\udd4719 \u0433\u043e\u043b\u043e\u0432 \u0433\u0438\u0434\u0440\u044b. \u0411\u043e\u043b\u044c\u0448\u043e\u0439 \u043e\u0431\u0437\u043e\u0440 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u044b | ProHoster","og:description":"11-12 \u0438\u044e\u043b\u044f \u0432 \u0421\u0430\u043d\u043a\u0442-\u041f\u0435\u0442\u0435\u0440\u0431\u0443\u0440\u0433\u0435 \u0441\u043e\u0441\u0442\u043e\u0438\u0442\u0441\u044f \u043a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f Hydra, \u043f\u043e\u0441\u0432\u044f\u0449\u0435\u043d\u043d\u0430\u044f \u0440\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u043a\u0435 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u0438 \u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u043d\u044b\u0445.","og:url":"https:\/\/prohoster.info\/lv\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy","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:02:18+00:00","article:modified_time":"2019-10-31T19:02:18+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"35091","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-21 21:48:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 02:10:27","updated":"2026-01-21 21:48:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts\/35091","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/comments?post=35091"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/posts\/35091\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/media\/26388"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/media?parent=35091"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/categories?post=35091"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/lv\/wp-json\/wp\/v2\/tags?post=35091"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}