IBM eServer xSeries and BladeCenter Server management [[electronic resource] /] / David Watts, Lesley Bain, Christian Leitenberger |
Autore | Watts David |
Edizione | [1st ed.] |
Pubbl/distr/stampa | Research Triangle Park, N.C., : IBM Corp., International Technical Support Organization, c2005 |
Descrizione fisica | 1 online resource (318 p.) |
Disciplina | 004.6/186 |
Collana | Redbooks |
Soggetto topico |
Client/server computing - Management
IBM computers Computer architecture |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910783464303321 |
Watts David | ||
Research Triangle Park, N.C., : IBM Corp., International Technical Support Organization, c2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 14th International Symposium, SSS 2012, Toronto, Canada, October 1-4, 2012, Proceedings / / edited by Andréa W. Richa, Christian Scheideler |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XIX, 330 p. 70 illus.) |
Disciplina | 004.6/186 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Software engineering Application software Computer science Algorithms Data protection Computer Communication Networks Software Engineering Computer and Information Systems Applications Computer Science Logic and Foundations of Programming Data and Information Security |
ISBN | 3-642-33536-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Communication-Efficient Self-stabilization in Wireless Networks -- Self-stabilizing Local k-Placement of Replicas with Minimal Variance -- Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles -- Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults -- Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network -- On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings -- Optimal Grid Exploration by Asynchronous Oblivious Robots -- Terminating Population Protocols via Some Minimal Global Knowledge Assumptions -- Brief Announcement: The Degrading Effect of Forgetting on a Synchronizer -- Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings -- High-Level Executable Specifications of Distributed Algorithms -- Formal Verification of Security Preservation for Migrating Virtual Machines in the Cloud -- Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback -- Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks (Extended Abstract) -- Self-stabilizing Distributed Data Fusion -- From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering -- Brief Announcement: Verification of Stabilizing Programs with SMT Solvers -- Brief Announcement: MP-State: State-Aware Software Model Checking of Message-Passing Systems -- Oblivious Assignment with m Slots -- BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters -- DQMP: A Decentralized Protocol to Enforce Global Quotas in Cloud Environments -- Brief Announcement: KARYON: Towards Safety Kernels for Cooperative Vehicular Systems -- Brief Announcement: Arbitrators in the Security Infrastructure -- Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems -- Scalable Byzantine Agreement with a Random Beacon -- On Finding Better Friends in Social Networks -- Brief Announcement: Detecting Users’ Connectivity on Online Social Networks -- Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols -- All-to-All Gradecast Using Coding with Byzantine Failures -- Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents -- A Theory of Fault Recovery for Component-Based Models. |
Record Nr. | UNISA-996466184603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|