Titlebook: Distributed Computing; 19th International C Pierre Fraigniaud Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Byzantine

ACORN

书目名称Distributed Computing影响因子(影响力)




书目名称Distributed Computing影响因子(影响力)学科排名




书目名称Distributed Computing网络公开度




书目名称Distributed Computing网络公开度学科排名




书目名称Distributed Computing被引频次




书目名称Distributed Computing被引频次学科排名




书目名称Distributed Computing年度引用




书目名称Distributed Computing年度引用学科排名




书目名称Distributed Computing读者反馈




书目名称Distributed Computing读者反馈学科排名

雕镂

执

精确

环形

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.

反感

反感

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.

旁观者

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.

类人猿

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

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.