{"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":"Themeluesit e teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara n\u00eb prangat e hidr\u00ebs","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"ThemeluesitKjo Lesli Lamport<\/strong> \u2014 autor i punimeve themelore n\u00eb llogarit\u00eb e shp\u00ebrndara, ndoshta e njihni edhe nga shkronjat La n\u00eb fjal\u00ebn La<\/b>TeX \u2014 \u00abLamport TeX\u00bb. Ai ishte ai q\u00eb e futi p\u00ebr her\u00eb t\u00eb par\u00eb, n\u00eb vitin 1979, konceptin konsistenc\u00ebs s\u00eb rregullt<\/a><\/noindex>, dhe artikulli i tij \u00abSi t\u00eb Nd\u00ebrtojm\u00eb nj\u00eb Kompjuter t\u00eb Shum\u00ebpro\u00e7esor q\u00eb Ekzekuton Sakt\u00ebsisht Programet e Shum\u00ebpro\u00e7esor\u00bb<\/a><\/noindex> ka marr\u00eb \u00e7mimin Dijkstra (n\u00eb fakt, n\u00eb vitin 2000 \u00e7mimi quhej ndryshe: \u00abPODC Influential Paper Award\u00bb). Ka m\u00eb shum\u00eb rreth tij artikulli n\u00eb Wikipedia<\/a><\/noindex>, ku mund t\u00eb gjenni disa lidhje t\u00eb tjera interesante. N\u00ebse jeni t\u00eb entuziazmuar nga zgjidhja e problemeve n\u00eb happens-before ose problemet e gjeneral\u00ebve bizantin\u00eb<\/a><\/noindex> (BFT), duhet t\u00eb keni parasysh se pas gjith\u00eb k\u00ebsaj q\u00ebndron Lamport.
\n<\/p>\n

<\/p>\n

Dhe po ashtu, ai 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 drejtim.<\/p>\n

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

Hydra 2019<\/h1>\n

<\/p>\n

Temat si multithreading jan\u00eb nj\u00eb nga m\u00eb t\u00eb njohurat n\u00eb konferencat tona, gjithmon\u00eb ka qen\u00eb k\u00ebshtu. Pak m\u00eb par\u00eb, ky sall\u00eb ishte bosh, por ja, n\u00eb sken\u00eb del nj\u00eb person q\u00eb flet p\u00ebr modelin e memories, happens-before ose grumbullimin e tejzgjatur t\u00eb mbeturinave dhe \u2014 bum! \u2014 tashm\u00eb deri n\u00eb nj\u00eb mij\u00eb njer\u00ebz mbushin \u00e7do hap\u00ebsir\u00eb t\u00eb disponueshme p\u00ebr t\u00eb ulur dhe d\u00ebgjuar me v\u00ebmendje. \u00c7far\u00eb e b\u00ebn k\u00ebt\u00eb sukses? Ndoshta, sepse ne t\u00eb gjith\u00eb kemi ndonj\u00eb hardware q\u00eb mund t\u00eb organizoj\u00eb llogarit\u00eb e shp\u00ebrndara? Apo sepse n\u00eb m\u00ebnyr\u00eb t\u00eb pavet\u00ebdijshme e kuptojm\u00eb pamund\u00ebsin\u00eb ton\u00eb p\u00ebr ta shfryt\u00ebzuar si\u00e7 duhet? Ka nj\u00eb histori t\u00eb v\u00ebrtet\u00eb nga nj\u00eb kvant nga Sh\u00ebn Peterburgu (pra, nj\u00eb analist dhe zhvillues kuantitativ financiar), i cili kishte n\u00eb duar nj\u00eb klaster llogarit\u00ebs, fuqin\u00eb e plot\u00eb t\u00eb cilit mund ta p\u00ebrdorte vet\u00ebm ai. \u00c7far\u00eb do t\u00eb b\u00ebnit ju, po t\u00eb kishit p\u00ebr t\u00eb realizuar detyrat tuaja fuqin\u00eb shum\u00eb m\u00eb t\u00eb madhe se tani?<\/p>\n

<\/p>\n

Fal\u00eb k\u00ebsaj popullariteti, tema e performanc\u00ebs dhe llogaritjeve efikase ka tendenc\u00ebn t\u00eb p\u00ebrfshihet n\u00eb programet e konferencave. Sa nga dy dit\u00ebt e diskutimeve mund t\u00eb b\u00ebhen p\u00ebr performanc\u00ebn \u2014 nj\u00eb e tret\u00eb, dy t\u00eb tretat? N\u00eb disa vende ka kufizime artificiale q\u00eb kufizojn\u00eb k\u00ebt\u00eb rritje: p\u00ebrve\u00e7 performanc\u00ebs gjithmon\u00eb duhet t\u00eb mbetet hap\u00ebsir\u00eb p\u00ebr framework-e t\u00eb reja web, p\u00ebr ndonj\u00eb devops apo astronautik\u00eb arkitekturore. Jo, performanca, nuk do t\u00eb na hani t\u00eb gjith\u00ebve n\u00eb nj\u00eb her\u00eb!<\/p>\n

<\/p>\n

Po ashtu, mund t\u00eb shkojm\u00eb n\u00eb rrug\u00ebn e kund\u00ebrt, t\u00eb dor\u00ebzohemi dhe t\u00eb organizojm\u00eb n\u00eb m\u00ebnyr\u00eb t\u00eb ndershme nj\u00eb konferenc\u00eb q\u00eb do t\u00eb jet\u00eb krejt\u00ebsisht p\u00ebr llogarit\u00eb e shp\u00ebrndara dhe vet\u00ebm p\u00ebr to. Dhe ja, Hydra.<\/p>\n

<\/p>\n

Le t\u00eb pranojm\u00eb sinqerisht, q\u00eb deri m\u00eb sot t\u00eb gjitha llogarit\u00eb n\u00eb m\u00ebnyr\u00eb t\u00eb ndonj\u00eb forme jan\u00eb t\u00eb shp\u00ebrndara. Qoft\u00eb makina me shum\u00eb b\u00ebrthama, klaster llogaritar apo sh\u00ebrbim i shp\u00ebrndar\u00eb n\u00eb shkall\u00eb t\u00eb gjer\u00eb \u2014 p\u00ebr \u00e7do vend ka shum\u00eb procese q\u00eb kryejn\u00eb llogaritje t\u00eb pavarura n\u00eb m\u00ebnyr\u00eb paralele, duke u sinkronizuar me nj\u00ebri-tjetrin. Si \u00ebsht\u00eb kjo e strukturuar n\u00eb teori dhe si funksionon n\u00eb praktik\u00eb, kjo do t\u00eb jet\u00eb tema e Hydra.<\/p>\n

<\/p>\n

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

<\/p>\n

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

<\/p>\n

P\u00ebr shembull, \u00ebsht\u00eb tashm\u00eb e njohur pjes\u00ebmarrja e Leslie Lamport nga Microsoft Research dhe Maurice Herlihy nga University of Brown. <\/p>\n

<\/p>\n

\"Themeluesit Maurice Herlihy<\/strong> \u2014 profesor i njohur dhe i respektuar n\u00eb Shkenc\u00ebn e Kompjuterve, p\u00ebr t\u00eb cilin gjithashtu ka nj\u00eb faqe n\u00eb Wikipedia<\/a><\/noindex>, ku mund t\u00eb kaloni n\u00ebp\u00ebr lidhjet dhe punimet. Atje mund t\u00eb vini re dy \u00e7mime Dijkstra, i pari \u2014 p\u00ebr pun\u00ebn mbi \u00abSinchronizimi Pa Prerje\u00bb<\/a><\/noindex>, dhe i dyti, m\u00eb i ri \u2014 \u00abMemoria Transaksionale: Mb\u00ebshtetje Arkitekturore p\u00ebr Struktura TData pa Bllokim\u00bb<\/a><\/noindex>. P\u00ebrve\u00e7 k\u00ebsaj, lidhjet \u00e7ojn\u00eb madje jo n\u00eb SciHub, por n\u00eb Universitetin e Brown dhe Universitetin e Virginia Tech, mund t'i hapni dhe t'i lexoni.
\n<\/p>\n

<\/p>\n

Maurice planifikon t\u00eb mbaj\u00eb nj\u00eb diskutim kryesor me titull \u00abBlockchains from a distributed computing perspective\u00bb. N\u00ebse jeni t\u00eb interesuar, mund t\u00eb shihni regjistrimin e diskutimit t\u00eb Maurice nga JUG n\u00eb Sh\u00ebn Petersburg. Vler\u00ebsojeni se sa qart\u00eb dhe mir\u00eb e transmeton tem\u00ebn.<\/p>\n

\n

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

\"ThemeluesitDiskutimi i dyt\u00eb kryesor me titull \u00abStruktura t\u00eb Dh\u00ebnash Duale\u00bb do t\u00eb mbahen nga Majkl Skoti<\/strong> nga Universiteti i Rochester. Dhe t\u00eb merrni mend, ai ka gjithashtu nj\u00eb faqe n\u00eb Wikipedia<\/a><\/noindex>. N\u00eb shkoll\u00ebn e tij n\u00eb Wisconsin ai \u00ebsht\u00eb i njohur p\u00ebr pun\u00ebn si dekan n\u00eb Universitetin Wisconsin-Madison, dhe n\u00eb bot\u00eb \u2014 si ai njeri q\u00eb s\u00eb bashku me Doug Lea zhvilloi k\u00ebto algoritme t\u00eb mos-bllokimit dhe queues sinkronike, mbi t\u00eb cilat punojn\u00eb bibliotekat Java. Ai e mori \u00e7mimin Dijkstra tre vjet pas Herlihy, p\u00ebr pun\u00ebn \u00abAlgorithms for scalable synchronization on shared-memory multiprocessors\u00bb (si zakonisht, ai \u00ebsht\u00eb n\u00eb dispozicion publik<\/a><\/noindex> n\u00eb bibliotek\u00ebn online t\u00eb Universitetit t\u00eb Rochester).
\n<\/p>\n

<\/p>\n

Ka ende shum\u00eb koh\u00eb deri n\u00eb mes t\u00eb korrikut. Ne do t\u00eb flasim p\u00ebr t\u00eb tjer\u00ebt fol\u00ebsit dhe temat e tyre nd\u00ebrsa po qart\u00ebsojm\u00eb programin dhe po afrohemi n\u00eb korrik. <\/p>\n

<\/p>\n

N\u00eb p\u00ebrgjith\u00ebsi, lind pyetja \u2014 pse e b\u00ebjm\u00eb Hydr\u00ebn n\u00eb ver\u00eb? Sepse \u00ebsht\u00eb sezon i vdekur, pushime. Problemi \u00ebsht\u00eb se midis fol\u00ebsve ka m\u00ebsues universiteti, dhe \u00e7do koh\u00eb tjet\u00ebr \u00ebsht\u00eb e z\u00ebn\u00eb p\u00ebr ta. Ne thjesht nuk mund t\u00eb zgjidhnim data t\u00eb tjera.<\/p>\n

<\/p>\n

Zona diskutimi<\/h1>\n

<\/p>\n

N\u00eb konferenca t\u00eb tjera ndodhin raste kur fol\u00ebsi mbaron me at\u00eb q\u00eb duhet dhe largohesh menj\u00ebher\u00eb. Pjes\u00ebmarr\u00ebsit as q\u00eb kan\u00eb koh\u00eb ta gjejn\u00eb - sepse direkt pas tij fillon prezantimi tjet\u00ebr. Kjo \u00ebsht\u00eb shum\u00eb e dhimbshme, sidomos kur jan\u00eb t\u00eb pranish\u00ebm njer\u00ebz kaq t\u00eb r\u00ebnd\u00ebsish\u00ebm si Lamport, Herlihy dhe Scott, dhe n\u00eb t\u00eb v\u00ebrtet\u00eb po shkon n\u00eb konferenc\u00eb vet\u00ebm p\u00ebr t'u takuar me ta dhe p\u00ebr t\u00eb biseduar p\u00ebr ndonj\u00eb \u00e7\u00ebshtje. <\/p>\n

<\/p>\n

Kjo problematik\u00eb \u00ebsht\u00eb zgjidhur nga ne. Menj\u00ebher\u00eb pas fjalimit t\u00eb tij, fol\u00ebsi shkon n\u00eb nj\u00eb zon\u00eb diskutimi t\u00eb ve\u00e7ant\u00eb, e pajisur t\u00eb pakt\u00ebn me nj\u00eb tabel\u00eb me marker, dhe ju keni nj\u00eb periudh\u00eb t\u00eb madhe kohe. Formalisht, fol\u00ebsi premton t\u00eb jet\u00eb aty t\u00eb pakt\u00ebn gjat\u00eb gjith\u00eb koh\u00ebs s\u00eb pushimit nd\u00ebrmjet prezantimeve. N\u00eb realitet, k\u00ebto zona diskutimi mund<\/em> mund t\u00eb zgjasin p\u00ebr or\u00eb t\u00eb t\u00ebra (varet nga d\u00ebshira dhe durimi i fol\u00ebsit). <\/p>\n

<\/p>\n

Sa i p\u00ebrket Lamportit, n\u00ebse e kuptoj sakt\u00eb, ai d\u00ebshiron t\u00eb bind\u00eb sa m\u00eb shum\u00eb njer\u00ebz q\u00eb TLA+<\/a><\/noindex> \u2013 kjo \u00ebsht\u00eb nj\u00eb gj\u00eb e mir\u00eb. (Artikulli mbi TLA+ n\u00eb Wikipedia<\/a><\/noindex>). Ndoshta, ky do t\u00eb jet\u00eb nj\u00eb shans i shk\u00eblqyer p\u00ebr inxhinier\u00ebt p\u00ebr t\u00eb m\u00ebsuar di\u00e7ka t\u00eb re dhe t\u00eb dobishme. Leslie ofron nj\u00eb variant t\u00eb till\u00eb - ata q\u00eb jan\u00eb t\u00eb interesuar, mund t\u00eb shikojn\u00eb leksionet e tij t\u00eb kaluara dhe t\u00eb vijn\u00eb me pyetje. K\u00ebshtu q\u00eb n\u00eb vend t\u00eb nj\u00eb keynoti, mund t\u00eb ket\u00eb nj\u00eb sesion t\u00eb specializuar pyetje-p\u00ebrgjigje, dhe m\u00eb pas edhe nj\u00eb zon\u00eb diskutimi. Un\u00eb e kam k\u00ebrkuar pak dhe kam gjetur nj\u00eb p\u00ebr TLA+<\/a><\/noindex> (n\u00eb m\u00ebnyr\u00eb zyrtare t\u00eb dyfishuar me nj\u00eb playliste n\u00eb YouTube<\/a><\/noindex>) dhe nj\u00eb leksion nj\u00ebor\u00ebsh \u00abThinking Above the Code\u00bb<\/a><\/noindex> nga Microsoft Faculty Summit.<\/p>\n

<\/p>\n

N\u00ebse i keni perceptuar k\u00ebta njer\u00ebz si emra t\u00eb hekuros n\u00eb granit nga Wikipedia dhe n\u00eb kopertinat e librave - \u00ebsht\u00eb koha t\u2019i takoni ata n\u00eb jet\u00eb! T\u00eb bisedoni dhe t\u00eb b\u00ebni pyetje, p\u00ebr t\u00eb cilat nuk do t\u00eb merrni p\u00ebrgjigje n\u00eb faqet e artikujve shkencor\u00eb, por autor\u00ebt e tyre do t\u00eb jen\u00eb t\u00eb gatsh\u00ebm t\u00eb lidhen.<\/p>\n

<\/p>\n

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

<\/p>\n

Nuk \u00ebsht\u00eb sekret se shum\u00eb nga ata q\u00eb po e lexojn\u00eb k\u00ebt\u00eb artikull, vet\u00eb d\u00ebshirojn\u00eb t\u00eb flasin p\u00ebr di\u00e7ka mjaft interesante. Nga pik\u00ebpamja inxhinierike, nga ajo shkencore - nga \u00e7do drejtim. Kompjuterat e shp\u00ebrndar\u00eb - jan\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 prezantosh af\u00ebr Lamportit, kjo \u00ebsht\u00eb krejt e mundur. P\u00ebr t\u00eb qen\u00eb fol\u00ebs, duhet shkoni n\u00eb lidhje<\/a><\/noindex><\/strong>, ta lexoni me kujdes dhe t\u00eb veproni sipas udh\u00ebzimeve. <\/p>\n

<\/p>\n

Mos u shqet\u00ebsoni, pasi t\u00eb lidheni me procesin, do t'ju ndihmojn\u00eb. Komiteti i programit ka mund\u00ebsi t\u00eb mjaftueshme p\u00ebr t\u00eb ndihmuar me fjalimin vet\u00eb, me p\u00ebrmbajtjen dhe dizajnin e tij. Koordinatori do t'ju ndihmoj\u00eb t\u00eb zgjidhni \u00e7\u00ebshtjet organizative e k\u00ebshtu me radh\u00eb. <\/p>\n

<\/p>\n

Kthejeni v\u00ebmendjen te imazhi me datat. Korriku \u00ebsht\u00eb nj\u00eb dat\u00eb mjaft e larg\u00ebt p\u00ebr pjes\u00ebmarr\u00ebsin, nd\u00ebrsa fol\u00ebsi duhet t\u00eb filloj\u00eb t\u00eb veproj\u00eb q\u00eb tani. <\/p>\n

<\/p>\n

\"Themeluesit<\/p>\n

<\/p>\n

Shkolla SPTDC<\/h1>\n

<\/p>\n

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

<\/p>\n

Shkolla Verore mbi Praktik\u00ebn dhe Teorin\u00eb e Kompjuterave t\u00eb Shp\u00ebrndar\u00eb (SPTDC)<\/a><\/noindex> \u00ebsht\u00eb 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 udh\u00ebhequra nga specialist\u00eb t\u00eb njohur n\u00eb fush\u00ebn p\u00ebrkat\u00ebse.<\/p>\n

<\/p>\n

Shkolla do t\u00eb zhvillohet n\u00eb anglisht, k\u00ebshtu q\u00eb ky \u00ebsht\u00eb lista e temave q\u00eb do t\u00eb shqyrtohen:<\/p>\n

<\/p>\n