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 Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer communication systems Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNISA-996465521903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer networks Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNINA-9910768453303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Algorithms [[electronic resource] ] : 10th International Workshop, WDAG '96, Bologna, Italy, October 9 - 11, 1996. Proceedings / / edited by Özalp Babaoglu, Keith Marzullo
| Distributed Algorithms [[electronic resource] ] : 10th International Workshop, WDAG '96, Bologna, Italy, October 9 - 11, 1996. Proceedings / / edited by Özalp Babaoglu, Keith Marzullo |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (VIII, 388 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer communication systems Computer programming Operating systems (Computers) Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Computation by Abstract Devices Programming Techniques Operating Systems |
| ISBN | 3-540-70679-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to build a highly available system using consensus -- Distributed admission control algorithms for real-time communication -- Randomization and failure detection: A hybrid approach to solve Consensus -- Levels of authentication in distributed agreement -- Efficient and robust sharing of memory in message-passing systems -- Plausible clocks: Constant size logical clocks for Distributed Systems -- Abstracting communication to reason about distributed algorithms -- Simulating reliable links with unreliable links in the presence of process crashes -- A cyclic distributed garbage collector for network objects -- Incremental, distributed orphan detection and actor garbage collection using graph partitioning and euler cycles -- A framework for the analysis of non-deterministic clock synchronisation algorithms -- Optimal time broadcasting in faulty star networks -- A lower bound for Linear Interval Routing -- Topological routing schemes -- Maintaining a dynamic set of processors in a distributed system -- Collective consistency -- Planar quorums -- “?-accurate” failure detectors -- Fast, long-lived renaming improved and simplified -- A timestamp based transformation of self-stabilizing programs for distributed computing environments -- The combinatorial structure of wait-free solvable tasks -- On the robustness of h m r -- Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation. |
| Record Nr. | UNISA-996465868603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings / / edited by Jean-Michel Helary, Michel Raynal
| Distributed Algorithms [[electronic resource] ] : 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings / / edited by Jean-Michel Helary, Michel Raynal |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XII, 340 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer programming Algorithms Computer communication systems Computation by Abstract Devices Theory of Computation Software Engineering/Programming and Operating Systems Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks |
| ISBN | 3-540-44783-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The triumph and tribulation of system stabilization -- Wait-free computing -- On real-time and non real-time distributed computing -- Theory and practice in distributed systems -- The inherent cost of strong-partial view-synchronous communication -- Revisiting the relationship between non-blocking atomic commitment and consensus -- Dissecting distributed coordination -- Optimal Broadcast with Partial Knowledge -- Multi-dimensional Interval Routing Schemes -- Data transmission in processor networks -- Distributed protocols against mobile eavesdroppers -- Universal constructions for large objects -- Load balancing: An exercise in constrained convergence -- Larchant-RDOSS: A distributed shared persistent memory and its garbage collector -- Broadcasting in hypercubes with randomly distributed Byzantine faults -- On the number of authenticated rounds in Byzantine Agreement -- Total ordering algorithms for asynchronous Byzantine systems -- A uniform self-stabilizing minimum diameter spanning tree algorithm -- Self-stabilization of wait-free shared memory objects -- Deterministic, constant space, self-stabilizing leader election on uniform rings -- Efficient detection of restricted classes of global predicates -- Faster possibility detection by combining two approaches. |
| Record Nr. | UNISA-996466151103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / / edited by Gerard Tel, Paul Vitanyi
| Distributed Algorithms [[electronic resource] ] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / / edited by Gerard Tel, Paul Vitanyi |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 378 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer programming Algorithms Computer communication systems Theory of Computation Software Engineering/Programming and Operating Systems Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks |
| ISBN | 3-540-48799-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Replicated file management in large-scale distributed systems -- Realization of PRAMs: Processor design -- Factoring -- Primary partition “Virtually-synchronous communication” harder than consensus -- Secure distributed computing: Theory and practice -- Fast increment registers -- Coping with contention -- Exotic behaviour of consensus numbers -- Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable -- Linear-time snapshot using multi-writer multi-reader registers -- Fast, long-lived renaming -- Anomalies in the wait-free hierarchy -- Finding the extrema of a distributed multiset -- The level of handshake required for establishing a connection -- Local labeling and resource allocation using preprocessing -- A scalable approach to routing in ATM networks -- Low complexity network synchronization -- An incremental distributed algorithm for computing biconnected components -- Reaching (and maintaining) agreement in the presence of mobile faults -- Uniform deterministic self-stabilizing ring-orientation on odd-length rings -- Using failure detectors to solve consensus in asynchronous shared-memory systems -- An algorithm with optimal failure locality for the dining philosophers problem -- Average and randomized complexity of distributed problems -- Self-stabilization by local checking and global reset -- Breakpoints and time in distributed computations -- Cheaper matrix clocks. |
| Record Nr. | UNISA-996466132103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed algorithms : Lausanne, Switzerland, September 1993 : proccedings / André Schiper (ed.)
| Distributed algorithms : Lausanne, Switzerland, September 1993 : proccedings / André Schiper (ed.) |
| Pubbl/distr/stampa | Berlin [etc.] : Springer-Verlag, copyr. 1993 |
| Descrizione fisica | VIII, 323 p. : ill. ; 24 cm |
| Disciplina | 00512 |
| Collana | Lecture notes in computer science |
| Soggetto non controllato |
algoritmi - congressi - 1993
archivi di dati - congressi - 1993 congressi - losanna - 1993 elaborazione distribuita - congressi - 1993 |
| ISBN | 3-540-57271-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000204200203316 |
| Berlin [etc.] : Springer-Verlag, copyr. 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 7th International Workshop, WDAG `93, Lausanne, Switzerland, September 27-29, 1993. Proceedings / / edited by Andre Schiper
| Distributed Algorithms [[electronic resource] ] : 7th International Workshop, WDAG `93, Lausanne, Switzerland, September 27-29, 1993. Proceedings / / edited by Andre Schiper |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Algorithms Computer communication systems Operating systems (Computers) Theory of Computation Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks Operating Systems |
| ISBN | 3-540-48029-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient wait-free implementation of a concurrent priority queue -- Binary snapshots -- Linear-time snapshot protocols for unbalanced systems -- Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract) -- Efficient algorithms for checking the atomicity of a run of read and write operations -- Benign failure models for shared memory -- Generalized agreement between concurrent fail-stop processes -- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract) -- Asynchronous epoch management in replicated databases -- Crash resilient communication in dynamic networks -- Distributed job scheduling using snapshots -- Optimal time self stabilization in dynamic systems -- Tolerating transient and permanent failures (extended abstract) -- Quick atomic broadcast -- Time bounds for decision problems in the presence of timing uncertainty and failures -- Boolean Routing -- Notes on sorting and counting networks (extended abstract) -- A simple, efficient algorithm for maximum finding on rings -- Wang tilings and distributed orientation on anonymous torus networks (extended abstract) -- Fairness of N-party synchronization and its implementation in a distributed environment -- Programming distributed reactive systems: A strong and weak synchronous coupling -- Using message semantics to reduce rollback in the time warp mechanism. |
| Record Nr. | UNISA-996465890803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed algorithms : Delphi, Greece, October 7-9, 1991 : proceedings / S. Toueg (ed.)
| Distributed algorithms : Delphi, Greece, October 7-9, 1991 : proceedings / S. Toueg (ed.) |
| Pubbl/distr/stampa | Berlin [etc.] : Springer-Verlag, copyr. 1992 |
| Descrizione fisica | X, 318 p. : ill. ; 25 cm |
| Disciplina | 00512 |
| Collana | Lecture notes in computer science |
| Soggetto non controllato |
algoritmi - congressi - 1991
congressi - delphi - 1991 elaboratori elettronici - programmazione - congressi - 1991 |
| ISBN | 3-540-55236-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000203100203316 |
| Berlin [etc.] : Springer-Verlag, copyr. 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings / / edited by Sam Toueg, Paul G. Spirakis, Lefteris Kirousis
| Distributed Algorithms [[electronic resource] ] : 5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings / / edited by Sam Toueg, Paul G. Spirakis, Lefteris Kirousis |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (X, 326 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematics Software engineering Computer programming Algorithms Theory of Computation Mathematics, general Software Engineering/Programming and Operating Systems Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-46789-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the limitation of the global time assumption in distributed systems -- Causal memory -- More on the power of random walks: Uniform self-stabilizing randomized algorithms -- Pseudo read-modify-write operations: Bounded wait-free implementations -- Maintaining digital clocks in step -- Implementing FIFO queues and stacks -- Optimal amortized distributed consensus -- Optimally simulating crash failures in a byzantine environment -- Efficient distributed consensus with n=(3 + ?)t processors -- Randomized consensus in expected O(n2log n) operations -- Using adaptive timeouts to achieve at-most-once message delivery -- Uniform dynamic self-stabilizing leader election -- The quickest path problem in distributed computing systems -- The communication complexity of the two list problem -- Distributed algorithms for updating shortest paths -- Minimal shared information for concurrent reading and writing -- Reading many variables in one atomic operation solutions with linear or sublinear complexity -- Analysis of distributed algorithms based on recurrence relations -- Detection of global state predicates -- Using consistent subcuts for detecting stable properties -- Atomic m-register operations -- A robust distributed mutual exclusion algorithm -- Message delaying synchronizers. |
| Record Nr. | UNISA-996465656303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings / / edited by Adrian Segall, Shmuel Zaks
| Distributed Algorithms [[electronic resource] ] : 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings / / edited by Adrian Segall, Shmuel Zaks |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (X, 382 p.) |
| Disciplina | 004/.36/015118 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Algorithms Computer communication systems Operating systems (Computers) Theory of Computation Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks Operating Systems |
| ISBN | 3-540-47484-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sparser: A paradigm for running distributed algorithms -- Closed schedulers: Constructions and applications to consensus protocols -- Efficient atomic snapshots using lattice agreement -- Choice coordination with multiple alternatives (preliminary version) -- Some results on the impossibility, universality, and decidability of consensus -- Wait-free test-and-set -- A concurrent time-stamp scheme which is linear in time and space -- Tentative and definite distributed computations: An optimistic approach to network synchronization -- Semisynchrony and real time -- Optimal time Byzantine agreement for t /8 with linear messages -- A continuum of failure models for distributed computing -- Simulating crash failures with many faulty processors (extended abstract) -- An efficient topology update protocol for dynamic networks -- Memory adaptive self-stabilizing protocols (extended abstract) -- Optimal early stopping in distributed consensus -- Traffic-light scheduling on the grid -- Distributed computing on anonymous hypercubes with faulty components -- Message terminate algorithms for anonymous rings of unknown size -- Distributed resource allocation algorithms -- Membership algorithms for multicast communication groups -- The granularity of waiting (extended Abstract) -- The cost of order in asynchronous systems -- Efficient, strongly consistent implementations of shared memory -- Optimal primary-backup protocols. |
| Record Nr. | UNISA-996465489903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
