標(biāo)題: Titlebook: Distributed Computing; 22nd International S Gadi Taubenfeld Conference proceedings 2008 The Editor(s) (if applicable) and The Author(s), un [打印本頁] 作者: 有作用 時(shí)間: 2025-3-21 17:16
書目名稱Distributed Computing影響因子(影響力)
作者: 說笑 時(shí)間: 2025-3-21 22:38 作者: 碌碌之人 時(shí)間: 2025-3-22 01:19
How to Solve Consensus in the Smallest Window of Synchronym? In answer to this question, we present the first optimally-resilient algorithm . that solves consensus . in an eventually synchronous system, i.e., a system that from some time . onwards, delivers messages in a timely fashion. . guarantees that, in an execution with at most . failures, every proc作者: 花費(fèi) 時(shí)間: 2025-3-22 05:39
Local Terminations and Distributed Computability in Anonymous Networkstable with ., i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study ., that is when a node knows its final value but continues to execute the distributed algorithm, usually in order to provide infor作者: 樂器演奏者 時(shí)間: 2025-3-22 11:29
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ringf mutual exclusion on a ring of processors. In this work we present a new three state self-stabilizing algorithm for mutual exclusion, with a tight bound of . for the worst case complexity, which is the number of moves of the algorithm until it stabilizes. This bound is better than lower bounds of o作者: 躺下殘殺 時(shí)間: 2025-3-22 15:03
Fast Distributed Approximations in Planar Graphstching, and a minimum dominating set. The algorithms run in .(log.|.|) rounds. In addition, we prove that no faster deterministic approximation is possible and show that if randomization is allowed it is possible to beat the lower bound for deterministic algorithms.作者: 躺下殘殺 時(shí)間: 2025-3-22 18:55 作者: 擴(kuò)音器 時(shí)間: 2025-3-22 21:33
The Weakest Failure Detector for Message Passing Set-Agreement this problem in a message-passing system where processes may fail by crashing. This failure detector, called the . detector and denoted ., outputs one of two values, . or . such that: (1) there is at least one process where . outputs always ., and (2) if only one process is correct, . eventually ou作者: enterprise 時(shí)間: 2025-3-23 02:16 作者: Ceremony 時(shí)間: 2025-3-23 06:35
: Resilient Random Regular Graphse presence of node additions and deletions. They must also have high resilience (connectivity). Typically, algorithms use offline techniques to build regular graphs with strict bounds on resilience and such techniques are not designed to maintain these properties in the presence of online additions,作者: Amplify 時(shí)間: 2025-3-23 09:58
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametricsly, however, there has been considerable interest in using metric embeddings in the context of networks to allow network nodes to have more knowledge of the pairwise distances between other nodes in the network. There has also been evidence that natural network metrics like latency and bandwidth hav作者: 貪婪的人 時(shí)間: 2025-3-23 17:16 作者: 尖叫 時(shí)間: 2025-3-23 18:26
Optimistic Erasure-Coded Distributed Storagey to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate implementations, ORCAS-A and ORCAS-B. In terms of storage space used, ORCAS-A is more efficient in systems where we expect large number of concurrent wri作者: harpsichord 時(shí)間: 2025-3-24 00:48
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output QueuingCIOQ switch have buffer capacity .?≥?1 packets at every output. We analyze the resource requirements of CIOQ policies in terms of the required fabric speedup and the additional buffer capacity needed at the CIOQ inputs..For the family of work-conserving scheduling algorithms, we find that whereas ev作者: HEED 時(shí)間: 2025-3-24 06:17 作者: Psychogenic 時(shí)間: 2025-3-24 09:53 作者: 全等 時(shí)間: 2025-3-24 13:48
Deterministic Rendezvous in Trees with Little Memoryor two identical agents moving from node to node along the edges of an unknown anonymous connected graph. The rendezvous problem is unsolvable in the class of arbitrary connected graphs, as witnessed by the example of the cycle. Hence we restrict attention to rendezvous in trees, where rendezvous is作者: 耕種 時(shí)間: 2025-3-24 17:48 作者: 該得 時(shí)間: 2025-3-24 23:01
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Rangeslane (..) and each of them can transmit within some range . assigned to it. We adopt model in which ranges of nodes are non-uniform and they are drawn from the predefined interval 0?≤?..?≤?... All our results are in the . where a receiving node must be in the range of exactly one transmitting node i作者: Affectation 時(shí)間: 2025-3-24 23:57 作者: BRINK 時(shí)間: 2025-3-25 07:02 作者: CRAFT 時(shí)間: 2025-3-25 10:32 作者: 替代品 時(shí)間: 2025-3-25 15:31
Gareth P. Dyas,Heinz T. Thanheiser this problem in a message-passing system where processes may fail by crashing. This failure detector, called the . detector and denoted ., outputs one of two values, . or . such that: (1) there is at least one process where . outputs always ., and (2) if only one process is correct, . eventually outputs . at this process.作者: 滑動 時(shí)間: 2025-3-25 16:13
https://doi.org/10.1007/978-3-540-87779-0Byzantine processes; Routing; Switch; ad-hoc networks; algorithms; approximation algorithms; autonomous ro作者: intoxicate 時(shí)間: 2025-3-25 20:05
978-3-540-87778-3The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE作者: 釘牢 時(shí)間: 2025-3-26 02:59
The Mailbox Problem, a postman delivers letters to the mailbox of a housewife and uses a flag to signal a non-empty mailbox. The wife must remove all letters delivered to the mailbox and should not walk to the mailbox if it is empty. We present algorithms and an impossibility result for this problem.作者: fiscal 時(shí)間: 2025-3-26 07:42 作者: 易彎曲 時(shí)間: 2025-3-26 09:22
The Weakest Failure Detector for Message Passing Set-Agreement this problem in a message-passing system where processes may fail by crashing. This failure detector, called the . detector and denoted ., outputs one of two values, . or . such that: (1) there is at least one process where . outputs always ., and (2) if only one process is correct, . eventually outputs . at this process.作者: Minutes 時(shí)間: 2025-3-26 13:40 作者: comely 時(shí)間: 2025-3-26 19:44 作者: disparage 時(shí)間: 2025-3-26 21:28
The Emerging Digital Economy: Conclusionsm? In answer to this question, we present the first optimally-resilient algorithm . that solves consensus . in an eventually synchronous system, i.e., a system that from some time . onwards, delivers messages in a timely fashion. . guarantees that, in an execution with at most . failures, every proc作者: Curmudgeon 時(shí)間: 2025-3-27 03:35
Spatial Clusters of ICT Industriestable with ., i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study ., that is when a node knows its final value but continues to execute the distributed algorithm, usually in order to provide infor作者: 圓桶 時(shí)間: 2025-3-27 09:10
Martin Andersson,Johan Klaessonf mutual exclusion on a ring of processors. In this work we present a new three state self-stabilizing algorithm for mutual exclusion, with a tight bound of . for the worst case complexity, which is the number of moves of the algorithm until it stabilizes. This bound is better than lower bounds of o作者: indigenous 時(shí)間: 2025-3-27 10:18
Gareth P. Dyas,Heinz T. Thanheisertching, and a minimum dominating set. The algorithms run in .(log.|.|) rounds. In addition, we prove that no faster deterministic approximation is possible and show that if randomization is allowed it is possible to beat the lower bound for deterministic algorithms.作者: 教唆 時(shí)間: 2025-3-27 17:16
Gareth P. Dyas,Heinz T. Thanheiserso one by one, in a fair order. In this paper, we close the complexity gap between FCFS ME and ME in the asynchronous shared memory model where processes communicate using atomic reads and writes only, and do not fail. Our main result is the first known FCFS ME algorithm that makes .(log.) remote me作者: 搖曳的微光 時(shí)間: 2025-3-27 19:12 作者: Evacuate 時(shí)間: 2025-3-27 22:02 作者: 1FAWN 時(shí)間: 2025-3-28 05:50
The Emigrant Communities of Latviae presence of node additions and deletions. They must also have high resilience (connectivity). Typically, algorithms use offline techniques to build regular graphs with strict bounds on resilience and such techniques are not designed to maintain these properties in the presence of online additions,作者: 玩笑 時(shí)間: 2025-3-28 08:24
The Emigrant Communities of Latvialy, however, there has been considerable interest in using metric embeddings in the context of networks to allow network nodes to have more knowledge of the pairwise distances between other nodes in the network. There has also been evidence that natural network metrics like latency and bandwidth hav作者: 廢止 時(shí)間: 2025-3-28 12:24
Oliver Baumann,Jason B. Mattingleyesearches have investigated the . in the presence of a ..-local . adversary. The local adversary cannot control more than .. neighbors of any given node. This paper proves sufficient conditions as to when the synchronous .. can be solved in the presence of a ..-local adversary..Moreover, we show tha作者: 供過于求 時(shí)間: 2025-3-28 16:50 作者: paleolithic 時(shí)間: 2025-3-28 20:34 作者: 歡笑 時(shí)間: 2025-3-29 00:20 作者: Inferior 時(shí)間: 2025-3-29 03:15
https://doi.org/10.1007/978-94-011-2552-9ity is exactly the same. More precisely, we prove that a team of . asynchronous agents, each endowed with a single identical pebble (that can be placed only on nodes, and with no more than one pebble per node) can locate the black hole in an arbitrary network of known topology; this can be done with作者: catagen 時(shí)間: 2025-3-29 10:47 作者: Thyroxine 時(shí)間: 2025-3-29 11:35 作者: Arctic 時(shí)間: 2025-3-29 17:42 作者: 接觸 時(shí)間: 2025-3-29 20:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281783.jpg作者: licence 時(shí)間: 2025-3-30 01:35
How to Solve Consensus in the Smallest Window of Synchrony a system that from some time . onwards, delivers messages in a timely fashion. . guarantees that, in an execution with at most . failures, every process decides no later than round . + .?+?2, which is optimal.作者: 極大痛苦 時(shí)間: 2025-3-30 06:50 作者: Tremor 時(shí)間: 2025-3-30 09:23
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokensd only on nodes, and with no more than one pebble per node) can locate the black hole in an arbitrary network of known topology; this can be done with .(. log.) moves, where . is the number of nodes, even when the links are not FIFO.作者: 補(bǔ)充 時(shí)間: 2025-3-30 14:09 作者: 歌曲 時(shí)間: 2025-3-30 20:09 作者: Impugn 時(shí)間: 2025-3-30 21:02 作者: 闡明 時(shí)間: 2025-3-31 01:55
Local Terminations and Distributed Computability in Anonymous Networksmation to other nodes..We give the first characterization of distributed tasks that can be computed with weak local termination and we present a new characterization of tasks computed with local termination. For both terminations, we also characterize tasks computable by polynomial algorithms.作者: 玩忽職守 時(shí)間: 2025-3-31 08:17 作者: COMMA 時(shí)間: 2025-3-31 11:27
0302-9743 theory, design, implementation and applications of distributed algorithms, systems and networks - ranging from foundational and theoretical topics to algorithms and systems issues and to applications in various fields.978-3-540-87778-3978-3-540-87779-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Essential 時(shí)間: 2025-3-31 17:11
0302-9743 ance, in September 2008. The 33 revised full papers, selected from 101 submissions, are presented together with 11 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, including the 作者: 婚姻生活 時(shí)間: 2025-3-31 19:40 作者: Endearing 時(shí)間: 2025-4-1 01:09 作者: 猜忌 時(shí)間: 2025-4-1 04:57 作者: 障礙 時(shí)間: 2025-4-1 08:21
Gareth P. Dyas,Heinz T. Thanheiserer of RMRs a process makes per passage in our algorithm is .( min (.,log.)), where . is the point contention. Our algorithm matches known RMR complexity lower bounds for the class of ME algorithms that use reads and writes only, and beats the RMR complexity of prior algorithms in this class that have the FCFS property.作者: Psa617 時(shí)間: 2025-4-1 12:51
Oliver Baumann,Jason B. Mattingleythe diameter of the network. Specifically, for a family of bounded-degree graphs with logarithmic diameter, .(log.) time and .(. log.) messages. Furthermore, our proposed solution requires constant memory space at each node.
