{"id":34759,"date":"2019-10-31T22:00:14","date_gmt":"2019-10-31T19:00:14","guid":{"rendered":"https:\/\/prohoster.info\/blog\/osnovopolozhniki-teorii-raspredelennyh-sistem-v-obyatyah-gidry\/"},"modified":"2019-10-31T22:00:14","modified_gmt":"2019-10-31T19:00:14","slug":"osnovopolozhniki-teorii-raspredelennyh-sistem-v-obyatyah-gidry","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sq\/blog\/administrirovanie\/osnovopolozhniki-teorii-raspredelennyh-sistem-v-obyatyah-gidry","title":{"rendered":"T\u00eb themeluesit e teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara n\u00eb duar t\u00eb hidr\u00ebs","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"T\u00ebKy Lesli Lamport<\/strong> \u2014 autor i punimeve themelore n\u00eb llogarit\u00eb e shp\u00ebrndara, dhe ju ndoshta e njihni at\u00eb nga shkronjat La n\u00eb fjal\u00ebn La<\/b>TeX \u2014 \"Lamport TeX\". Ai e prezantoi p\u00ebr her\u00eb t\u00eb par\u00eb, q\u00eb n\u00eb vitin 1979, konceptin e koherenc\u00ebs sekuenciale<\/a><\/noindex>, dhe artikulli i tij \"Si t\u00eb b\u00ebni nj\u00eb kompjuter shum\u00ebpro\u00e7esor q\u00eb ekzekuton sakt\u00ebsisht programet shum\u00ebpro\u00e7esor\"<\/a><\/noindex> mori \u00e7mimin Dijkstra (m\u00eb sakt\u00eb, n\u00eb vitin 2000 \u00e7mimi quhej ndryshe: \"PODC Influential Paper Award\"). Ka nj\u00eb artikull p\u00ebr t\u00eb n\u00eb Wikipedia<\/a><\/noindex>, ku mund t\u00eb gjeni disa lidhje t\u00eb tjera interesante. N\u00ebse jeni t\u00eb fascinuar nga zgjidhjet e problemeve si happens-before ose problemet e gjeneral\u00ebve bizantin\u00eb<\/a><\/noindex> (BFT), at\u00ebher\u00eb duhet t\u00eb kuptoni se pas gjith\u00eb k\u00ebsaj q\u00ebndron Lamport.
\n<\/p>\n

<\/p>\n

Dhe gjithashtu ai s\u00eb shpejti do t\u00eb vij\u00eb n\u00eb konferenc\u00ebn ton\u00eb t\u00eb re p\u00ebr llogarit\u00eb e shp\u00ebrndara \u2014 Hydra, e cila do t\u00eb mbahet m\u00eb 11-12 korrik n\u00eb Sh\u00ebn Petersburg. Le t\u00eb shohim se \u00e7far\u00eb \u00ebsht\u00eb ky kafsh\u00eb.<\/p>\n

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

Hydra 2019<\/h1>\n

<\/p>\n

Temat si multithreading jan\u00eb disa nga m\u00eb t\u00eb njohurat n\u00eb konferencat tona, gjithmon\u00eb kan\u00eb qen\u00eb t\u00eb tilla. Sapo ishte nj\u00eb sall\u00eb e zbraz\u00ebt, por ja, n\u00eb sken\u00eb del nj\u00eb njeri q\u00eb flet p\u00ebr modelin e memories, happens-before ose grumbullimin e plehrave me shum\u00eb pro\u00e7esor\u00eb dhe \u2014 bam! \u2014 tashm\u00eb af\u00ebr nj\u00eb mij\u00eb njer\u00ebz z\u00ebn\u00eb t\u00eb gjitha vendet n\u00eb dispozicion p\u00ebr t\u00eb u ulur dhe d\u00ebgjuar me v\u00ebmendje. \u00c7far\u00eb \u00ebsht\u00eb thelbi i k\u00ebtij suksesi? Ndoshta se t\u00eb gjith\u00eb ne kemi ndonj\u00eb harduer q\u00eb \u00ebsht\u00eb i aft\u00eb t\u00eb organizoj\u00eb llogarit\u00eb e shp\u00ebrndara? Ose se n\u00eb m\u00ebnyr\u00eb t\u00eb pavet\u00ebdijshme e kuptojm\u00eb pamund\u00ebsin\u00eb ton\u00eb p\u00ebr ta ngarkuar at\u00eb si duhet? Ka nj\u00eb histori reale t\u00eb nj\u00eb kvanteri nga Sh\u00ebn Petersburg (dmth analisti financiar dhe zhvilluesi kvantitativ), q\u00eb kishte n\u00eb dispozicion nj\u00eb klaster llogarit\u00ebs, fuqin\u00eb e plot\u00eb t\u00eb t\u00eb cilit mund ta p\u00ebrdor\u00eb vet\u00ebm ai. \u00c7far\u00eb do t\u00eb b\u00ebnit, sikur t\u00eb kishit n\u00eb dispozicion mund\u00ebsi shum\u00eb m\u00eb t\u00eb m\u00ebdha p\u00ebr t\u00eb kryer detyrat tuaja?<\/p>\n

<\/p>\n

Fal\u00eb popullaritetit t\u00eb till\u00eb, tema e performanc\u00ebs dhe llogaritjeve efikase ka tendenc\u00eb t\u00eb shfaqet gjithnj\u00eb e m\u00eb shum\u00eb n\u00eb programet e konferencave. Sa nga dy dit\u00ebt e prezantimeve mund t\u00eb flasim p\u00ebr performanc\u00ebn - nj\u00eb e tret\u00eb, dy t\u00eb tretat? Ndonj\u00ebher\u00eb ka kufizime artificiale q\u00eb e ndalojn\u00eb k\u00ebt\u00eb rritje: p\u00ebrve\u00e7 performanc\u00ebs, gjithmon\u00eb duhet t\u00eb ket\u00eb hap\u00ebsir\u00eb p\u00ebr korniza t\u00eb reja web, p\u00ebr ndonj\u00eb devops ose astronautik\u00eb arkitekturore. Jo, performanc\u00eb, ti nuk do t\u00eb na p\u00ebrthith\u00ebsh t\u00eb gjith\u00ebve!<\/p>\n

<\/p>\n

Por gjithashtu mund t\u00eb ndjekim nj\u00eb rrug\u00eb t\u00eb kund\u00ebrt, t\u00eb dor\u00ebzohemi dhe t\u00eb b\u00ebjm\u00eb nj\u00eb konferenc\u00eb q\u00eb do t\u00eb jet\u00eb krejt\u00ebsisht mbi llogarit\u00eb e shp\u00ebrndara dhe vet\u00ebm mbi to. Dhe ja, Hy dra.<\/p>\n

<\/p>\n

Le t\u00eb pranojm\u00eb hapur se deri m\u00eb sot t\u00eb gjitha llogarit\u00eb n\u00eb nj\u00eb far\u00eb m\u00ebnyre jan\u00eb t\u00eb shp\u00ebrndara. Qoft\u00eb nj\u00eb makin\u00eb me shum\u00eb b\u00ebrthama, nj\u00eb klaster llogaritar apo nj\u00eb sh\u00ebrbim i madh t\u00eb shp\u00ebrndar\u00eb - kudo ka shum\u00eb procese q\u00eb kryejn\u00eb llogaritje t\u00eb pavarura paralelisht, duke u sinkronizuar me nj\u00ebra-tjetr\u00ebn. Teksa do flasim p\u00ebr m\u00ebnyr\u00ebn se si funksionon kjo n\u00eb teori dhe praktik\u00eb, do t\u2019i kushtohet Hydra.<\/p>\n

<\/p>\n

Programi i konferenc\u00ebs<\/h1>\n

<\/p>\n

Programi \u00ebsht\u00eb aktualisht n\u00eb faz\u00ebn e formimit. Ai do t\u00eb p\u00ebrfshij\u00eb prezantime nga themeluesit e teorive t\u00eb sistemeve t\u00eb shp\u00ebrndara dhe inxhinier\u00ebve q\u00eb punojn\u00eb me ta n\u00eb prodhim.<\/p>\n

<\/p>\n

P\u00ebr shembull, tashm\u00eb dihet p\u00ebr pjes\u00ebmarrjen e Leslie Lamport nga Microsoft Research dhe Morris Hirshfield nga Universiteti Brown. <\/p>\n

<\/p>\n

\"T\u00eb Morris Hirshfield<\/strong> \u00ebsht\u00eb nj\u00eb profesor shum\u00eb i njohur dhe i respektuar n\u00eb Shkencat Kompjuterike, p\u00ebr t\u00eb cilin gjithashtu ekziston nj\u00eb faqe n\u00eb Wikipedia<\/a><\/noindex>, ku mund t\u00eb shkoni p\u00ebrmes lidhjeve dhe pun\u00ebve t\u00eb tij. Atje mund t\u00eb vini re dy \u00e7mime Dijkstra, e para p\u00ebr pun\u00ebn mbi \u00abWait-Free Synchronization\u00bb<\/a><\/noindex>, dhe e dyta, m\u00eb e reja - \u00abTransactional Memory: Architectural Support for Lock-Free Data Structures\u00bb<\/a><\/noindex>. P\u00ebrve\u00e7 k\u00ebsaj, lidhjet nuk \u00e7ojn\u00eb as n\u00eb SciHub, por n\u00eb Universitetin Brown dhe Universitetin Virginia Tech, mund t\u00eb hapen dhe t\u00eb lexohen.
\n<\/p>\n

<\/p>\n

Morris do t\u00eb mbaj\u00eb nj\u00eb keynote me titull \u00abBlockchains from a distributed computing perspective\u00bb. N\u00ebse jeni t\u00eb interesuar, mund t\u00eb shihni regjistrimin e prezantimit t\u00eb Morris nga JUG n\u00eb Sh\u00ebn Petersburg. Vler\u00ebsoni se sa qart\u00eb dhe thell\u00ebsisht ai e shpjegon tem\u00ebn.<\/p>\n

\n

\r\n \"Luaj\r\n
<\/div>\r\n <\/div><\/center><\/p>\n

\"T\u00ebKeynote-i i dyt\u00eb me titull \u00abDual Data Structures\u00bb do t\u00eb jepet nga Michael Scott<\/strong> nga Universiteti i Rochester. Dhe merrni nj\u00eb tjet\u00ebr - ai gjithashtu ka nj\u00eb faqe n\u00eb Wikipedia<\/a><\/noindex>. N\u00eb Wisconsin, ai \u00ebsht\u00eb i njohur p\u00ebr pun\u00ebn e tij si dekan n\u00eb universitetin Wisconsin-Madison, dhe n\u00eb bot\u00eb \u2014 ai \u00ebsht\u00eb njeri q\u00eb, s\u00eb bashku me Doug Lea, zhvilloi ato algoritme pa bllokim dhe radh\u00ebt sinkron q\u00eb p\u00ebrdoren n\u00eb biblioteka Java. Ai mori \u00e7mimin Dijkstra tri vjet pas Hurlik, p\u00ebr pun\u00ebn \"Algoritmet p\u00ebr sinkronizimin e shkall\u00ebzuesh\u00ebm n\u00eb shum\u00ebpro\u00e7esor\u00ebt me memorie t\u00eb p\u00ebrbashk\u00ebt\" (si\u00e7 duhet, ajo q\u00ebndron hapur<\/a><\/noindex> n\u00eb bibliotek\u00ebn online t\u00eb Universitetit t\u00eb Rochester).
\n<\/p>\n

<\/p>\n

Derisa t\u00eb mesit t\u00eb korrikut ka shum\u00eb koh\u00eb. P\u00ebr fol\u00ebsit e tjer\u00eb dhe temat e tyre do t\u00eb flasim nd\u00ebrsa t\u00eb sakt\u00ebsohet programu dhe t\u00eb afrohet korriku. <\/p>\n

<\/p>\n

N\u00eb t\u00eb v\u00ebrtet\u00eb, lind pyetja \u2014 pse po e b\u00ebjm\u00eb Hidren ver\u00ebs? Sepse \u00ebsht\u00eb nj\u00eb sezon i vdekur, pushime. Problemi \u00ebsht\u00eb se mes spiker\u00ebve ka m\u00ebsues universitare, dhe \u00e7do koh\u00eb tjet\u00ebr \u00ebsht\u00eb e z\u00ebn\u00eb p\u00ebr ta. Ne thjesht nuk mund\u00ebm t\u00eb zgjedhim datat e tjera.<\/p>\n

<\/p>\n

Zonat e Diskutimit<\/h1>\n

<\/p>\n

N\u00eb Konferenca t\u00eb tjera, ndodh ndonj\u00ebher\u00eb q\u00eb fol\u00ebsi e lexon at\u00eb q\u00eb duhet dhe menj\u00ebher\u00eb largohet. Pjes\u00ebmarr\u00ebsit as q\u00eb kan\u00eb koh\u00eb ta k\u00ebrkojn\u00eb at\u00eb \u2014 sepse pothuajse pa ndales\u00eb fillon fjalimi tjet\u00ebr. Kjo \u00ebsht\u00eb shum\u00eb e dhimbshme, sidomos n\u00ebse jan\u00eb t\u00eb pranish\u00ebm njer\u00ebz t\u00eb till\u00eb t\u00eb r\u00ebnd\u00ebsish\u00ebm si Lamport, Hurlik dhe Scott, dhe ju n\u00eb fakt po shkoni n\u00eb konferenc\u00eb, vet\u00ebm p\u00ebr t\u00eb takuar dhe diskuar me ta. <\/p>\n

<\/p>\n

Ne kemi zgjidhur k\u00ebt\u00eb problem. Menj\u00ebher\u00eb pas fjalimit t\u00eb tij, fol\u00ebsi shkon n\u00eb nj\u00eb zon\u00eb t\u00eb ve\u00e7ant\u00eb diskutimi, e pajisur me t\u00eb pakt\u00ebn nj\u00eb bord me marker, dhe keni nj\u00eb rezerv\u00eb t\u00eb madhe kohe. Formalisht, fol\u00ebsi premton t\u00eb q\u00ebndroj\u00eb atje t\u00eb pakt\u00ebn gjat\u00eb gjith\u00eb koh\u00ebs s\u00eb pushimit midis fjalimeve. N\u00eb realitet, k\u00ebto zona diskutimi mund<\/em> t\u00eb zgjaten p\u00ebr or\u00eb t\u00eb t\u00ebra (varet nga d\u00ebshira dhe q\u00ebndresa e fol\u00ebsit). <\/p>\n

<\/p>\n

Sa i p\u00ebrket Lamportit, n\u00ebse e kuptova sakt\u00ebsisht, ai d\u00ebshiron t\u00eb bind\u00eb sa m\u00eb shum\u00eb njer\u00ebz q\u00eb TLA+<\/a><\/noindex> \u00ebsht\u00eb nj\u00eb gj\u00eb e mir\u00eb. (Artikulli p\u00ebr TLA+ n\u00eb Wikipedia<\/a><\/noindex>). Ndoshta, kjo do t\u00eb jet\u00eb nj\u00eb rast i mir\u00eb p\u00ebr inxhinier\u00ebt p\u00ebr t\u00eb m\u00ebsuar di\u00e7ka t\u00eb re dhe t\u00eb dobishme. Leslie sugjeron nj\u00eb variant t\u00eb till\u00eb \u2014 ata q\u00eb jan\u00eb t\u00eb interesuar mund t\u00eb shohin ligj\u00ebratat e tij t\u00eb kaluara dhe t\u00eb vijn\u00eb me pyetje. Pra, n\u00eb vend t\u00eb nj\u00eb keynote, mund t\u00eb ket\u00eb nj\u00eb lloj sesioni t\u00eb specializuar Q&A, dhe pastaj edhe nj\u00eb zon\u00eb diskutimi. Kam b\u00ebr\u00eb pak k\u00ebrkime n\u00eb Google dhe kam gjetur nj\u00eb kurs t\u00eb shk\u00eblqyer p\u00ebr TLA+<\/a><\/noindex> (zyrtarisht i dyfishuar me nj\u00eb playlist n\u00eb YouTube<\/a><\/noindex>) dhe nj\u00eb ligj\u00ebrat\u00eb nj\u00eb or\u00ebshe \"Mendimi mbi Kodin\"<\/a><\/noindex> me Microsoft Faculty Summit.<\/p>\n

<\/p>\n

N\u00ebse i keni par\u00eb t\u00eb gjith\u00eb k\u00ebta njer\u00ebz si emra t\u00eb gdhendur n\u00eb granit nga Wikipedia dhe n\u00eb kopertinat e librave \u2014 \u00ebsht\u00eb koha t\u00eb takoni ata n\u00eb jet\u00ebn reale! T\u00eb flisni dhe t\u00eb b\u00ebni pyetje, p\u00ebr t\u00eb cilat faqet e artikujve shkencor\u00eb nuk do t'ju japin p\u00ebrgjigje, por autor\u00ebt e tyre do t\u00eb jen\u00eb t\u00eb lumtur p\u00ebr t'u lidhur.<\/p>\n

<\/p>\n

Thirrje p\u00ebr Dokumente<\/h1>\n

<\/p>\n

Nuk \u00ebsht\u00eb sekret q\u00eb shum\u00eb nga ata q\u00eb po e lexojn\u00eb k\u00ebt\u00eb artikull, vet\u00eb do t\u00eb donin t\u00eb flisnin p\u00ebr di\u00e7ka mjaft interesante. Nga k\u00ebndv\u00ebshtrimi inxhinierik, shkencor \u2014 nga \u00e7do k\u00ebndv\u00ebshtrim. Komputimi i shp\u00ebrndar\u00eb \u00ebsht\u00eb nj\u00eb tem\u00eb shum\u00eb e gjer\u00eb dhe e thell\u00eb, ku ka vend p\u00ebr t\u00eb gjith\u00eb.<\/p>\n

<\/p>\n

N\u00ebse d\u00ebshiron t\u00eb flas\u00ebsh pran\u00eb Lamport, \u00ebsht\u00eb krejt\u00ebsisht e mundur. P\u00ebr t'u b\u00ebr\u00eb fol\u00ebs, duhet t\u00eb kalosh p\u00ebrmes lidhjes<\/a><\/noindex><\/strong>, t\u00eb lexosh me kujdes gjith\u00e7ka atje dhe t\u00eb veprovosh sipas udh\u00ebzimeve. <\/p>\n

<\/p>\n

Mos u b\u00ebni merak, sa her\u00eb q\u00eb t\u00eb lidhesh me procesin, do t\u00eb t\u00eb ndihmojn\u00eb. Komiteti programor ka kapacitetin e mjaftuesh\u00ebm p\u00ebr t\u00eb ndihmuar me vet\u00eb dokumentin, thelbin dhe formatin e tij. Koordinatori do t\u00eb ndihmoj\u00eb n\u00eb zgjidhjen e \u00e7\u00ebshtjeve organizative e k\u00ebshtu me radh\u00eb. <\/p>\n

<\/p>\n

K\u00ebndv\u00ebshtroni me kujdes imazhin me datat. Korriku \u00ebsht\u00eb nj\u00eb dat\u00eb mjaft e larg\u00ebt p\u00ebr nj\u00eb pjes\u00ebmarr\u00ebs, nd\u00ebrsa fol\u00ebsi duhet t\u00eb filloj\u00eb t\u00eb veproj\u00eb tani. <\/p>\n

<\/p>\n

\"T\u00eb<\/p>\n

<\/p>\n

Shkolla SPTDC<\/h1>\n

<\/p>\n

Konferenca do t\u00eb zhvillohet n\u00eb t\u00eb nj\u00ebjtin vend me shkoll\u00ebn SPTDC, k\u00ebshtu q\u00eb p\u00ebr t\u00eb gjith\u00eb ata q\u00eb blejn\u00eb bilet\u00eb p\u00ebr shkoll\u00ebn, biletat p\u00ebr konferenc\u00ebn do t\u00eb jen\u00eb me 20% zbritje<\/strong>.<\/p>\n

<\/p>\n

Shkolla Verore mbi Praktik\u00ebn dhe Teorin\u00eb e Komputimit t\u00eb Shp\u00ebrndar\u00eb (SPTDC)<\/a><\/noindex> \u2014 nj\u00eb shkoll\u00eb q\u00eb ofron nj\u00eb gam\u00eb t\u00eb gjer\u00eb kursesh mbi aspektet praktike dhe teorike t\u00eb sistemeve t\u00eb shp\u00ebrndara, t\u00eb drejtuara nga specialist\u00eb t\u00eb njohur n\u00eb fush\u00ebn p\u00ebrkat\u00ebse.<\/p>\n

<\/p>\n

Shkolla do t\u00eb mbahet n\u00eb gjuh\u00ebn angleze, k\u00ebshtu q\u00eb ky \u00ebsht\u00eb lista e temave t\u00eb diskutueshme:<\/p>\n

<\/p>\n