In order to realize the efficient storage of electric power job site data and ensure the utilization effect of the stored data, a method of electric power job site edge cloud data storage based on the paxos algorithm ...
详细信息
In order to realize the efficient storage of electric power job site data and ensure the utilization effect of the stored data, a method of electric power job site edge cloud data storage based on the paxos algorithm is proposed. In this method, power field operation data are collected comprehensively through the edge server and edge controller in the edge computing module, the collected data are processed, and the data storage tasks are allocated reasonably. The allocated data are transferred to the data storage module, which identifies the bad data in the data through a gap statistics algorithm and cluster analysis and retains the valid and normal data. After the primary and secondary nodes are determined based on the paxos algorithm, the data storage model of power operation site is constructed. After the consistency detection of the reserved data, the data storage of power operation site is completed. The platform management module can analyze the stored data and present the analysis results to the application decision -making module for presentation. The test results show that the maximum time delay and energy consumption are 2.15 s and 42.6 W, respectively, when the method is used for data transmission, which can accurately identify the bad data in the field data of electric power operation, and the reliability index results of data consistency detection are all above 0.95, which ensures the good consistency of the stored power operation site data and effectively completes the power operation site data storage.
This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly exec...
详细信息
ISBN:
(纸本)9781450362177
This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly executable at the same time. The tutorial consists of five parts: (1) A introduction to different distributed consensus problems, from classical consensus and Byzantine consensus to blockchain consensus. (2) An overview of well-known algorithms, from paxos for classical consensus to the Bitcoin algorithm for blockchain consensus, including important variants such as Viewstamped Replication and Virtual Synchrony, as well as Proof-of-Stake vs. Proof-of-Work. (3) An overview of a method and language, DistAlgo, for expressing distributed algorithms precisely at a high-level as pseudocode and having them be directly executable at the same time. (4) A study of exact algorithms expressed at a high level for the most extensively studied algorithm variants, including Lamport's paxos for classical consensus and Nakamoto's Bitcoin algorithm for blockchain consensus. (5) A demo of the direct execution of these exact algorithms by distributed processes.
The problem of consistency in distributed system have been studied by many authors for many years, this paper introduces the paxos algorithm to solve the problem, which makes a detailed description and an analysis Pax...
详细信息
ISBN:
(纸本)9781467316842;9781467346856
The problem of consistency in distributed system have been studied by many authors for many years, this paper introduces the paxos algorithm to solve the problem, which makes a detailed description and an analysis paxos algorithm deeply, meanwhile it demonstrates paxos algorithm that has 2F+1 fault tolerance capacity. Moreover, this paper proposed the improved measures to solve the live lock problem of paxos algorithm.
Primary-backup replication based on shared storage is a classical approach to ensuring high availability and data durability of stock trading systems, but it is difficult to further reduce the system latency due to pe...
详细信息
ISBN:
(纸本)9780769547367
Primary-backup replication based on shared storage is a classical approach to ensuring high availability and data durability of stock trading systems, but it is difficult to further reduce the system latency due to persistence bottleneck. To solve this problem, a memory data replication approach based on paxos algorithm is proposed, which accomplishes primary-backup replication through messaging, ensures the strong consistency of data replicas and tolerates possible benign failures. Experiment results have shown that this approach, compared with the shared storage approach, manages to greatly reduce the order processing latency of trading systems and achieve hot failover correctly in the case of server failure.
Modularization is a traditional consequence of the Principle of Separate of Concerns, which states that different abstractions should be dealt with in separate entities. Interactions between these entities define comp...
详细信息
Modularization is a traditional consequence of the Principle of Separate of Concerns, which states that different abstractions should be dealt with in separate entities. Interactions between these entities define compositional structures, which are studied by Software Architecture. Recent research has revisited the original Principle, suggesting a different modularization strategy. Along with classic components, this approach explicitly considers additional concerns, defining modules which crosscut traditional barriers. The best known example is Aspect Orientation. This strategy defines a novel kind of interactions and compositional structures, which are of particular interest to Software Architecture. Moreover, several of those crosscutting concerns are best described at the architecture level. Coordination is an obvious example of such an architectural aspect: a higher-order interaction abstraction which could extend its influence to the whole system. In this paper, we propose a way to integrate these concepts into an existing language, using the notion of superimposition as a foundation. The chosen target is PiLar, a reflective, process-algebraic ADL. The concept of architectural fragment or chevron is introduced as an architecture-level aspect. To show the applicability of these ideas, we describe a case study consisting on the weaving of a coordination architectural aspect, encapsulating the paxos distributed consensus algorithm, and a simple pipeline-style architecture, and obtaining a coordinated version of the initial system.
暂无评论