LEADER 01233cam0-22004091i-450- 001 990000683260403321 005 20080730114942.0 010 $a88-7056-526-2 035 $a000068326 035 $aFED01000068326 035 $a(Aleph)000068326FED01 035 $a000068326 100 $a20020821d1985----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay-------001yy 200 1 $a<>famosi Softest$eprove rivisitate dei package più popolari 210 $aMilano$cJackson$dc1985 215 $aVI, 117 p.$d21 cm 225 1 $a<>quaderni Jackson di Personal Computer$v28 225 1 $aComputer handbooks$v28 300 $aIl titolo della sovraccoperta è diverso da quello del frontespizio e della copertina 517 1 $aPackage a confronto$eprove dei software più diffusi 610 0 $aMicroelaboratori elettronici$aProgrammi 676 $a005.3 676 $a005.1 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990000683260403321 952 $a01 LAB 22$b00342$fDINST 952 $a02 52 B 28$b5334$fFINBN 952 $a10 P.T. 434$b857 DIS$fDINEL 959 $aDINST 959 $aFINBN 959 $aDINEL 996 $aFamosi Softest$9325846 997 $aUNINA LEADER 02840nam 22004573 450 001 9910861988203321 005 20230817184955.0 010 $a1-4503-7273-2 035 $a(CKB)4100000011919185 035 $a(MiAaPQ)EBC6954891 035 $a(Au-PeEL)EBL6954891 035 $a(OCoLC)1314618454 035 $a(EXLCZ)994100000011919185 100 $a20220421d2019 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aConcurrency 210 1$aSan Rafael :$cMorgan & Claypool Publishers,$d2019. 210 4$d©2019. 215 $a1 online resource (367 pages) 327 $aIntro -- Contents -- Preface -- Photo and Text Credits -- Introduction -- The Computer Science of Concurrency: The Early Years -- PART I. TECHNICAL PERSPECTIVES ON LAMPORT'SWORK -- 1. Shared Memory and the Bakery Algorithm -- 2. The Notions of Time and Global State in a Distributed System -- 3. Byzantine Faults -- 4. State Machine Replication with Benign Failures -- 5. Formal Specification and Verification -- 6. Biography -- PART II. SELECTED PAPERS -- A New Solution of Dijkstra's Concurrent Programming Problem -- Clocks, and the Ordering of Events in a Distributed System -- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs -- The Byzantine Generals Problem -- The Mutual Exclusion Problem: Part I-A Theory of Interprocess Communication -- The Mutual Exclusion Problem: Part II-Statement and Solutions -- The Part-Time Parliament -- References -- Index -- Biographies -- Blank Page. 330 $aThis book is a celebration of Leslie Lamport's work on concurrency, interwoven in four-and-a-half decades of an evolving industry: from the introduction of the first personal computer to an era when parallel and distributed multiprocessors are abundant. His works lay formal foundations for concurrent computations executed by interconnected computers. Some of the algorithms have become standard engineering practice for fault tolerant distributed computing - distributed systems that continue to function correctly despite failures of individual components. He also developed a substantial body of work on the formal specification and verification of concurrent systems, and has contributed to the development of automated tools applying these methods. 517 $aConcurrency 606 $aAlgorithms 606 $aComputer algorithms 606 $aComputer scientists 615 0$aAlgorithms. 615 0$aComputer algorithms. 615 0$aComputer scientists. 676 $a004.36 700 $aMalkhi$b Dahlia$01741586 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910861988203321 996 $aConcurrency$94167669 997 $aUNINA