FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1567956519> ?p ?o ?g. }

• W1567956519 abstract "Since their invention more than half a century ago, computers have gone from being just an handful of expensive machines each filling an entire room, to being an integral part of almost every aspect of modern life. Nowadays computers are everywhere: in our planes, in our cars, on our desks, in our home appliances, and even in our pockets. This widespread adoption had a profound impact in our world and in our lives, so much that now we rely on them for many important aspects of everyday life, including work, communication, travel, entertainment, and even managing our money. Given our increased reliance on computers, their continuous and correct operation has become essential for modern society. However, individual computers can fail due to a variety of causes and, if nothing is done about it, these failures can easily lead to a disruption of the service provided by computer system. The field of fault tolerance studies this problem, more precisely, it studies how to enable a computer system to continue operation in spite of the failure of individual components. One of the most popular techniques of achieving fault tolerance is software replication, where a service is replicated on an ensemble of machines (replicas) such that if some of these machines fail, the others will continue providing the service. Software replication is widely used because of its generality (can be applied to most services) and its low cost (can use off-the-shelf hardware). This thesis studies a form of software replication, namely, state machine replication, where the service is modeled as a deterministic state machine whose state transitions consist of the execution of client requests. Although state machine replication was first proposed almost 30 years ago, the proliferation of online services during the last years has led to a renewed interest. Online services must be highly available and for that they frequently rely on state machine replication as part of their fault tolerance mechanisms. However, the unprecedented scale of these services, which frequently have hundreds of thousands or even millions of users, leads to a new set performance requirements on state machine replication. This thesis is organized in two parts. The goal of the first part is to study from a theoretical perspective the performance characteristics of the algorithms behind state machine replication and to propose improved variants of such algorithms. The second part looks at the problem from a practical perspective, proposing new techniques to achieve high-throughput and scalability. In the first part, we start with an analytical analysis of the performance of two consensus algorithms, one leader-free (an adaptation of the fast round of Fast Paxos) and another leader-based (an adaptation of classical Paxos). We express these algorithms in the Heard-Of round model and show that using this model it is fairly easy to determine analytically several interesting performance metrics. We then study the performance of round models in general. Round models are perceived as inefficient because in their typical implementation, the real-time duration of rounds is proportional to the (pessimistic) timeouts used on the underlying system. This contrasts with the failure detector or the partial synchronous system models, where algorithms usually progress at the speed of message reception. We show that there is no inherent gap in performance between the models, by proposing a round implementation that during stable periods advances at the speed of message reception. We conclude the first part by presenting a new leader election algorithm that chooses as leader a well-connected process, that is, a process whose time needed to perform a one-to-majority communication round is among the lowest in the system. This is useful mainly in systems where the latency between processes is not homogeneous, because the performance of leader-based algorithms is particularly sensitive to the performance and connectivity of the process acting as a leader. The second part of the thesis studies different approaches to achieve high-throughput with state machine replication. To support the experimental work done in this part, we have developed JPaxos, a fully-featured implementation of Paxos in Java. We start by looking at how to tune the batching and pipelining optimizations of Paxos; using an analytical model of the performance of Paxos we show how to derive good values for the bounds on the batch size and number of parallel instances. We then propose an architecture for implementing replicated state machines that is capable of leveraging multi-core CPUs to achieve very high-levels of performance. The final contribution of this thesis is based on the observation that most implementations of state machine replication have an unbalanced division of work among threads, with one replica, the leader, having a significantly higher workload than the other replicas. Naturally, the leader becomes the bottleneck of the system, while other replicas are only lightly loaded. We propose and evaluate S-Paxos, which evenly balances the workload among all replicas, and thus overcomes the leader bottleneck. The benefits are two-fold: S-Paxos achieves a higher throughput for a given number of replicas and its performance increases with the number of replicas (up to a reasonable number)." @default.
• W1567956519 created "2016-06-24" @default.
• W1567956519 creator A5061996574 @default.
• W1567956519 date "2012-01-01" @default.
• W1567956519 modified "2023-09-23" @default.
• W1567956519 title "State Machine Replication" @default.
• W1567956519 cites W109545358 @default.
• W1567956519 cites W1502619425 @default.
• W1567956519 cites W1510059341 @default.
• W1567956519 cites W1549384320 @default.
• W1567956519 cites W1964729314 @default.
• W1567956519 cites W1966308107 @default.
• W1567956519 cites W1983572666 @default.
• W1567956519 cites W1991153938 @default.
• W1567956519 cites W2021482754 @default.
• W1567956519 cites W2035362408 @default.
• W1567956519 cites W2036267700 @default.
• W1567956519 cites W2043801088 @default.
• W1567956519 cites W2054584570 @default.
• W1567956519 cites W2058618358 @default.
• W1567956519 cites W2065180040 @default.
• W1567956519 cites W2070908350 @default.
• W1567956519 cites W2075854425 @default.
• W1567956519 cites W2077240273 @default.
• W1567956519 cites W2085407655 @default.
• W1567956519 cites W2092911542 @default.
• W1567956519 cites W2094159214 @default.
• W1567956519 cites W2101939036 @default.
• W1567956519 cites W2113751407 @default.
• W1567956519 cites W2121236443 @default.
• W1567956519 cites W2126924915 @default.
• W1567956519 cites W2166071597 @default.
• W1567956519 cites W2170523074 @default.
• W1567956519 cites W2914206182 @default.
• W1567956519 cites W3137220996 @default.
• W1567956519 cites W564832898 @default.
• W1567956519 doi "https://doi.org/10.5075/epfl-thesis-5410" @default.
• W1567956519 hasPublicationYear "2012" @default.
• W1567956519 type Work @default.
• W1567956519 sameAs 1567956519 @default.
• W1567956519 citedByCount "1" @default.
• W1567956519 countsByYear W15679565192020 @default.
• W1567956519 crossrefType "journal-article" @default.
• W1567956519 hasAuthorship W1567956519A5061996574 @default.
• W1567956519 hasConcept C105795698 @default.
• W1567956519 hasConcept C111919701 @default.
• W1567956519 hasConcept C11413529 @default.
• W1567956519 hasConcept C120314980 @default.
• W1567956519 hasConcept C12590798 @default.
• W1567956519 hasConcept C136197465 @default.
• W1567956519 hasConcept C144133560 @default.
• W1567956519 hasConcept C154945302 @default.
• W1567956519 hasConcept C162853370 @default.
• W1567956519 hasConcept C2777904410 @default.
• W1567956519 hasConcept C2780378061 @default.
• W1567956519 hasConcept C33923547 @default.
• W1567956519 hasConcept C38652104 @default.
• W1567956519 hasConcept C41008148 @default.
• W1567956519 hasConcept C48103436 @default.
• W1567956519 hasConceptScore W1567956519C105795698 @default.
• W1567956519 hasConceptScore W1567956519C111919701 @default.
• W1567956519 hasConceptScore W1567956519C11413529 @default.
• W1567956519 hasConceptScore W1567956519C120314980 @default.
• W1567956519 hasConceptScore W1567956519C12590798 @default.
• W1567956519 hasConceptScore W1567956519C136197465 @default.
• W1567956519 hasConceptScore W1567956519C144133560 @default.
• W1567956519 hasConceptScore W1567956519C154945302 @default.
• W1567956519 hasConceptScore W1567956519C162853370 @default.
• W1567956519 hasConceptScore W1567956519C2777904410 @default.
• W1567956519 hasConceptScore W1567956519C2780378061 @default.
• W1567956519 hasConceptScore W1567956519C33923547 @default.
• W1567956519 hasConceptScore W1567956519C38652104 @default.
• W1567956519 hasConceptScore W1567956519C41008148 @default.
• W1567956519 hasConceptScore W1567956519C48103436 @default.
• W1567956519 hasLocation W15679565191 @default.
• W1567956519 hasOpenAccess W1567956519 @default.
• W1567956519 hasPrimaryLocation W15679565191 @default.
• W1567956519 hasRelatedWork W1926613849 @default.
• W1567956519 hasRelatedWork W1977237701 @default.
• W1567956519 hasRelatedWork W200932817 @default.
• W1567956519 hasRelatedWork W2011164449 @default.
• W1567956519 hasRelatedWork W2028133900 @default.
• W1567956519 hasRelatedWork W203992939 @default.
• W1567956519 hasRelatedWork W2094034456 @default.
• W1567956519 hasRelatedWork W2157272074 @default.
• W1567956519 hasRelatedWork W2185369344 @default.
• W1567956519 hasRelatedWork W2286143709 @default.
• W1567956519 hasRelatedWork W2531774641 @default.
• W1567956519 hasRelatedWork W2560441213 @default.
• W1567956519 hasRelatedWork W266456132 @default.
• W1567956519 hasRelatedWork W290186175 @default.
• W1567956519 hasRelatedWork W3006064422 @default.
• W1567956519 hasRelatedWork W3099136709 @default.
• W1567956519 hasRelatedWork W3106457491 @default.
• W1567956519 hasRelatedWork W585854255 @default.
• W1567956519 hasRelatedWork W71830270 @default.
• W1567956519 hasRelatedWork W1808765134 @default.
• W1567956519 isParatext "false" @default.
• W1567956519 isRetracted "false" @default.
• W1567956519 magId "1567956519" @default.

• next