A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show that logarithmic memory is optimal for both strong and weak leader election in the class of arbitrary connected graphs. ... an exponential gap in memory requirements for leader election between the class of trees and the class of arbitrary graphs. ... Since in our case the memory of a node is much too small to store an entire signature, the basic idea of our algorithm is to perform this comparison term by term, so that each node needs to recall the ...doi:10.1007/s00446-011-0131-y fatcat:uraxymdl6rfyvjwgm7bwxiuefa
Lecture Notes in Computer Science
We show that logarithmic memory is optimal for both strong and weak leader election in the class of arbitrary connected graphs. ... an exponential gap in memory requirements for leader election between the class of trees and the class of arbitrary graphs. ... Since in our case the memory of a node is much too small to store an entire signature, the basic idea of our algorithm is to perform this comparison term by term, so that each node needs to recall the ...doi:10.1007/978-3-642-15763-9_25 fatcat:xrhi247zfreuxd4nr4qusm72fy
In this paper, I attempt to use NuSMV as a model checking tool for verifying necessary properties of Peterson's algorithm for leader election problem in a unidirectional asynchronous ring topology. ... Although it seems that model checking is not a feasible approach for this problem, I attempt to use several effective limiting assumptions for hiring formal model checking approach without losing the correct ... It means that after building the model, how much memory the model checker will need to perform the property checking for the explained properties in the ring. ...arXiv:0808.0962v1 fatcat:ekp3jomb3bcerns2vozoxwt3cq
., proper coloring, leader election, etc.), a self-stabilizing algorithm for Π is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an arbitrary ... It is known that leader election does not have a deterministic self-stabilizing algorithm using a constant-size register at each node, i.e., for some networks, some of their nodes must have registers whose ... The questions boils down to establishing how much memory is needed to locally certify the global correctness of the solution, and this is well-studied  . ...arXiv:1905.08563v3 fatcat:wctfkduvevgi5j4zwdfpwq77km
Shape formation is a basic distributed problem for systems of computational mobile entities. ... Our algorithm works without chirality, proving that chirality is computationally irrelevant for shape formation. ... Electing a unique leader may be impossible due to the symmetry of S 0 : if k > 1 leaders are elected, it means that S 0 is necessarily unbreakably k-symmetric. ...doi:10.4230/lipics.disc.2017.48 dblp:conf/wdag/LunaFSVY17a fatcat:y33vw53cwzhhlnvjlwtkaa2joe
The analysis is both in terms of the nature of the maps and also in terms of the equity associated with a map. Methodology A consumer-oriented approach is developed for mapping the political brand. ... Practical implications The method is straightforward to apply and provides important information to political marketers about the nature and power of the associations held in memory by voters. ... For Labour it also reveals how Blair is still a major part of the brand. ...doi:10.1108/03090561011020534 fatcat:ptq4xebbcjf63behjaibhkzucm
Johnson is a leader with a long-standing reputation for being selective about whether and when he shows up. ... When it is impossible for us to be care free, leaders must avoid being perceived or experienced as care less. ... literary and etymological connections between care and security, and to the ways in which security (securitas in Latin) means being 'without care', creating paradox, ambiguity and anxiety about whether this is ...doi:10.1177/1742715020919657 fatcat:i2uxghlkabache2myxkejby3si
If disk space on these peers is not carefully monitored and provisioned, the system may not be able to provide availability for certain files. ... Specifically, we address the problem of duplicate elimination in the context of systems connected over an unstructured peerto-peer network in which there is no a priori binding between an object and its ... We want to elect a group of k leaders for each file. The elected leaders are responsible for storing the file. ...doi:10.1109/tpds.2007.351710 fatcat:zf5z5clm7vcppfl624mqlb7yhm
Lecture Notes in Computer Science
However, the trade-off was analyzed for deterministic algorithms and the minimum memory required to achieve dispersion was found to be Ω( n) bits at each robot. ... In this paper, we show that by harnessing the power of randomness, one can achieve dispersion with O(Δ) bits of memory at each robot, where Δ is the maximum degree of the graph. ... This serves as a warm-up and allows readers to internalize the way we use Local-Leader-Election and how these sorts of algorithms (with reduced memory) need to operate. ...doi:10.1007/978-3-030-14812-6_30 fatcat:ylkbxkbcwfaypjd5wvlm6mkhlm
Memory & Cognition
Collective memory is shared by a group and is part of that group's identity. Memory for political leaders is a prototypical case of collective memory. ... Specifically, for a collaborative government system, autobiographic memory has a stronger contribution to the trajectory of collective memory. ... Meier for editorial amendments. Open practice statement The dataset analysed during the current study is available from the corresponding author on reasonable request. The study was not preregistered. ...doi:10.3758/s13421-020-01076-8 pmid:32761310 fatcat:hu7dngztq5espf7z4uo4igksru
ParallelRaft inherits the understandability and easy implementation of Raft while providing much better I/O scalability for PolarFS. ... PolarFS is a distributed file system with ultra-low latency and high availability, designed for the POLARDB database service, which is now available on the Alibaba Cloud. ... ACKNOWLEDGEMENTS We thank the anonymous reviewers and our shepherd Theodore Johnson for their valuable suggestions and opinions that helped improve the paper. ...doi:10.14778/3229863.3229872 fatcat:gc4yrd4y5nebvh4rvf3ju4k44m
The Quarterly Review
But the need of to-day is for a long period of quiet and recuperation, during which the ... In those ten years how much necessary legislation was put off, when the times were ripe and propitious! ...
Bizur is aimed for services that require strongly consistent state, but do not require a distributed log; for example, a distributed lock manager or a distributed service locator. ... The distributed log is needed when replicating a general service, but when the desired service is key-value based, the contention points created by the distributed log can be avoided. ... Algorithm 1 contains the pseudo code for the leader election flow. Claim 1 For every elect id there is at most one server that marks is leader as true (Line 5). ...arXiv:1702.04242v1 fatcat:zebr2tv3izasne2xar7zrbgn6i
Collier's: The National Weekly
HE DAY FOR POLITICIANS to decide, contemptuous of the people, how offices shall be filled, is passing fast. The sys- tem, however, dies not without a struggle. ... ANALYZING A LEADER ONE KIND OF CANDIDATE SOCIALISM N MR. BRYAN’S RETURN, early in the summer, he will find himself much stronger with the country than when he left. ...
Lecture Notes in Computer Science
We present a deterministic obstruction-free implementation of leader election from O( √ n) atomic O(log n)-bit registers in the standard asynchronous shared memory system with n processes. ... Our algorithm provides the first sub-linear space upper bound for obstruction-free leader election. A lower bound of Ω(log n) has been known since 1989  . ... , how much resources (usually time and space) are necessary for such simulations. ...doi:10.1007/978-3-642-41527-2_4 fatcat:he3spafgxzd2tng3rkabc5zciq
« Previous Showing results 1 — 15 out of 84,476 results