LEADER 01386nam0 22003011i 450 001 UON00429322 005 20231205104900.621 100 $a20130731d1967 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aDavid e la pittura napoleonica$fdi Alvar Gonzalez-Palacios 210 $aMilano$cFabbri$d©1967 215 $a100 p.$cill.$d31 cm 316 $aDono Prof. Naldi$5IT-UONSI ARTEO.C.07/(18) 410 1$1001UON00429303$12001 $aMensili d'arte$escuole, movimenti, personalitą della pittura moderna$1210 $aMilano$cFabbri.$v18 606 $aPITTURA FRANCESE$xSec. 19.$3UONC084457$2FI 606 $aDAVID JACQUES LOUIS$3UONC084458$2FI 620 $aIT$dMilano$3UONL000005 676 $a759.4$cPittura. Storia, geografia, persone. Francia$v21 700 1$aGONZALEZ-PALACIOS$bAlvar$3UONV217619$0384460 712 $aFratelli Fabbri$3UONV246758$4650 801 $aIT$bSOL$c20240220$gRICA 912 $aUON00429322 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI ARTE '800 029 $eSI LO 5182 7 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI ARTE O.C. 07 (18) $eSI 6421 7 (18) Dono Prof. Naldi 996 $aDavid e la pittura napoleonica$9267435 997 $aUNIOR LEADER 05557nam 22008055 450 001 9910484650803321 005 20251226200407.0 010 $a3-642-10877-6 024 7 $a10.1007/978-3-642-10877-8 035 $a(CKB)1000000000812691 035 $a(SSID)ssj0000355587 035 $a(PQKBManifestationID)11233503 035 $a(PQKBTitleCode)TC0000355587 035 $a(PQKBWorkID)10340371 035 $a(PQKB)10983223 035 $a(DE-He213)978-3-642-10877-8 035 $a(MiAaPQ)EBC3064907 035 $a(PPN)139963049 035 $a(EXLCZ)991000000000812691 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aPrinciples of Distributed Systems $e13th International Conference, OPODIS 2009, Nīmes, France, December 15-18, 2009. Proceedings /$fedited by Tarek F. Abdelzaher, Michel Raynal, Nicola Santoro 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 373 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5923 300 $aInternational conference proceedings. 311 08$a3-642-10876-8 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Transactional Memory Today: A Status Report -- Navigating the Web 2.0 with Gossple -- Distributed Scheduling -- Transactional Scheduling for Read-Dominated Workloads -- Performance Evaluation of Work Stealing for Streaming Applications -- Not All Fair Probabilistic Schedulers Are Equivalent -- Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory -- Distributed Robotics -- Byzantine Convergence in Robot Networks: The Price of Asynchrony -- Deaf, Dumb, and Chatting Asynchronous Robots -- Synchronization Helps Robots to Detect Black Holes in Directed Graphs -- Fault and Failure Detection -- The Fault Detection Problem -- The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems -- Enhanced Fault-Tolerance through Byzantine Failure Detection -- Wireless and Social Networks -- Decentralized Polling with Respectable Participants -- Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks -- Adversarial Multiple Access Channel with Individual Injection Rates -- Synchronization -- NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures -- Gradient Clock Synchronization Using Reference Broadcasts -- Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction -- Storage Systems -- On the Impact of Serializing Contention Management on STM Performance -- On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory -- Abortable Fork-Linearizable Storage -- Distributed Agreement -- On the Computational Power of Shared Objects -- Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement -- Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency -- Distributed Algorithms -- Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground -- Proactive Fortification of Fault-Tolerant Services -- Robustness of the Rotor-router Mechanism -- Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm -- Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. 330 $aThis book constitutes the refereed proceedings of the 13th International Conference on Principles of Distributed Systems, OPODIS 2009, held in Nimes, France, in December 2009. The 23 full papers and 4 short papers presented were carefully reviewed and selected from 72 submissions. The papers are organized in topical sections on distributed scheduling, distributed robotics, fault and failure detection, wireless and social networks, synchronization, storage systems, distributed agreement, and distributed algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5923 606 $aComputer networks 606 $aComputer programming 606 $aUser interfaces (Computer systems) 606 $aHuman-computer interaction 606 $aComputer engineering 606 $aElectronic data processing$xManagement 606 $aComputer Communication Networks 606 $aProgramming Techniques 606 $aUser Interfaces and Human Computer Interaction 606 $aComputer Engineering and Networks 606 $aIT Operations 615 0$aComputer networks. 615 0$aComputer programming. 615 0$aUser interfaces (Computer systems). 615 0$aHuman-computer interaction. 615 0$aComputer engineering. 615 0$aElectronic data processing$xManagement. 615 14$aComputer Communication Networks. 615 24$aProgramming Techniques. 615 24$aUser Interfaces and Human Computer Interaction. 615 24$aComputer Engineering and Networks. 615 24$aIT Operations. 676 $a004.6 701 $aAbdelzaher$b Tarek$0880932 701 $aRaynal$b M$g(Michel)$059942 701 $aSantoro$b N$g(Nicola),$f1951-$0968033 712 12$aOPODIS 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484650803321 996 $aPrinciples of Distributed Systems$94193523 997 $aUNINA