Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Distributed Computing [[electronic resource] ] : 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009, Proceedings / / edited by Idit Keidar
| Distributed Computing [[electronic resource] ] : 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009, Proceedings / / edited by Idit Keidar |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XV, 532 p.) |
| Disciplina | 004.3622gerDNB |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer programming Software engineering Algorithms Artificial intelligence—Data processing Computers, Special purpose Computer Communication Networks Programming Techniques Software Engineering Data Science Special Purpose and Application-Based Systems |
| ISBN | 3-642-04355-0 |
| Classificazione |
DAT 250f
DAT 516f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The 2009 Edsger W. Dijkstra Prize in Distributed Computing -- The 2009 Edsger W. Dijkstra Prize in Distributed Computing -- Michel Raynal and Shmuel Zaks 60th Birthday Symposium -- Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement! -- What Agreement Problems Owe Michel -- Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing -- Shmuel Zaks - The Mathematician, Computer Scientist and Personality -- Award Nominees (Session 2B) -- The Disagreement Power of an Adversary -- New Bounds for the Controller Problem -- On Set Consensus Numbers -- The Abstract MAC Layer -- Randomization Can Be a Healer: Consensus with Dynamic Omission Failures -- Transactional Memory (Session 1A) -- Interrupting Snapshots and the Java Size() Method -- Elastic Transactions -- Brief Announcement: Transactional Scheduling for Read-Dominated Workloads -- Shared Memory (Session 1B) -- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus -- The RedBlue Adaptive Universal Constructions -- Help When Needed, But No More: Efficient Read/Write Partial Snapshot -- Contention-Sensitive Data Structures and Algorithms -- Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms -- Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset -- Distributed and Local Graph Algorithms (Session 1C) -- Local Computation of Nearly Additive Spanners -- A Local 2-Approximation Algorithm for the Vertex Cover Problem -- Distributed Discovery of Large Near-Cliques -- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality -- Brief Announcement: Decidable Graph Languages by Mediated Population Protocols -- Brief Announcement: Towards Secured Distributed Polling in Social Networks -- Modeling Issues (Session 1D) -- What Can Be Observed Locally? -- At-Most-Once Semantics in Asynchronous Shared Memory -- Nonblocking Algorithms and Backward Simulation -- Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction -- Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison -- Game Theory (Session 2A) -- Dynamics in Network Interaction Games -- Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers -- Failure Detectors (Session 2C) -- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion -- Crash-Quiescent Failure Detection -- The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity -- Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model -- Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems -- Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement -- From Theory to Practice (Session 3A) -- Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol -- Graph Algorithms and Routing (Session 3B) -- Compact Multicast Routing -- Compact Routing in Power-Law Graphs -- Virtual Ring Routing Trends -- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property -- Euler Tour Lock-In Problem in the Rotor-Router Model -- Consensus and Byzantine Agreement (Session 3C) -- Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle -- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement -- From Almost Everywhere to Everywhere: Byzantine Agreement with Bits -- Brief Announcement: A Leader-free Byzantine Consensus Algorithm -- Radio Networks (Session 3D) -- Efficient k-Shot Broadcasting in Radio Networks -- Keeping Mobile Robot Swarms Connected -- Consensus and Mutual Exclusion in a Multiple Access Channel -- Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks -- Brief Announcement: The Speed of Broadcasting in Random Networks – Density Does Not Matter. |
| Record Nr. | UNISA-996465630803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed computing : 23rd international symposium, DISC 2009, Elche, Spain, September 23-25, 2009, proceedings / / Idit Keidar (ed.)
| Distributed computing : 23rd international symposium, DISC 2009, Elche, Spain, September 23-25, 2009, proceedings / / Idit Keidar (ed.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (XV, 532 p.) |
| Disciplina | 004.3622gerDNB |
| Altri autori (Persone) | KeidarIdit |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Electronic data processing - Distributed processing
Computer science |
| ISBN | 3-642-04355-0 |
| Classificazione |
DAT 250f
DAT 516f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The 2009 Edsger W. Dijkstra Prize in Distributed Computing -- The 2009 Edsger W. Dijkstra Prize in Distributed Computing -- Michel Raynal and Shmuel Zaks 60th Birthday Symposium -- Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement! -- What Agreement Problems Owe Michel -- Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing -- Shmuel Zaks - The Mathematician, Computer Scientist and Personality -- Award Nominees (Session 2B) -- The Disagreement Power of an Adversary -- New Bounds for the Controller Problem -- On Set Consensus Numbers -- The Abstract MAC Layer -- Randomization Can Be a Healer: Consensus with Dynamic Omission Failures -- Transactional Memory (Session 1A) -- Interrupting Snapshots and the Java Size() Method -- Elastic Transactions -- Brief Announcement: Transactional Scheduling for Read-Dominated Workloads -- Shared Memory (Session 1B) -- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus -- The RedBlue Adaptive Universal Constructions -- Help When Needed, But No More: Efficient Read/Write Partial Snapshot -- Contention-Sensitive Data Structures and Algorithms -- Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms -- Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset -- Distributed and Local Graph Algorithms (Session 1C) -- Local Computation of Nearly Additive Spanners -- A Local 2-Approximation Algorithm for the Vertex Cover Problem -- Distributed Discovery of Large Near-Cliques -- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality -- Brief Announcement: Decidable Graph Languages by Mediated Population Protocols -- Brief Announcement: Towards Secured Distributed Polling in Social Networks -- Modeling Issues (Session 1D) -- What Can Be Observed Locally? -- At-Most-Once Semantics in Asynchronous Shared Memory -- Nonblocking Algorithms and Backward Simulation -- Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction -- Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison -- Game Theory (Session 2A) -- Dynamics in Network Interaction Games -- Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers -- Failure Detectors (Session 2C) -- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion -- Crash-Quiescent Failure Detection -- The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity -- Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model -- Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems -- Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement -- From Theory to Practice (Session 3A) -- Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol -- Graph Algorithms and Routing (Session 3B) -- Compact Multicast Routing -- Compact Routing in Power-Law Graphs -- Virtual Ring Routing Trends -- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property -- Euler Tour Lock-In Problem in the Rotor-Router Model -- Consensus and Byzantine Agreement (Session 3C) -- Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle -- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement -- From Almost Everywhere to Everywhere: Byzantine Agreement with Bits -- Brief Announcement: A Leader-free Byzantine Consensus Algorithm -- Radio Networks (Session 3D) -- Efficient k-Shot Broadcasting in Radio Networks -- Keeping Mobile Robot Swarms Connected -- Consensus and Mutual Exclusion in a Multiple Access Channel -- Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks -- Brief Announcement: The Speed of Broadcasting in Random Networks – Density Does Not Matter. |
| Record Nr. | UNINA-9910484860003321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing / / Calvin Newport, Idit Keidar
| Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing / / Calvin Newport, Idit Keidar |
| Autore | Newport Calvin |
| Pubbl/distr/stampa | New York NY : , : ACM, , 2018 |
| Descrizione fisica | 1 online resource (495 pages) |
| Disciplina | 005.1 |
| Soggetto topico | Software engineering |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910375966303321 |
Newport Calvin
|
||
| New York NY : , : ACM, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming / / Jeff Hollingsworth, Idit Keidar
| Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming / / Jeff Hollingsworth, Idit Keidar |
| Autore | Hollingsworth Jeffrey K. |
| Pubbl/distr/stampa | New York, NY, USA : , : ACM, , 2019 |
| Descrizione fisica | 1 online resource (472 pages) : illustrations |
| Disciplina | 005.375 |
| Collana | ACM Conferences. |
| Soggetto topico | Parallel programs (Computer programs) |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910375766003321 |
|
Hollingsworth Jeffrey K.
|
||
| New York, NY, USA : , : ACM, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||