{"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 kokat e hidr\u00ebs. Nj\u00eb p\u00ebrmbledhje e madhe e programit","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

M\u00eb 11-12 korrik n\u00eb Sh\u00ebn Petersburg do t\u00eb mbahet nj\u00eb konferenc\u00eb Hydra<\/a><\/noindex>, e dedikuar zhvillimit t\u00eb sistemeve paralele dhe t\u00eb shp\u00ebrndara. Risi e Hydra \u00ebsht\u00eb se ajo bashkon shkenc\u00ebtar\u00eb t\u00eb njohur (t\u00eb cil\u00ebt zakonisht mund t\u00eb gjejm\u00eb vet\u00ebm n\u00eb konferenca shkencore jasht\u00eb vendit) dhe inxhinier\u00eb praktik\u00eb t\u00eb njohur, n\u00eb nj\u00eb program t\u00eb madh n\u00eb nd\u00ebrlidhjen mes shkenc\u00ebs dhe praktik\u00ebs.<\/p>\n

<\/p>\n

Hydra \u00ebsht\u00eb nj\u00eb nga konferencat m\u00eb t\u00eb r\u00ebnd\u00ebsishme q\u00eb kemi pasur n\u00eb vitet e fundit. Ajo i parapriu nj\u00eb p\u00ebrgatitje t\u00eb madhe, p\u00ebrzgjedhjes s\u00eb fol\u00ebsve dhe temave. Jav\u00ebn e kaluar p\u00ebr k\u00ebt\u00eb doli nj\u00eb intervist\u00eb n\u00eb Habr<\/a><\/noindex> me drejtorin e kompanis\u00eb JUG.ru Group, Aleksej Fedorov (23derevo<\/a><\/noindex>). <\/p>\n

<\/p>\n

Ne m\u00eb par\u00eb kemi folur<\/a><\/noindex> rreth tre pjes\u00ebmarr\u00ebsve t\u00eb r\u00ebnd\u00ebsish\u00ebm, themeluesve t\u00eb teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara \u2014 Leslie Lamport, Maurice Herlihy dhe Michael Scott. \u00cbsht\u00eb koha p\u00ebr t\u00eb diskutuar m\u00eb n\u00eb detaje mbi gjith\u00eb programin!<\/p>\n

<\/p>\n

\"19<\/p>\n

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

Motivimi<\/h2>\n

<\/p>\n

N\u00ebse jeni duke u marr\u00eb me programim, at\u00ebher\u00eb n\u00eb nj\u00eb m\u00ebnyr\u00eb ose n\u00eb nj\u00eb tjet\u00ebr jeni duke trajtuar me shum\u00ebth\u00ebnie dhe llogaritje t\u00eb shp\u00ebrndara. Specialist\u00ebt n\u00eb fushat p\u00ebrkat\u00ebse punojn\u00eb direkt me to, por shp\u00ebrndarja ndikon n\u00eb ne nga t\u00eb gjitha an\u00ebt: n\u00eb \u00e7do kompjuter shum\u00ebb\u00ebrthamor ose sh\u00ebrbim t\u00eb shp\u00ebrndar\u00eb do t\u00eb gjeni di\u00e7ka q\u00eb realizon llogaritje n\u00eb m\u00ebnyr\u00eb paralele.<\/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, q\u00eb n\u00eb format ligj\u00ebratash zbulojn\u00eb volume t\u00eb m\u00ebdha t\u00eb teoris\u00eb komplekse. P\u00ebr shembull, paralelisht me Hydra n\u00eb Sh\u00ebn Petersburg po zhvillohet shkolla SPTDC<\/a><\/noindex>. N\u00eb konferenc\u00ebn Hydra ne p\u00ebrpiqemi t\u00eb bashkojm\u00eb si praktik\u00ebn e ashp\u00ebr, ashtu edhe shkenc\u00ebn, dhe gjith\u00e7ka q\u00eb ndodhet n\u00eb nd\u00ebrlidhjen e tyre.<\/strong> <\/p>\n

<\/p>\n

Mendohuni pak p\u00ebr k\u00ebt\u00eb: ne jetojm\u00eb n\u00eb nj\u00eb koh\u00eb t\u00eb mrekullueshme, kur mund t\u00eb takojm\u00eb drejtp\u00ebrdrejt t\u00eb themeluesit e atij fusha t\u00eb shkenc\u00ebs dhe inxhinieris\u00eb me t\u00eb cilat merremi. Fizikant\u00ebt nuk do t\u00eb takojn\u00eb as Newtonin, as Einsteinin \u2014 treni ka ikur. Por af\u00ebr nesh akoma jetojn\u00eb ata q\u00eb krijuan bazat e teoris\u00eb s\u00eb sistemeve t\u00eb shp\u00ebrndara, shpik\u00ebn gjuh\u00eb programimi t\u00eb njohura, e filluan t\u00eb realizojn\u00eb t\u00eb gjitha k\u00ebto n\u00eb prototipe funksionale. K\u00ebta njer\u00ebz nuk e kan\u00eb braktisur pun\u00ebn e tyre n\u00eb gjysm\u00eb, ata aktualisht po merren me detyra aktuale n\u00eb universitete dhe kompani me renome, dhe jan\u00eb burime t\u00eb m\u00ebdha dijesh dhe eksperienc\u00eb deri m\u00eb sot. <\/p>\n

<\/p>\n

Nga ana tjet\u00ebr, mund\u00ebsia p\u00ebr t'u takuar me ta zakonisht mbetet thjesht teorike: jo \u00e7do dikush prej nesh mund t\u00eb monitoroj\u00eb vazhdimisht ngjarjet publike n\u00eb ndonj\u00eb universitet t\u00eb Rochester-it, p\u00ebr t\u00eb vrapuar pastaj n\u00eb SHBA dhe mbrapa p\u00ebr nj\u00eb ligj\u00ebrat\u00eb me Michael Scott. T\u00eb vizitosh t\u00eb gjith\u00eb pjes\u00ebmarr\u00ebsit e Hydra do t\u00eb ishte nj\u00eb investim i vog\u00ebl, pa folur p\u00ebr humbjen e koh\u00ebs (edhe pse kjo ting\u00ebllon si nj\u00eb mision interesant).<\/p>\n

<\/p>\n

Nga ana tjet\u00ebr, ne kemi shum\u00eb inxhinier\u00eb t\u00eb nivelit t\u00eb lart\u00eb q\u00eb po punojn\u00eb pik\u00ebrisht tani mbi problemet aktuale t\u00eb sistemeve t\u00eb shp\u00ebrndara, dhe ata patjet\u00ebr kan\u00eb di\u00e7ka p\u00ebr t\u00eb treguar. Por ja problemi \u2014 ata punojn\u00eb<\/em>, dhe koha e tyre \u00ebsht\u00eb e shtrenjt\u00eb. Po, n\u00ebse ti je punonj\u00ebs i Microsoft, Google ose JetBrains, shanset p\u00ebr t\u00eb takuar nj\u00ebrin nga fol\u00ebsit e njohur n\u00eb nj\u00eb ngjarje t\u00eb brendshme rriten ndjesh\u00ebm, por n\u00eb p\u00ebrgjith\u00ebsi \u2014 jo, nuk ndodh \u00e7do dit\u00eb.<\/p>\n

<\/p>\n

K\u00ebshtu, konferenca Hydra kryen nj\u00eb detyr\u00eb t\u00eb r\u00ebnd\u00ebsishme, t\u00eb cil\u00ebn shumica prej nesh nuk mund ta realizojm\u00eb vet\u00eb \u2014 n\u00eb nj\u00eb vend dhe n\u00eb nj\u00eb koh\u00eb bashkon njer\u00ebzit, idet\u00eb e t\u00eb cil\u00ebve ose komunikimi me ta mund t\u00eb ndryshoj\u00eb jet\u00ebn tuaj. Pranoj q\u00eb nuk t\u00eb gjith\u00eb do t'u duhet sisteme t\u00eb shp\u00ebrndara, disa gj\u00ebra komplekse fundamentale. Mund t\u00eb programosh CRUD n\u00eb PHP deri n\u00eb fund t\u00eb jet\u00ebs dhe t\u00eb jesh plot\u00ebsisht i lumtur. Por ata q\u00eb kan\u00eb nevoj\u00eb \u2014 \u00ebsht\u00eb shansi juaj.<\/p>\n

<\/p>\n

Ka kaluar nj\u00eb koh\u00eb e gjat\u00eb q\u00eb kur u njoftua p\u00ebr her\u00eb t\u00eb par\u00eb konferenca Hydra n\u00eb Habr\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 prezentimeve. Asnj\u00eb algorit\u00ebm monotonic t\u00eb dob\u00ebt, vet\u00ebm thelbi i past\u00ebr i shp\u00ebrndarjes! Le t\u00eb mbyllim me fjal\u00eb t\u00eb p\u00ebrgjithshme, dhe t\u00eb shohim se \u00e7far\u00eb kemi tani n\u00eb duar.<\/p>\n

<\/p>\n

Prezantimet kryesore<\/h2>\n

<\/p>\n

Prezantimet kryesore nisin dhe p\u00ebrfundojn\u00eb dit\u00ebt e konferenc\u00ebs. Zakonisht, q\u00ebllimi i prezantimit t\u00eb par\u00eb kryesor \u00ebsht\u00eb t\u00eb vendos\u00eb shpirtin dhe drejtimin e p\u00ebrgjithsh\u00ebm t\u00eb konferenc\u00ebs. Prezantimi i mbylljes p\u00ebrmbledh dhe shpjegon se si t\u00eb jetojm\u00eb me njohurit\u00eb dhe aft\u00ebsit\u00eb e fituara n\u00eb dit\u00ebt e konferenc\u00ebs. Fillimi dhe fundi: ato q\u00eb do t\u00eb mbahen mend m\u00eb s\u00eb miri, dhe n\u00eb p\u00ebrgjith\u00ebsi, kan\u00eb r\u00ebnd\u00ebsi t\u00eb madhe.<\/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 legjenda e bot\u00ebs Java. N\u00eb fund t\u00eb viteve '90, p\u00ebr tez\u00ebn e doktorat\u00ebs, ai shkroi nj\u00eb punim t\u00eb titulluar \u00abKombinimi i Analizave, Kombinimi i Optimizimeve\u00bb<\/noindex>, e cila 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 mbi JVM dhe i tregoi bot\u00ebs se JIT ka t\u00eb drejt\u00eb t\u00eb ekzistoj\u00eb. E gjitha kjo histori mbi at\u00eb se Java \u00ebsht\u00eb nj\u00eb nga runtime-t m\u00eb t\u00eb shpejt\u00eb moderne me optimizime nga m\u00eb t\u00eb men\u00e7urat dhe m\u00eb t\u00eb shpejtat filloi pik\u00ebrisht me Cliff Click. N\u00eb fillim mendohej se, n\u00ebse di\u00e7ka \u00ebsht\u00eb e disponueshme p\u00ebr nj\u00eb kompilator statik, nuk ka kuptim t\u00eb provosh t\u00eb b\u00ebsh JIT. 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 opsion default. Sigurisht, kjo ishte nj\u00eb pun\u00eb q\u00eb nuk mund t\u00eb b\u00ebhej nga nj\u00eb njeri i vet\u00ebm, por Cliff luajti nj\u00eb rol shum\u00eb t\u00eb r\u00ebnd\u00ebsish\u00ebm.<\/p>\n

<\/p>\n

N\u00eb keynote-in e hapjes, Cliff do t\u00eb flas\u00eb p\u00ebr nj\u00eb tjet\u00ebr nism\u00eb t\u00eb tij \u2014 H20<\/a><\/noindex>, nj\u00eb platform\u00eb in-memory p\u00ebr m\u00ebsimin e makinerive t\u00eb shp\u00ebrndara dhe t\u00eb shkall\u00ebzuara p\u00ebr aplikime industriale. M\u00eb sakt\u00eb \u2014 p\u00ebr magazin\u00ebn e shp\u00ebrndar\u00eb t\u00eb \u00e7ift\u00ebve \"\u00e7el\u00ebs-vler\u00eb\" brenda saj. Ky \u00ebsht\u00eb nj\u00eb magazin\u00eb shum\u00eb e shpejt\u00eb me nj\u00eb shum\u00ebllojshm\u00ebri ve\u00e7orish interesante (lista e sakt\u00eb \u00ebsht\u00eb n\u00eb p\u00ebrshkrimin<\/a><\/noindex>), e cila lejon p\u00ebrdorimin e zgjidhjeve t\u00eb ngjashme n\u00eb matematik\u00ebn e rrjedh\u00ebs s\u00eb t\u00eb dh\u00ebnave t\u00eb m\u00ebdha.<\/p>\n

<\/p>\n

Nj\u00eb tjet\u00ebr referim me t\u00eb cilin do t\u00eb flas\u00eb Cliff \u00ebsht\u00eb \u2014 P\u00ebrvoja e Azul Hardware Transactional Memory<\/a><\/noindex>. Nj\u00eb pjes\u00eb tjet\u00ebr e biografis\u00eb s\u00eb tij \u2014 dhjet\u00eb vjet pun\u00eb n\u00eb Azul<\/noindex>, ku ai p\u00ebrmir\u00ebsoi dhe rifreskoi shum\u00eb aspekte n\u00eb harduer dhe stack t\u00eb teknologjive Azul: JIT-kompilator\u00ebt, runtime, modeli i thread-eve, p\u00ebrpunimi i gabimeve, administrimi i stack-ut, nd\u00ebrprerjet harduerike, ngarkimi i klasave dhe ashtu me radh\u00eb \u2014 e kuptuat.<\/p>\n

<\/p>\n

Pjesa m\u00eb interesante filloi kur ata krijuan harduer p\u00ebr biznes t\u00eb madh \u2014 superkompjuter p\u00ebr t\u00eb ekzekutuar Java. Kjo ishte nj\u00eb gj\u00eb mjaft inovative, e projektuar pik\u00ebrisht p\u00ebr Java, e cila ka k\u00ebrkesa t\u00eb ve\u00e7anta \u2014 barrierat e memories p\u00ebr lexim p\u00ebr mbledhjen e plehrave me vones\u00eb t\u00eb ul\u00ebt, tabelat me verifikimin e kufijve, thirrjet virtuale\u2026 Nj\u00eb nga teknologjit\u00eb m\u00eb t\u00eb jasht\u00ebzakonshme ishte memoria tranzaksionale harduerike. E gjith\u00eb L1 e \u00e7do nga 864 b\u00ebrthamave mund t\u00eb merrte pjes\u00eb n\u00eb nj\u00eb shkruar tranzaksional, e cila \u00ebsht\u00eb ve\u00e7an\u00ebrisht e r\u00ebnd\u00ebsishme p\u00ebr pun\u00ebn me bllokimet n\u00eb Java (blloqet synchronized mund t\u00eb punojn\u00eb paralelisht, derisa t\u00eb mos ket\u00eb nj\u00eb konflikt real p\u00ebr memory-n). Por ideja e bukur u p\u00ebrplas me realitetin e ashp\u00ebr \u2014 dhe n\u00eb k\u00ebt\u00eb referat, Cliff do t\u00eb flas\u00eb pse HTM dhe STM nuk i p\u00ebrshtaten aq mir\u00eb nevojave praktike t\u00eb llogaritjeve multithread.<\/p>\n

<\/p>\n

Michael Scott \u2014 Struktura t\u00eb dh\u00ebnash t\u00eb dyfishta<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Michael Scott<\/a><\/noindex> \u2014 profesor Kompjuter\u00ebsh n\u00eb Universitetin e Rochester, me t\u00eb cilin e lidh fati p\u00ebr 34 vjet<\/noindex>, dhe n\u00eb universitetin e tij t\u00eb lindjes Wisconsin\u2013Madison, ishte dekani p\u00ebr pes\u00eb vjet. Ai merret me hulumtime n\u00eb fush\u00ebn e programimit t\u00eb paralel dhe t\u00eb shp\u00ebrndar\u00eb dhe dizajnit t\u00eb gjuh\u00ebve dhe i m\u00ebson k\u00ebt\u00eb student\u00ebve.<\/p>\n

<\/p>\n

T\u00eb gjith\u00eb bot\u00ebn e njeh Michael p\u00ebr shkakun e librit t\u00eb tij \u00abProgramming Language Pragmatics\u00bb<\/a><\/noindex>, botimi i fundit i t\u00eb cilit doli relativisht s\u00eb fundmi \u2014 n\u00eb vitin 2015. Vepra e tij \u00abAlgorithms for scalable synchronization on shared-memory multiprocessors\u00bb<\/a><\/noindex> mori fitues i \u00e7mimit Dijkstra<\/a><\/noindex> si nj\u00eb nga veprat m\u00eb t\u00eb njohura n\u00eb fush\u00ebn e llogaritjeve t\u00eb shp\u00ebrndara dhe \u00ebsht\u00eb n\u00eb dispozit\u00eb<\/a><\/noindex> n\u00eb bibliotek\u00ebn online t\u00eb Universitetit t\u00eb Rochester. Gjithashtu, ndoshta e njihni si autorin e algoritmit t\u00eb njohur Michael-Scott nga \u00abSimple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms\u00bb<\/a><\/noindex>.<\/p>\n

<\/p>\n

Sa i p\u00ebrket bot\u00ebs s\u00eb Java-s, 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 sinkronizues, mbi t\u00eb cilat funksionojn\u00eb bibliotekat Java. Pik\u00ebrisht p\u00ebr k\u00ebt\u00eb do t\u00eb flas\u00eb n\u00eb keynote-in \u00abStruktura t\u00eb dh\u00ebnash t\u00eb dyfishta\u00bb \u2014 implementimi i k\u00ebtyre strukturave n\u00eb Java SE 6 mund\u00ebsoi nj\u00eb p\u00ebrmir\u00ebsim t\u00eb performanc\u00ebs 10 her\u00eb java.util.concurrent.ThreadPoolExecutor<\/code>. N\u00ebse jeni t\u00eb interesuar paraprakisht se \u00e7far\u00eb jan\u00eb k\u00ebto \u00abStruktura t\u00eb dh\u00ebnash t\u00eb dyfishta\u00bb, ka nj\u00eb punim p\u00ebrkat\u00ebs<\/a><\/noindex>. <\/p>\n

<\/p>\n

Maurice Herlihy \u2014 Bllokadet dhe e ardhmja e llogaritjeve t\u00eb shp\u00ebrndara<\/a><\/noindex><\/h3>\n

<\/p>\n

\"19 Morris Hirshfield<\/a><\/noindex> \u2014 fitues i dy \u00e7mimeve Dijkstra. E para \u2014 p\u00ebr punimin e tij mbi \u00abWait-Free Synchronization\u00bb<\/a><\/noindex> (Universiteti Brown), dhe e dyta, m\u00eb e re \u2014 \u00abTransactional Memory: Architectural Support for Lock-Free Data Structures\u00bb<\/a><\/noindex> (Universiteti Virginia Tech). \u00c7mimi Dijkstra jepet p\u00ebr punime, r\u00ebnd\u00ebsia dhe ndikimi i t\u00eb cilave jan\u00eb v\u00ebn\u00eb re 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 k\u00ebt\u00eb fush\u00eb. Aktualisht ai punon si profesor n\u00eb Universitetin Brown dhe ka shum\u00eb arritje q\u00eb meritojn\u00eb nj\u00eb paragraf t\u00eb t\u00ebr\u00eb.<\/p>\n

<\/p>\n

N\u00eb k\u00ebt\u00eb keynote p\u00ebrmbyll\u00ebs, Maurice do t\u00eb flas\u00eb p\u00ebr teorin\u00eb dhe praktik\u00ebn e sistemeve t\u00eb shp\u00ebrndara t\u00eb bllokadave nga k\u00ebndv\u00ebshtrimi i klasikes s\u00eb llogarive t\u00eb shp\u00ebrndara dhe se si kjo thjeshton shum\u00eb probleme t\u00eb lidhura. Ky \u00ebsht\u00eb nj\u00eb ligj\u00ebrat\u00eb ekskluzivisht p\u00ebr tem\u00ebn e konferenc\u00ebs \u2014 aspak p\u00ebr hype-n e minerave, por m\u00eb tep\u00ebr p\u00ebr at\u00eb se si njohurit\u00eb tona mund t\u00eb p\u00ebrdoren n\u00eb m\u00ebnyr\u00eb befasuese efektive dhe relevante p\u00ebr probleme 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 mitap-in JUG.ru, dhe regjistrimi mund t\u00eb shihet 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\u00ebposht\u00eb do t\u00eb jet\u00eb nj\u00eb p\u00ebrmbledhje e vog\u00ebl e referateve q\u00eb jan\u00eb p\u00ebrfshir\u00eb n\u00eb program. Disa referate jan\u00eb p\u00ebrshkruar me detaje, disa \u2014 m\u00eb shkurt. P\u00ebrshkrimet e gjata iu besuan kryesisht referateve n\u00eb anglisht, q\u00eb k\u00ebrkojn\u00eb lidhje me punime shkencore, terma n\u00eb Wikipedia, etj. 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 plot\u00ebsohet. <\/p>\n

<\/p>\n

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

<\/p>\n

\"19 Leslie Lamport \u00ebsht\u00eb autor i punimeve thelb\u00ebsore n\u00eb llogarit\u00eb e shp\u00ebrndara. \u00abLaTeX\u00bb<\/a><\/noindex> shkurtimisht do t\u00eb thot\u00eb \u00abLamport TeX\u00bb. Ai e prezantoi p\u00ebr her\u00eb t\u00eb par\u00eb, q\u00eb n\u00eb vitin 1979, konceptin 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> ka marr\u00eb \u00e7mimin Dijkstra.<\/p>\n

<\/p>\n

Kjo \u00ebsht\u00eb pjesa m\u00eb e pazakont\u00eb e programit, sepse nuk \u00ebsht\u00eb as nj\u00eb referat, por nj\u00eb sesion pyetjesh dhe p\u00ebrgjigjesh. Kur nj\u00eb pjes\u00eb e konsiderueshme e audienc\u00ebs \u00ebsht\u00eb tashm\u00eb e njohur (ose mund t\u00eb njihet) me punime t\u00eb ndryshme q\u00eb jan\u00eb t\u00eb bazuara n\u00eb \u00abteorin\u00eb e Lamport\u00bb, artikujt dhe referatet e tij, \u00ebsht\u00eb m\u00eb e r\u00ebnd\u00ebsishme t\u00eb shpenzohet gjith\u00eb koha e disponueshme p\u00ebr komunikim t\u00eb drejtp\u00ebrdrejt\u00eb.<\/p>\n

<\/p>\n

Ideja \u00ebsht\u00eb e thjesht\u00eb \u2014 ju shikoni dy referate n\u00eb YouTube: \u00abProgramming Should Be More Than Coding\u00bb<\/a><\/noindex> dhe \u00abN\u00ebse Nuk Po Shkruani Nj\u00eb Program, Mos P\u00ebrdorni Nj\u00eb Gjuh\u00eb Programimi\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 ne tashm\u00eb e kemi kthyer n\u00eb nj\u00eb artikull t\u00eb hub-imit<\/a><\/noindex>. N\u00ebse nuk keni nj\u00eb or\u00eb koh\u00eb p\u00ebr t\u00eb par\u00eb videon, mund ta lexoni shpejt gjith\u00e7ka n\u00eb form\u00eb teksti.<\/p>\n

<\/p>\n

N\u00eb v\u00ebmendje: n\u00eb YouTube ka shum\u00eb m\u00eb tep\u00ebr video me Leslie Lamport. P\u00ebr shembull, ka nj\u00eb t\u00eb shk\u00eblqyer p\u00ebr TLA+<\/a><\/noindex>. Versioni offline i gjith\u00eb k\u00ebtij kursi \u00ebsht\u00eb n\u00eb faqen kryesore t\u00eb autorit<\/a><\/noindex>, dhe n\u00eb YouTube ai e ka ngarkuar 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, duke punuar mbi CRDT dhe verifikimin formal t\u00eb algoritmeve. Libri i Martin \u00abDesigning Data-Intensive Applications\u00bb<\/noindex>, i botuar n\u00eb vitin 2017, doli shum\u00eb i suksessh\u00ebm dhe p\u00ebrfundoi 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, thoshte nj\u00eb her\u00eb<\/a><\/noindex>: \u00abKy lib\u00ebr duhet t\u00eb jet\u00eb i detyruesh\u00ebm p\u00ebr inxhinier\u00ebt zhvillues. \u00cbsht\u00eb nj\u00eb burim i rrall\u00eb q\u00eb bashkon teorin\u00eb dhe praktik\u00ebn, duke ndihmuar zhvilluesit t\u00eb dizajnojn\u00eb dhe realizojn\u00eb n\u00eb m\u00ebnyr\u00eb m\u00eb inteligjente infrastruktur\u00ebn dhe sistemet e p\u00ebrpunimit t\u00eb t\u00eb dh\u00ebnave\u00bb. Di\u00e7ka t\u00eb ngjashme tha edhe krijuesi i Kafka dhe CTO i Confluent, Jay Kreps.<\/p>\n

<\/p>\n

Para se angazhuar n\u00eb studime akademike, Marti punoi n\u00eb industri dhe u b\u00eb bashk\u00ebthemelues i dy startupeve t\u00eb suksesshme:<\/p>\n

<\/p>\n