14 research outputs found
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems
In this paper, we show that the protocol complex of a Byzantine synchronous
system can remain -connected for up to rounds,
where is the maximum number of Byzantine processes, and .
This topological property implies that rounds are
necessary to solve -set agreement in Byzantine synchronous systems, compared
to rounds in synchronous crash-failure systems. We
also show that our connectivity bound is tight as we indicate solutions to
Byzantine -set agreement in exactly synchronous
rounds, at least when is suitably large compared to . In conclusion, we
see how Byzantine failures can potentially require one extra round to solve
-set agreement, and, for suitably large compared to , at most that
Some New Results With k-set agreement
In this article, we investigate the solvability of -set agreement among
processes in distributed systems prone to different types of process
failures. Specifically, we explore two scenarios: synchronous message-passing
systems prone to up to Byzantine failures of processes. And asynchronous
shared memory systems prone to up to crash failures of processes. Our goal
is to address the gaps left by previous works\cite{SSS,AsynchKset} in these
areas. For Byzantine failures case we consider systems with authentication
where processes have unforgeable signatures.
For synchronous message-passing systems, we present an authenticated
algorithm that achieves -set agreement in only two rounds, with no
constraints on the number of faults , with determined as . In fact the lower bound for is that is obtained by an algorithm based on traditional
consensus with rounds.
In asynchronous shared memory systems, we introduce an algorithm that
accomplishes -set agreement for values of greater than . This algorithm uses a snapshot primitive to
handle crash failures and enable effective set agreement
A Topological Treatment of Early-Deciding Set-Agreement
This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a given run, as a function of k, the degree of coordination, and f <= t the number of processes that actually fail in the run. We prove a lower bound of min(\floor{f/k}+2,\floor{t/k}+1) rounds. Our proof uses simple topological tools to reason about runs of a full information set-agreement protocol. In particular, we introduce a new topological operator, which we call the early deciding operator, to capture rounds where k processes fail but correct processes see only k-1 failures
From a Static Impossibility to an Adaptive Lower Bound: the Complexity of Early Deciding Set Agreement
In the year 2007 a reform was established that allowed private citizens in Sweden to make tax deductions on companies providing services pertaining to the household (called RUT-deduction). The year later another reform was introduced granting citizens additional tax deductions but this time concerning household renovation, reconstruction and extensive construction (called ROT-deduction). These tax deductions resulted in higher employment and more jobs being executed legally. The purpose of this paper is to examine and analyze what kind of effects these types of tax deductions would have on workers’ real wages and to look at to what extent these effects differ within a female dominated occupation and a male dominated occupation, from a gender perspective. The two professions that are chosen to be researched in this paper are the cleaning and painting professions. Furthermore, the purpose with this study is to examine whether this effect differs within the two separate professions. The study is executed with the use of econometric models, point estimation, economic theory and empirical studies. The result indicates that the RUT-deduction has the biggest positive impact on cleaners’ real wages. This paper shows that one underlying reason to this outcome could be that the cleaning service is a more price sensitive service and that the RUT-deduction might therefore have generated an excess in demand for that service. Nonetheless, to establish an equilibrium in the labor market the wages are required to rise in order to attract more cleaners to enter the certain market. However, this paper is unable to eliminate the possible theory of there being a general wage increase among workers in the private sector. In addition, this study is comprised of an inadequate amount of observations which impedes any reliable conclusions from being made based on evidence
Practical scalable consensus for pseudo-synchronous distributed systems
The ability to consistently handle faults in a distributed en-vironment requires, among a small set of basic routines, an agreement algorithm allowing surviving entities to reach a consensual decision between a bounded set of volatile re-sources. This paper presents an algorithm that implements an Early Returning Agreement (ERA) in pseudo-synchronous systems, which optimistically allows a process to resume its activity while guaranteeing strong progress. We prove the correctness of our ERA algorithm, and expose its logarith-mic behavior, which is an extremely desirable property for any algorithm which targets future exascale platforms. We detail a practical implementation of this consensus algorithm in the context of an MPI library, and evaluate both its effi-ciency and scalability through a set of benchmarks and two fault tolerant scientific applications. CCS Concepts •Computing methodologies → Distributed algorithms; •Computer systems organization→Reliability; Fault-tolerant network topologies; •Software and its engi-neering → Software fault tolerance
Conditions for Set Agreement with an Application to Synchronous Systems
The -set agreement problem is a generalization of the consensus problem: considering a system made up of processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than different values are decided. While this problem cannot be solved in an asynchronous system prone to process crashes when , it can always be solved in a synchronous system; is then a lower bound on the number of rounds (consecutive communication steps) for the non-faulty processes to decide. The {\it condition-based} approach has been introduced in the consensus context. Its aim was to both circumvent the consensus impossibility in asynchronous systems, and allow for more efficient consensus algorithms in synchronous systems. This paper addresses the condition-based approach in the context of the -set agreement problem. It has two main contributions. The first is the definition of a framework that allows defining conditions suited to the -set agreement problem. More precisely, a condition is defined as a set of input vectors such that each of its input vectors can be seen as ``encoding'' values, namely, the values that can be decided from that vector. A condition is characterized by the parameters , , and a parameter denoted such that the greater , the least constraining the condition (i.e., it includes more and more input vectors when increases, and there is a condition that includes all the input vectors when ). The conditions characterized by the triple of parameters , and define the class of conditions denoted , , . The properties of the sets are investigated, and it is shown that they have a lattice structure. The second contribution is a generic synchronous -set agreement algorithm based on a condition , i.e., a condition suitedto the -set agreement problem, for . This algorithm requires at most rounds when the input vector belongs to , and rounds otherwise. (Interestingly, this algorithm includes as particular cases the classical synchronous -set agreement algorithm that requires rounds (case and ), and the synchronous consensus condition-based algorithm that terminates in rounds when the input vector belongs to the condition, and in rounds otherwise (case ).
Tight bounds for k-set agreement
The Cambridge Research Laboratory was founded in 1987 to advance the state of the art in both core computing and human-computer interaction, and to use the knowledge so gained to support the Company’s corporate objectives. We believe this is best accomplished through interconnected pursuits in technology creation, advanced systems engineering, and business development. We are actively investigating scalable computing; mobile computing; vision-based human and scene sensing; speech interaction; computer-animated synthetic persona; intelligent information appliances; and the capture, coding, storage, indexing, retrieval, decoding, and rendering of multimedia data. We recognize and embrace a technology creation model which is characterized by three major phases: Freedom: The life blood of the Laboratory comes from the observations and imaginations of our research staff. It is here that challenging research problems are uncovered (through discussions with customers, through interactions with others in the Corporation, through other professional interactions, through reading, and the like) or that new ideas are born. For any such problem or idea, this phase culminates in the nucleation of a project team around a well articulated central research question and the outlining of a research plan. Focus: Once a team is formed, we aggressively pursue the creation of new technology based o