標題: Titlebook: Distributed Computing; 19th International C Pierre Fraigniaud Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Byzantine [打印本頁] 作者: ACORN 時間: 2025-3-21 16:47
書目名稱Distributed Computing影響因子(影響力)
書目名稱Distributed Computing影響因子(影響力)學科排名
書目名稱Distributed Computing網(wǎng)絡公開度
書目名稱Distributed Computing網(wǎng)絡公開度學科排名
書目名稱Distributed Computing被引頻次
書目名稱Distributed Computing被引頻次學科排名
書目名稱Distributed Computing年度引用
書目名稱Distributed Computing年度引用學科排名
書目名稱Distributed Computing讀者反饋
書目名稱Distributed Computing讀者反饋學科排名
作者: 雕鏤 時間: 2025-3-21 23:29 作者: 執(zhí) 時間: 2025-3-22 03:39 作者: 精確 時間: 2025-3-22 06:13 作者: 環(huán)形 時間: 2025-3-22 12:29
The environment as a security issueabsence of conspiracies. We argue that hyperfairness is a useful tool for understanding some impossibility results, in particular results involving crash-tolerance. As a main result, we show that a large subclass of hyperfairness can be implemented through partial synchrony and randomization.作者: 反感 時間: 2025-3-22 15:26 作者: 反感 時間: 2025-3-22 20:47
Sustainability — a new challenge for Japan?For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.作者: 旁觀者 時間: 2025-3-23 00:56
Robert B. Gennis,Jack L. Stromingerhared object has an obstruction-free implementation if and only if it satisfies a simple property called idempotence. To prove the sufficiency of this condition, we give a universal construction that implements any idempotent object.作者: 類人猿 時間: 2025-3-23 04:03
On the Availability of Non-strict Quorum SystemsFor environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.作者: Gudgeon 時間: 2025-3-23 06:01
What Can Be Implemented Anonymously?hared object has an obstruction-free implementation if and only if it satisfies a simple property called idempotence. To prove the sufficiency of this condition, we give a universal construction that implements any idempotent object.作者: Deadpan 時間: 2025-3-23 12:01 作者: DAFT 時間: 2025-3-23 15:20 作者: membrane 時間: 2025-3-23 22:01
The Environments of the Sun and the Starsss. Specifically, we give an implementation of a Stack that supports any number of poppers, but at most two pushers. We also implement a Stack (or Queue) shared by any number of processes, but, in which, all stored elements are the same.作者: 戰(zhàn)役 時間: 2025-3-23 23:41 作者: ILEUM 時間: 2025-3-24 06:11
Obstruction-Free Algorithms Can Be Practically Wait-Freees that, for all practical purposes, obstruction-free implementations can provide progress guarantees equivalent to wait-freedom. Our transformation preserves the advantages of any pragmatic contention manager, while guaranteeing progress.作者: FAST 時間: 2025-3-24 10:28
Non-blocking Hashtables with Open Addressingy-concurrent set algorithm that approaches or outperforms the best externally-chained implementations we tested, with fixed memory costs and no need to select or fine-tune a garbage collector or locking strategy.作者: Accede 時間: 2025-3-24 13:23
Restricted Stack Implementationsss. Specifically, we give an implementation of a Stack that supports any number of poppers, but at most two pushers. We also implement a Stack (or Queue) shared by any number of processes, but, in which, all stored elements are the same.作者: ascetic 時間: 2025-3-24 16:09 作者: Colonoscopy 時間: 2025-3-24 22:47
https://doi.org/10.1007/11561927Byzantine processes; Routing; Switch; ad-hoc networks; algorithm; algorithms; broadcasting; complexity; conc作者: Embolic-Stroke 時間: 2025-3-25 02:57 作者: 挑剔小責 時間: 2025-3-25 05:59
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281794.jpg作者: 擋泥板 時間: 2025-3-25 09:57 作者: FUSC 時間: 2025-3-25 15:14
Securing the Net: Challenges, Failures and DirectionsThe Internet is infamously insecure (fraudulent and spoofed sites, phishing and spam e-mail, viruses and Trojans, Denial of Service attacks, etc.) in spite of extensive efforts, standards, tools, and research. We will discuss the problems and the pitfalls, and outline solutions and directions for future applied and analytical research.作者: 樹木中 時間: 2025-3-25 18:27 作者: surrogate 時間: 2025-3-25 21:38 作者: Lipoma 時間: 2025-3-26 01:43 作者: 策略 時間: 2025-3-26 06:13 作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-26 12:06 作者: 騷動 時間: 2025-3-26 12:54
The environment as a security issueables, shared actions as well as in message-passing systems. We propose a new and simple characterization via a new notion of ., which postulates the absence of conspiracies. We argue that hyperfairness is a useful tool for understanding some impossibility results, in particular results involving cr作者: anthesis 時間: 2025-3-26 20:01
Sustainability — a new challenge for Japan?solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing作者: Serenity 時間: 2025-3-26 23:56 作者: Aqueous-Humor 時間: 2025-3-27 03:40
An ecologically sustainable biosphereler implementations that are faster in the uncontended case. Pragmatic contention management techniques appear to be effective at facilitating progress in practice, but, as far as we know, none . progress..We present a transformation that converts any obstruction-free algorithm into one that is wait作者: 整潔漂亮 時間: 2025-3-27 08:08
Gerrit H. Vonkeman,Peter Maxsonhe communication topology is fully connected, we describe a way to transform . termination detection algorithm . that has been designed for a failure-free environment into a termination detection algorithm . that can tolerate process crashes. Our transformation assumes the existence of a .. We show 作者: incontinence 時間: 2025-3-27 10:36
Jeroen van Ginneken,Albertine van Diepena single cacheline if there are no collisions, with short straight-line code; it needs no storage overhead for pointers and memory allocator schemes, having instead an overhead of two words per bucket; it does not need to periodically reorganise or replicate the table; and it does not need garbage c作者: Restenosis 時間: 2025-3-27 17:33 作者: 乳白光 時間: 2025-3-27 18:52 作者: 捏造 時間: 2025-3-27 23:58
Very Close Environments of Young Starsroving that algorithms achieve atomicity has turned out to be a challenging problem. In this paper, we initiate the study of systematic ways of verifying distributed implementations of atomic objects, beginning with read/write objects (registers). Our general approach is to replace the existing oper作者: 戲服 時間: 2025-3-28 02:52
F. Millour,A. Meilland,P. Stee,O. Chesneaues. We prove that the use of .-CAS primitives cannot improve neither the time- nor the space-complexity of implementations of widely-used concurrent objects, such as counter, stack, queue, and collect. Surprisingly, the use of .-CAS may even . the space complexity required by such implementations..W作者: Indolent 時間: 2025-3-28 06:49 作者: Entrancing 時間: 2025-3-28 13:40 作者: MIR 時間: 2025-3-28 16:24
Robert B. Gennis,Jack L. Stromingerevents. Plausible clocks are a family of time-stamping schemes that use smaller time stamps at the expense of some accuracy. To date, all plausible clocks have been designed to use fixed-sized time stamps, and the inaccuracy of these schemes varies from run to run. In this paper, we define a new met作者: 殖民地 時間: 2025-3-28 21:57 作者: anus928 時間: 2025-3-29 00:58
Robert B. Gennis,Jack L. Stromingermption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reasons of privacy? We consider asynchronous shared-memory systems that are anonymous. The shared memory contains only the most common type of shared objects, read/write registers. We investigate, f作者: genuine 時間: 2025-3-29 04:35 作者: habitat 時間: 2025-3-29 07:28 作者: 綠州 時間: 2025-3-29 14:48 作者: 不透氣 時間: 2025-3-29 17:25
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed Systemmplexity of .. Also, its detection latency is at most .(.(.,0)) per failure more than that of .. Furthermore, the overhead (that is, the amount of control data piggybacked) on an application message increases by only .(log .) bits per failure..The fault-tolerant termination detection algorithm resul作者: Parameter 時間: 2025-3-29 21:28
Computing with Reads and Writes in the Absence of Step Contentionementations are inherently slow. We also prove that obstruction-free implementations cannot be ., namely, be nonblocking when the contention manager operates correctly, and remain (at least) obstruction-free when the contention manager misbehaves..Finally, we show that any object has a . implementat作者: 機構(gòu) 時間: 2025-3-30 00:52 作者: Extort 時間: 2025-3-30 06:27
Time and Space Lower Bounds for Implementations Using ,-CAS .-CAS primitive is only allowed to return a success/failure indication. For implementations of the . object that use such primitives, we prove that the worst-case average number of steps performed by processes is Ω(log..), regardless of the value of .. This implies a . lower bound of Ω(log..) for s作者: 搜尋 時間: 2025-3-30 10:51
Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Linkss. Additionally, an extension of our protocol provides leader ., which guarantees against arbitrary demotion of a qualified leader and avoids performance penalties associated with leader changes in schemes such as Paxos.作者: 欲望 時間: 2025-3-30 15:42
Causing Communication Closure: Safe Program Composition with Non-FIFO Channelsrt causality and safe composition. A characterization of sealable programs is given, as well as efficient algorithms for testing if?. seals?. and for constructing a seal for a significant class of programs. It is shown that every sealable program that is open to interference on .(..) channels can be作者: 迎合 時間: 2025-3-30 20:36 作者: 嬉耍 時間: 2025-3-30 23:31 作者: Fretful 時間: 2025-3-31 03:09 作者: 擁護者 時間: 2025-3-31 08:37
Gerrit H. Vonkeman,Peter Maxsonmplexity of .. Also, its detection latency is at most .(.(.,0)) per failure more than that of .. Furthermore, the overhead (that is, the amount of control data piggybacked) on an application message increases by only .(log .) bits per failure..The fault-tolerant termination detection algorithm resul作者: 謊言 時間: 2025-3-31 12:19
https://doi.org/10.1057/9781137386151ementations are inherently slow. We also prove that obstruction-free implementations cannot be ., namely, be nonblocking when the contention manager operates correctly, and remain (at least) obstruction-free when the contention manager misbehaves..Finally, we show that any object has a . implementat作者: flimsy 時間: 2025-3-31 14:11
Very Close Environments of Young Starsfferent read/write register constructions: the message-passing register emulation of Attiya, Bar-Noy and Dolev, its optimized version based on real time, and the shared memory register construction of Vitanyi and Awerbuch. In addition, we show that a simplified version of our specification is implem作者: 不愛防注射 時間: 2025-3-31 19:50
F. Millour,A. Meilland,P. Stee,O. Chesneau .-CAS primitive is only allowed to return a success/failure indication. For implementations of the . object that use such primitives, we prove that the worst-case average number of steps performed by processes is Ω(log..), regardless of the value of .. This implies a . lower bound of Ω(log..) for s作者: 歡笑 時間: 2025-4-1 00:34
Alan Cooper,Julien L. Houben,Lisa C. Chiens. Additionally, an extension of our protocol provides leader ., which guarantees against arbitrary demotion of a qualified leader and avoids performance penalties associated with leader changes in schemes such as Paxos.作者: 供過于求 時間: 2025-4-1 02:39
The Enzymes of Biological Membranesrt causality and safe composition. A characterization of sealable programs is given, as well as efficient algorithms for testing if?. seals?. and for constructing a seal for a significant class of programs. It is shown that every sealable program that is open to interference on .(..) channels can be作者: 油氈 時間: 2025-4-1 06:41
Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networkstransfers between peers to supplement ongoing downloads. First, we make the case for an erasure-resilient encoding of the content, using the digital fountain paradigm. Such an approach affords reliability and a substantial degree of application-level flexibility, as it seamlessly accommodates connec作者: Pastry 時間: 2025-4-1 12:10
Coterie Availability in Sitesa network, each site formed by a set of computing nodes running processes. In particular, we introduce two failure models that allow sites to fail, and we use them to derive coteries. We argue that these coteries have better availability than quorums formed by a majority of processes, which are know作者: 符合你規(guī)定 時間: 2025-4-1 16:06 作者: Hyperlipidemia 時間: 2025-4-1 21:16 作者: 記憶 時間: 2025-4-2 00:13
On the Availability of Non-strict Quorum Systemssolutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing作者: humectant 時間: 2025-4-2 03:49 作者: 把…比做 時間: 2025-4-2 08:44 作者: 鞠躬 時間: 2025-4-2 13:58
