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 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Distributed Algorithms [[electronic resource] ] : 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings / / edited by Jean-Claude Bermond, Michel Raynal |
Edizione | [1st ed. 1989.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
Descrizione fisica | 1 online resource (VIII, 320 p.) |
Disciplina | 003.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Architecture, Computer
Computer communication systems Operating systems (Computers) Computers Algorithms Computer System Implementation Computer Communication Networks Operating Systems Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
ISBN | 3-540-46750-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Random leaders and random spanning trees -- Fault-tolerant critical section management in asynchronous networks -- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection -- Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm -- Combinatorics and geometry of consistent cuts : Application to concurrency theory -- Distributed fairness algorithms for local area networks with concurrent transmissions -- An efficient reliable ring protocol -- An efficient solution to the drinking philosophers problem and its extensions -- Highly concurrent logically synchronous multicast -- Reliable broadcast in synchronous and asynchronous environments (preliminary version) -- Observing global states of asynchronous distributed applications -- Building a global time on parallel machines -- Functional dependencies of variables in wait-free programs -- Two strategies for solving the vertex cover problem on a transputer network -- Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction -- Simple and efficient election algorithms for anonymous networks -- A distributed solution for detecting deadlock in distributed nested transaction systems -- Distributed deadlock detection and resolution with probes -- A new algorithm to implement causal ordering -- Symmetry breaking in asynchronous rings with o(n) messages -- Designing distributed algorithms by means of formal sequentially phased reasoning -- Possibility and impossibility results in a shared memory environment -- Communication heuristics in distributed combinatorial search algorithms -- The role of inhibition in asynchronous consistent-cut protocols -- How to construct an atomic variable (extended abstract) -- Electing a leader when processor identity numbers are not distinct (extended abstract). |
Record Nr. | UNISA-996465728403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Distributed Computing and Networking [[electronic resource] ] : 14th International Conference, ICDCN 2013, Mumbai, India, January 3-6, 2013. Proceedings / / edited by Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, Prasun Sinha |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 466 p. 121 illus.) |
Disciplina | 004/.36 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Computer programming Software engineering Data protection Algorithms Application software Computer Communication Networks Programming Techniques Software Engineering Data and Information Security Computer and Information Systems Applications |
ISBN | 3-642-35668-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Distributed algorithms and concurrent data structures -- Integration of heterogeneous wireless and wired networks -- Distributed operating systems -- Internetworking protocols and internet applications -- Distributed database systems -- Mobile and pervasive computing, context-aware distributed systems -- Embedded distributed systems -- Next generation and converged network architectures -- Experiments and performance evaluation of distributed systems -- Overlay and peer-to-peer networks and services -- Fault-tolerance, reliability, and availability -- Home networking and services -- Multiprocessor and multi-core architectures and algorithms -- Resource management and quality of service -- Self-organization, self-stabilization, and autonomic computing -- Network security and privacy -- High performance computing, grid computing, and cloud computing -- Energy-efficient networking and smart grids -- Security, cryptography, and game theory in distributed systems -- Sensor, PAN and ad-hoc networks -- Traffic engineering, pricing, network management. |
Record Nr. | UNISA-996465930003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Distributed Computing and Networking [[electronic resource] ] : 14th International Conference, ICDCN 2013, Mumbai, India, January 3-6, 2013. Proceedings / / edited by Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, Prasun Sinha |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 466 p. 121 illus.) |
Disciplina | 004/.36 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Computer programming Software engineering Data protection Algorithms Application software Computer Communication Networks Programming Techniques Software Engineering Data and Information Security Computer and Information Systems Applications |
ISBN | 3-642-35668-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Distributed algorithms and concurrent data structures -- Integration of heterogeneous wireless and wired networks -- Distributed operating systems -- Internetworking protocols and internet applications -- Distributed database systems -- Mobile and pervasive computing, context-aware distributed systems -- Embedded distributed systems -- Next generation and converged network architectures -- Experiments and performance evaluation of distributed systems -- Overlay and peer-to-peer networks and services -- Fault-tolerance, reliability, and availability -- Home networking and services -- Multiprocessor and multi-core architectures and algorithms -- Resource management and quality of service -- Self-organization, self-stabilization, and autonomic computing -- Network security and privacy -- High performance computing, grid computing, and cloud computing -- Energy-efficient networking and smart grids -- Security, cryptography, and game theory in distributed systems -- Sensor, PAN and ad-hoc networks -- Traffic engineering, pricing, network management. |
Record Nr. | UNINA-9910483888903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Networked Systems [[electronic resource] ] : Second International Conference, NETYS 2014, Marrakech, Morocco, May 15-17, 2014. Revised Selected Papers / / edited by Guevara Noubir, Michel Raynal |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XV, 348 p. 110 illus.) |
Disciplina | 004.6 |
Collana | Computer Communication Networks and Telecommunications |
Soggetto topico |
Computer communication systems
Algorithms Computer Communication Networks Algorithm Analysis and Problem Complexity |
ISBN | 3-319-09581-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Multi-core architectures -- Concurrent and distributed algorithms -- Middleware environments -- Storage clusters -- Social networks -- Peer-to-peer networks -- Sensor networks -- Wireless and mobile networks. |
Record Nr. | UNINA-9910483974303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Networked Systems [[electronic resource] ] : Second International Conference, NETYS 2014, Marrakech, Morocco, May 15-17, 2014. Revised Selected Papers / / edited by Guevara Noubir, Michel Raynal |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XV, 348 p. 110 illus.) |
Disciplina | 004.6 |
Collana | Computer Communication Networks and Telecommunications |
Soggetto topico |
Computer communication systems
Algorithms Computer Communication Networks Algorithm Analysis and Problem Complexity |
ISBN | 3-319-09581-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Multi-core architectures -- Concurrent and distributed algorithms -- Middleware environments -- Storage clusters -- Social networks -- Peer-to-peer networks -- Sensor networks -- Wireless and mobile networks. |
Record Nr. | UNISA-996198268203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Principles of Distributed Systems [[electronic resource] ] : 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings / / edited by Tarek F. Abdelzaher, Michel Raynal, Nicola Santoro |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 373 p.) |
Disciplina | 004.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Computer programming User interfaces (Computer systems) Human-computer interaction Computer engineering Electronic data processing—Management Computer Communication Networks Programming Techniques User Interfaces and Human Computer Interaction Computer Engineering and Networks IT Operations |
ISBN | 3-642-10877-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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. |
Record Nr. | UNISA-996465895203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Principles of Distributed Systems [[electronic resource] ] : 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings / / edited by Tarek F. Abdelzaher, Michel Raynal, Nicola Santoro |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 373 p.) |
Disciplina | 004.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Computer programming User interfaces (Computer systems) Human-computer interaction Computer engineering Electronic data processing—Management Computer Communication Networks Programming Techniques User Interfaces and Human Computer Interaction Computer Engineering and Networks IT Operations |
ISBN | 3-642-10877-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited 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. |
Record Nr. | UNINA-9910484650803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Structural Information and Communication Complexity [[electronic resource] ] : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings / / edited by Andrzej Pelc, Michel Raynal |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (X, 323 p.) |
Disciplina | 004.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry. |
Record Nr. | UNISA-996465718703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Structural Information and Communication Complexity [[electronic resource] ] : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings / / edited by Andrzej Pelc, Michel Raynal |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (X, 323 p.) |
Disciplina | 004.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer networks
Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry. |
Record Nr. | UNINA-9910767510003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|