{"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\/sq\/blog\/administrirovanie\/19-golov-gidry-bolshoj-obzor-programmy","title":{"rendered":"19 krye t\u00eb hidr\u00ebs. Nj\u00eb p\u00ebrmbledhje e gjer\u00eb e programit","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

11-12 korrik n\u00eb Sh\u00ebn Petersburg do t\u00eb mbahet konferenca Hydra<\/a><\/noindex>, e dedikuar zhvillimit t\u00eb sistemeve paralele dhe t\u00eb shp\u00ebrndara. Karakteristika e Hydr\u00ebs \u00ebsht\u00eb se ajo bashkon shkenc\u00ebtar\u00eb t\u00eb shk\u00eblqyer (t\u00eb cil\u00ebt zakonisht mund t\u00eb gjenden vet\u00ebm n\u00eb konferenca shkencore nd\u00ebrkomb\u00ebtare) dhe inxhinier\u00eb t\u00eb njohur n\u00eb nj\u00eb program t\u00eb madh q\u00eb lidhet me shkenc\u00ebn dhe praktik\u00ebn.<\/p>\n

<\/p>\n

Hydra \u00ebsht\u00eb nj\u00eb nga konferencat m\u00eb t\u00eb r\u00ebnd\u00ebsishme t\u00eb viteve t\u00eb fundit. Ajo \u00ebsht\u00eb p\u00ebrgatitur me shum\u00eb kujdes, duke p\u00ebrzgjedhur fol\u00ebs dhe tema. Jav\u00ebn e kaluar, doli nj\u00eb intervist\u00eb n\u00eb Habr<\/a><\/noindex> me drejtorin e kompanis\u00eb JUG.ru Group, Aleksei Fedorov (23derevo<\/a><\/noindex>). <\/p>\n

<\/p>\n

Ne vazhduam t\u00eb flasim<\/a><\/noindex> p\u00ebr tre pjes\u00ebmarr\u00ebs t\u00eb r\u00ebnd\u00ebsish\u00ebm, themeluesit e teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara \u2014 Leslie Lamport, Maurice Herlihy dhe Michael Scott. \u00cbsht\u00eb koha t\u00eb flasim m\u00eb n\u00eb detaje p\u00ebr programin!<\/p>\n

<\/p>\n

\"19<\/p>\n

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

Motivimi<\/h2>\n

<\/p>\n

N\u00ebse mereni me programim, at\u00ebher\u00eb n\u00eb nj\u00eb m\u00ebnyr\u00eb ose n\u00eb nj\u00eb tjet\u00ebr p\u00ebrballeni me multithreading dhe llogaritjet e shp\u00ebrndara. Specialist\u00ebt n\u00eb fushat p\u00ebrkat\u00ebse punojn\u00eb me to drejtp\u00ebrdrejt, por shp\u00ebrndarja p\u00ebrceptohet n\u00ebnkuptimisht nga t\u00eb gjitha an\u00ebt: n\u00eb \u00e7do kompjuter me shum\u00eb b\u00ebrtham\u00eb ose sh\u00ebrbim t\u00eb shp\u00ebrndar\u00eb ka di\u00e7ka q\u00eb kryen llogaritje n\u00eb paralel.<\/p>\n

<\/p>\n

Ekzistojn\u00eb shum\u00eb konferenca q\u00eb zbulojn\u00eb aspekte t\u00eb ndryshme t\u00eb programimit aplikativ. N\u00eb an\u00ebn tjet\u00ebr t\u00eb spektrit, kemi shkolla shkencore speciale, n\u00eb format ligj\u00ebratash q\u00eb zbulojn\u00eb nj\u00eb sasi t\u00eb madhe t\u00eb teoris\u00eb komplekse. P\u00ebr shembull, paralelisht me Hydra n\u00eb Sh\u00ebn Petersburg zhvillohet shkolla SPTDC<\/a><\/noindex>. N\u00eb konferenc\u00ebn Hydra p\u00ebrpiqemi t\u00eb bashkojm\u00eb praktik\u00ebn e ashp\u00ebr, shkenc\u00ebn dhe gjith\u00e7ka q\u00eb ndodh n\u00eb kryq\u00ebzimin e tyre.<\/strong> <\/p>\n

<\/p>\n

Mendoni p\u00ebr k\u00ebt\u00eb: ne jetojm\u00eb n\u00eb nj\u00eb koh\u00eb fantastike, kur \u00ebsht\u00eb e mundur t\u00eb takojm\u00eb personalisht themeluesit e fush\u00ebs s\u00eb shkenc\u00ebs dhe inxhinieris\u00eb q\u00eb ne praktikojm\u00eb. Fizikant\u00ebt nuk do t\u00eb takojn\u00eb as Njutonin, as Einshteinin \u2014 treni ka ikur. Por pran\u00eb nesh ende jetojn\u00eb ata q\u00eb krijuan bazat e teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara, inventuan gjuh\u00eb t\u00eb njohura programimi, dhe filluan t\u00eb realizonin prototipe funksionale. K\u00ebta njer\u00ebz nuk e lan\u00eb pun\u00ebn e tyre n\u00eb gjysm\u00eb, por po merren aktualisht me probleme t\u00eb r\u00ebnd\u00ebsishme n\u00eb universitete dhe kompani t\u00eb njohura nd\u00ebrkomb\u00ebtarisht, dhe jan\u00eb burimet m\u00eb t\u00eb m\u00ebdha t\u00eb dituris\u00eb dhe p\u00ebrvoj\u00ebs t\u00eb sotme. <\/p>\n

<\/p>\n

Nga ana tjet\u00ebr, mund\u00ebsia p\u00ebr t'u takuar me ta zakonisht mbetet vet\u00ebm teorike: pak nga ne mund t\u00eb monitorojm\u00eb vazhdimisht ngjarjet publike n\u00eb ndonj\u00eb universitet Rochester, p\u00ebr t\u00eb shkuar pastaj n\u00eb SHBA dhe kthehen s\u00ebrish p\u00ebr nj\u00eb ligj\u00ebrat\u00eb nga Maikll Skuoti. T\u00eb gjith\u00eb pjes\u00ebmarr\u00ebsit n\u00eb Hydra do t\u00eb ishin nj\u00eb investim t\u00eb madh, pa p\u00ebrmendur sasin\u00eb e madhe t\u00eb koh\u00ebs q\u00eb do t\u00eb shpenzohej (ndon\u00ebse kjo ting\u00ebllon si nj\u00eb aventur\u00eb interesante).<\/p>\n

<\/p>\n

Nga ana tjet\u00ebr, ne kemi shum\u00eb inxhinier\u00eb top t\u00eb cil\u00ebt aktualisht po punojn\u00eb mbi problemet e tanishme t\u00eb sistemeve t\u00eb shp\u00ebrndara, dhe ata v\u00ebrtet kan\u00eb di\u00e7ka p\u00ebr t\u00eb treguar. Por problemi \u00ebsht\u00eb \u2014 ata punojn\u00eb<\/em>, dhe koha e tyre \u00ebsht\u00eb e shtrenjt\u00eb. Po, n\u00ebse je punonj\u00ebs n\u00eb Microsoft, Google ose JetBrains, mund\u00ebsia p\u00ebr t\u00eb takuar nj\u00eb nga fol\u00ebsit e njohur n\u00eb nj\u00eb ngjarje t\u00eb brendshme \u2014 rritet ndjesh\u00ebm, nd\u00ebrsa n\u00eb t\u00eb p\u00ebrgjithshme \u2014 jo, nuk ndodh \u00e7do dit\u00eb.<\/p>\n

<\/p>\n

K\u00ebshtu konferenca Hydra p\u00ebrmbush nj\u00eb detyr\u00eb t\u00eb r\u00ebnd\u00ebsishme, q\u00eb shumica prej nesh nuk mund ta b\u00ebj\u00eb vet\u00eb \u2014 bashkon n\u00eb nj\u00eb vend dhe n\u00eb nj\u00eb koh\u00eb njer\u00ebz, idet\u00eb e t\u00eb cil\u00ebve ose biseda me ta mund t\u00eb ndryshoj\u00eb jet\u00ebn tuaj. Pranoj se keqp\u00ebrdorimi mund t\u00eb mos i nevojitet t\u00eb gjith\u00ebve n\u00eb m\u00ebnyr\u00eb t\u00eb barabart\u00eb, ndonj\u00ebher\u00eb ndiheni t\u00eb lumtur duke programuar CRUD n\u00eb PHP p\u00ebrgjithmon\u00eb. Por p\u00ebr ata q\u00eb kan\u00eb nevoj\u00eb \u2014 kjo \u00ebsht\u00eb shansi juaj.<\/p>\n

<\/p>\n

Ka konferenca Hydra n\u00eb Habr ka kaluar nj\u00eb koh\u00eb e gjat\u00eb q\u00eb nga njoftimi i par\u00eb. Gjat\u00eb k\u00ebsaj kohe, \u00ebsht\u00eb b\u00ebr\u00eb nj\u00eb pun\u00eb e madhe \u2014 dhe ja, kemi nj\u00eb list\u00eb t\u00eb pothuajse t\u00eb gjitha prezantimeve. Asnj\u00eb algorit\u00ebm t\u00eb ngadalt\u00eb nj\u00ebkanal\u00ebsh, vet\u00ebm hardcore t\u00eb past\u00ebr t\u00eb shp\u00ebrndar\u00eb! Le t\u00eb p\u00ebrfundojm\u00eb me fjal\u00eb t\u00eb p\u00ebrgjithshme dhe t\u00eb shohim se \u00e7far\u00eb kemi tani n\u00eb duar.<\/p>\n

<\/p>\n

K\u00ebtu jan\u00eb<\/h2>\n

<\/p>\n

K\u00ebto seanca hapin dhe mbyllin dit\u00ebt e konferenc\u00ebs. Zakonisht, q\u00ebllimi i seanc\u00ebs hap\u00ebse \u00ebsht\u00eb t\u00eb p\u00ebrcaktoj\u00eb atmosfer\u00ebn dhe drejtimin e konferenc\u00ebs. Seanca mbyll\u00ebse p\u00ebrmbyll dhe shpjegon se si t\u00eb jetojm\u00eb me njohurit\u00eb dhe aft\u00ebsit\u00eb e fituara gjat\u00eb dit\u00ebve t\u00eb konferenc\u00ebs. Fillimi dhe p\u00ebrfundimi: ajo q\u00eb do t\u00eb mbahet mend m\u00eb mir\u00eb, dhe n\u00eb p\u00ebrgjith\u00ebsi, ka nj\u00eb r\u00ebnd\u00ebsi t\u00eb lart\u00eb.<\/p>\n

<\/p>\n

Cliff Click \u2014 Algoritmi i shp\u00ebrndar\u00eb K\/V H2O<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Cliff \u00ebsht\u00eb nj\u00eb legjend\u00eb n\u00eb bot\u00ebn e Java-s. N\u00eb fund t\u00eb viteve '90, p\u00ebr tez\u00ebn e tij t\u00eb PhD, ai shkroi nj\u00eb punim me titull \u00abKombinimi i Analizave, Kombinimi i Optimizimeve\u00bb<\/noindex>, q\u00eb pas nj\u00eb kohe u b\u00eb baza p\u00ebr HotSpot JVM Server Compiler. Pas dy vitesh ai tashm\u00eb punonte n\u00eb Sun Microsystems n\u00eb JVM dhe i tregoi bot\u00ebs se JIT kishte t\u00eb drejt\u00ebn e ekzistenc\u00ebs. E gjith\u00eb kjo histori e asaj q\u00eb Java \u00ebsht\u00eb nj\u00eb nga runtime-t m\u00eb t\u00eb shpejt\u00eb moderne me optimizime t\u00eb men\u00e7ura dhe t\u00eb shpejta filloi pik\u00ebrisht me Cliff Click. N\u00eb fillim, u mendua se, n\u00ebse di\u00e7ka ishte e disponueshme p\u00ebr kompilerin statik \u2014 nuk kishte asnj\u00eb arsye p\u00ebr ta provuar t\u00eb jitit. Fal\u00eb pun\u00ebs s\u00eb Cliff dhe ekipit, t\u00eb gjitha gjuh\u00ebt e reja filluan t\u00eb krijoheshin me iden\u00eb e JIT-kompilimit si norm\u00eb. Pa dyshim, kjo ishte nj\u00eb pun\u00eb q\u00eb nuk ishte p\u00ebr nj\u00eb person t\u00eb vet\u00ebm, por Cliff luajti nj\u00eb rol shum\u00eb t\u00eb r\u00ebnd\u00ebsish\u00ebm.<\/p>\n

<\/p>\n

N\u00eb keynote-in hap\u00ebs, Cliff do t\u00eb flas\u00eb p\u00ebr nj\u00eb tjet\u00ebr iniciativ\u00eb t\u00eb tij\u00ebn \u2014 H20<\/a><\/noindex>, nj\u00eb platform\u00eb n\u00eb-memory p\u00ebr m\u00ebsimin e makineris\u00eb t\u00eb shp\u00ebrndar\u00eb dhe t\u00eb shkall\u00ebzuesh\u00ebm p\u00ebr p\u00ebrdorim industrial. N\u00eb ve\u00e7anti \u2014 p\u00ebr magazinimin e shp\u00ebrndar\u00eb t\u00eb \u00e7ift\u00ebve \"\u00e7el\u00ebs-vler\u00eb\" brenda saj. Ky \u00ebsht\u00eb nj\u00eb depo shum\u00eb e shpejt\u00eb me nj\u00eb mori ve\u00e7orish interesante (lista e sakt\u00eb \u00ebsht\u00eb n\u00eb p\u00ebrshkrimin<\/a><\/noindex>), t\u00eb cilat lejojn\u00eb p\u00ebrdorimin e zgjidhjeve t\u00eb tilla n\u00eb matematik\u00ebn e rrjedhave t\u00eb t\u00eb dh\u00ebnave t\u00eb m\u00ebdha.<\/p>\n

<\/p>\n

Nj\u00eb tjet\u00ebr raport me t\u00eb cilin do t\u00eb flas\u00eb Klif \u00ebsht\u00eb \u2014 P\u00ebrvoja e Azul Hardware Transactional Memory<\/a><\/noindex>. Nj\u00eb tjet\u00ebr pjes\u00eb e biografis\u00eb s\u00eb tij \u00ebsht\u00eb dhjet\u00eb vjet pune n\u00eb Azul<\/noindex>, ku ai p\u00ebrmir\u00ebsoi dhe rinovoi shum\u00eb aspekte n\u00eb harduer dhe stack-un e teknologjive Azul: kompilator\u00eb JIT, runtime, modeli i thread-eve, trajtimi i gabimeve, puna me stack-un, nd\u00ebrprerjet harduerike, ngarkimi i klasave dhe k\u00ebshtu me radh\u00eb \u2014 e kuptuat.<\/p>\n

<\/p>\n

Pjesa m\u00eb interesante filloi kur ata krijuan harduerin p\u00ebr biznesin e madh \u2014 nj\u00eb superkompjuter p\u00ebr ekzekutimin e Java-s. Ishte nj\u00eb gj\u00eb mjaft inovative, e dizajnuar pik\u00ebrisht p\u00ebr Java-n, e cila ka k\u00ebrkesa speciale \u2014 barrierat e memories p\u00ebr t\u00eb lexuar p\u00ebr mbledhjen e mbeturinave me vones\u00eb t\u00eb ul\u00ebt, tabelat me kontroll kufijsh, thirrjet virtuale\u2026 Nj\u00eb nga teknologjit\u00eb m\u00eb t\u00eb k\u00ebndshme \u00ebsht\u00eb kujtesa transaksionale harduerike. I gjith\u00eb L1 i \u00e7do nj\u00eb nga 864 b\u00ebrthamave mund t\u00eb merrte pjes\u00eb n\u00eb regjistrimin transaksional, e cila \u00ebsht\u00eb ve\u00e7an\u00ebrisht e r\u00ebnd\u00ebsishme p\u00ebr pun\u00ebn me bllokadat n\u00eb Java (bllokadat synchronized mund t\u00eb punojn\u00eb paralelisht, derisa t\u00eb mos ket\u00eb ndonj\u00eb konflikt t\u00eb v\u00ebrtet\u00eb p\u00ebr memorien). Por ideja e bukur u p\u00ebrball me realitetin e ashp\u00ebr \u2014 dhe n\u00eb k\u00ebt\u00eb prezantim, Cliff do t\u00eb tregoj\u00eb pse HTM dhe STM nuk jan\u00eb shum\u00eb t\u00eb p\u00ebrshtatshme p\u00ebr nevojat praktike t\u00eb llogaritjeve me shum\u00eb kanale.<\/p>\n

<\/p>\n

Michael Scott \u2014 Struktura dupleks<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Majkl Skoti<\/a><\/noindex> \u2014 profesor i Shkenc\u00ebs Kompjuterike n\u00eb Universitetin e Rochester-it, me t\u00eb cilin fati e lidh at\u00eb p\u00ebr 34 vjet<\/noindex>, dhe n\u00eb Universitetin Wisconsin-Madison, ka qen\u00eb dekan p\u00ebr pes\u00eb vjet. Ai merret me k\u00ebrkime n\u00eb fush\u00ebn e programimit paralel dhe t\u00eb distribuar si dhe t\u00eb dizajnit t\u00eb gjuh\u00ebve dhe u m\u00ebson student\u00ebve k\u00ebt\u00eb.<\/p>\n

<\/p>\n

I gjith\u00eb bota e njeh Michael p\u00ebr tekstin e tij \u00abProgramming Language Pragmatics\u00bb<\/a><\/noindex>, edicioni m\u00eb i fundit i t\u00eb cilit u publikua relativisht koh\u00ebt e fundit \u2014 n\u00eb vitin 2015. Puna e tij \u00abAlgorithms for scalable synchronization on shared-memory multiprocessors\u00bb<\/a><\/noindex> mori \u00e7mimin Dijkstra<\/a><\/noindex> si nj\u00eb prej m\u00eb t\u00eb njohurave n\u00eb fush\u00ebn e llogaritjeve t\u00eb distribuar dhe ndodhet hapur<\/a><\/noindex> n\u00eb bibliotek\u00ebn online t\u00eb Universitetit Rochester. Gjithashtu mund ta njihni at\u00eb si autorin e atij algoritmi t\u00eb famsh\u00ebm t\u00eb Michael-Scott nga \u00abSimple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms\u00bb<\/a><\/noindex>.<\/p>\n

<\/p>\n

N\u00eb lidhje me bot\u00ebn e Java, ky \u00ebsht\u00eb nj\u00eb rast i ve\u00e7ant\u00eb: s\u00eb bashku me Doug Lea, ai zhvilloi ato algoritme jo-bllokuese dhe radh\u00ebt sinqonje ku jan\u00eb nd\u00ebrtuar bibliotekat Java. Pik\u00ebrisht p\u00ebr k\u00ebt\u00eb do t\u00eb flitet n\u00eb keynote \u00abDual data structures\u00bb \u2014 integrimi i k\u00ebtyre strukturave n\u00eb Java SE 6 lehoi p\u00ebrmir\u00ebsimin e performanc\u00ebs me 10 her\u00eb java.util.concurrent.ThreadPoolExecutor<\/code>. N\u00ebse jeni t\u00eb interesuar m\u00eb par\u00eb p\u00ebr k\u00ebto \u00abDual data structures\u00bb, ka nj\u00eb pun\u00eb p\u00ebrkat\u00ebse<\/a><\/noindex>. <\/p>\n

<\/p>\n

Maurice Herlihy \u2014 Blloqet dhe e ardhmja e kompjuter\u00ebve t\u00eb shp\u00ebrndar\u00eb<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Maurice Herlihy<\/a><\/noindex> \u2014 mbajt\u00ebs i dy \u00e7mimeve Dijkstra. E para \u2014 p\u00ebr pun\u00ebn mbi \u00abSinchronizimi Pa Prerje\u00bb<\/a><\/noindex> (Universiteti Brown), dhe e dyta, m\u00eb e reja \u2014 \u00abMemoria Transaksionale: Mb\u00ebshtetje Arkitekturore p\u00ebr Struktura TData pa Bllokim\u00bb<\/a><\/noindex> (Universiteti Virginia Tech). \u00c7mimi Dijkstra jepet p\u00ebr pun\u00eb, t\u00eb cilat kan\u00eb pasur r\u00ebnd\u00ebsi dhe ndikim t\u00eb duksh\u00ebm p\u00ebr t\u00eb pakt\u00ebn dhjet\u00eb vjet, dhe \u00ebsht\u00eb e qart\u00eb, Maurice \u00ebsht\u00eb nj\u00eb nga specialist\u00ebt m\u00eb t\u00eb njohur n\u00eb fush\u00eb. Aktualisht ai punon si profesor n\u00eb Universitetin Brown dhe ka nj\u00eb num\u00ebr arritjesh q\u00eb do t\u00eb zinin nj\u00eb paragraf t\u00eb t\u00ebr\u00eb.<\/p>\n

<\/p>\n

N\u00eb k\u00ebt\u00eb konferenc\u00eb p\u00ebrmbyll\u00ebse, Maurice do t\u00eb flas\u00eb p\u00ebr teorin\u00eb dhe praktik\u00ebn e sistemeve t\u00eb shp\u00ebrndara blockchain nga perspektiva e klasikes s\u00eb llogaritjeve t\u00eb shp\u00ebrndara dhe si kjo e thjeshton nj\u00eb num\u00ebr problematikash t\u00eb lidhura. Ky \u00ebsht\u00eb nj\u00eb ligj\u00ebrat\u00eb ekskluzivisht mbi tem\u00ebn e konferenc\u00ebs \u2014 aspak p\u00ebr trendin e minierave, por m\u00eb shum\u00eb p\u00ebr at\u00eb se si njohurit\u00eb tona mund t\u00eb p\u00ebrdoren n\u00eb m\u00ebnyr\u00eb t\u00eb jasht\u00ebzakonshme efektive dhe t\u00eb p\u00ebrshtatshme p\u00ebr nj\u00eb s\u00ebr\u00eb problematikash t\u00eb ndryshme.<\/p>\n

<\/p>\n

N\u00eb korrik t\u00eb vitit 2017, Maurice erdhi n\u00eb Rusi p\u00ebr shkoll\u00ebn SPTDC, mori pjes\u00eb n\u00eb takimin JUG.ru, dhe regjistrimi mund t\u00eb shikohet n\u00eb YouTube:<\/p>\n

\n

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

Programi kryesor<\/h2>\n

<\/p>\n

M\u00eb pas do t\u00eb jet\u00eb nj\u00eb p\u00ebrmbledhje e vog\u00ebl e referimeve q\u00eb jan\u00eb p\u00ebrfshir\u00eb n\u00eb program. Disa referime k\u00ebtu jan\u00eb p\u00ebrshkruar n\u00eb detaje, disa \u2014 m\u00eb shkurt. P\u00ebrshkrimet e gjata iu japin kryesisht referimeve n\u00eb anglisht, t\u00eb cilat k\u00ebrkojn\u00eb lidhje n\u00eb punime shkencore, terma n\u00eb Wikipedia, dhe k\u00ebshtu me radh\u00eb. Lista e plot\u00eb mund t\u00eb shikohet n\u00eb faqen e konferenc\u00ebs<\/a><\/noindex>. Lista n\u00eb faqe do t\u00eb p\u00ebrdit\u00ebsohet dhe do t\u00eb plot\u00ebsohet. <\/p>\n

<\/p>\n

Leslie Lamport \u2014 P & P<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Leslie Lamport \u00ebsht\u00eb autori i punimeve thelb\u00ebsore n\u00eb llogarit\u00eb e shp\u00ebrndara. \u00abLaTeX\u00bb<\/a><\/noindex> nd\u00ebrtohet si \u00abLamport TeX\u00bb. Ai e futi p\u00ebr her\u00eb t\u00eb par\u00eb 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.<\/p>\n

<\/p>\n

Kjo \u00ebsht\u00eb pjesa m\u00eb e \u00e7uditshme e programit, sepse kjo madje nuk \u00ebsht\u00eb nj\u00eb referim, por nj\u00eb seanc\u00eb pyetje dhe p\u00ebrgjigjesh. Kur nj\u00eb pjes\u00eb e madhe e audienc\u00ebs tashm\u00eb \u00ebsht\u00eb e njohur (ose mund t\u00eb njihet) me punimet e ndryshme t\u00eb bazuara n\u00eb \u00abteorin\u00eb e Lamportit\u00bb, artikujt dhe referimet e tij, \u00ebsht\u00eb m\u00eb se e r\u00ebnd\u00ebsishme t\u00eb shpenzohet gjith\u00eb koha e mundshme p\u00ebr komunikim t\u00eb drejtp\u00ebrdrejt\u00eb.<\/p>\n

<\/p>\n

Ideja \u00ebsht\u00eb e thjesht\u00eb \u2014 ju shikoni dy referime n\u00eb YouTube: \u00abProgramimi Duhet t\u00eb Jet\u00eb M\u00eb Shum\u00eb Se Kodim\u00bb<\/a><\/noindex> dhe \u00abIf You’re Not Writing a Program, Don’t Use a Programming Language\u00bb<\/a><\/noindex> dhe p\u00ebrgatitni t\u00eb pakt\u00ebn nj\u00eb pyetje, nd\u00ebrsa Leslie p\u00ebrgjigjet.<\/p>\n

<\/p>\n

E para nga k\u00ebto dy video tashm\u00eb e kemi kthyer n\u00eb nj\u00eb artikull t\u00eb Habros.<\/a><\/noindex>. N\u00ebse nuk keni nj\u00eb or\u00eb koh\u00eb p\u00ebr t\u00eb par\u00eb videon, mund ta lexoni shpejt k\u00ebt\u00eb n\u00eb form\u00eb teksti.<\/p>\n

<\/p>\n

P\u00ebr mir\u00ebsi: n\u00eb YouTube ka shum\u00eb m\u00eb tep\u00ebr video me Leslie Lamport. P\u00ebr shembull, ka nj\u00eb kurs t\u00eb shk\u00eblqyer p\u00ebr TLA+<\/a><\/noindex>. Versioni offline i t\u00eb gjith\u00eb k\u00ebtij kursi \u00ebsht\u00eb n\u00eb faqen kryesore t\u00eb autorit<\/a><\/noindex>, nd\u00ebrsa ai e ka ngarkuar at\u00eb n\u00eb YouTube p\u00ebr shikim m\u00eb t\u00eb leht\u00eb n\u00eb pajisjet mobile.<\/p>\n

<\/p>\n

Martin Kleppmann \u2014 Sinkronizimi i t\u00eb dh\u00ebnave p\u00ebrmes pajisjeve t\u00eb p\u00ebrdoruesve p\u00ebr bashk\u00ebpunim t\u00eb shp\u00ebrndar\u00eb<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Martin Kleppmann \u00ebsht\u00eb nj\u00eb hulumtues n\u00eb Universitetin e Kembrixhit, q\u00eb punon mbi CRDT dhe verifikimin formal t\u00eb algoritmeve. Libri i Martin \u00abKrijimi i Aplikacioneve t\u00eb Intensitetit t\u00eb t\u00eb Dh\u00ebnave\u00bb<\/noindex>, i publikuar n\u00eb vitin 2017, ka qen\u00eb shum\u00eb i suksessh\u00ebm dhe ka hyr\u00eb n\u00eb listat e bestseller\u00ebve n\u00eb fush\u00ebn e ruajtjes dhe p\u00ebrpunimit t\u00eb t\u00eb dh\u00ebnave. Kevin Scott, CTO n\u00eb Microsoft, nj\u00ebher\u00eb tha<\/a><\/noindex>: \u00abKy lib\u00ebr duhet t\u00eb jet\u00eb i detyruesh\u00ebm p\u00ebr inxhinier\u00ebt e zhvillimit. Ky \u00ebsht\u00eb nj\u00eb burim i rrall\u00eb q\u00eb bashkon teori dhe praktik\u00eb, ndihmon zhvilluesit t\u00eb dizajnojn\u00eb dhe zbatojn\u00eb m\u00eb inteligjent infrastruktur\u00ebn dhe sistemet e p\u00ebrpunimit t\u00eb t\u00eb dh\u00ebnave\u00bb. Di\u00e7ka t\u00eb ngjashme tha edhe krijuesi i Kafka-s dhe CTO i Confluent, Jay Kreps.<\/p>\n

<\/p>\n

Para se t\u00eb merrej me k\u00ebrkimet akademike, Martin punoi n\u00eb industri dhe u b\u00eb bashk\u00ebthemelues i dy startupeve t\u00eb suksesshme:<\/p>\n

<\/p>\n