Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,030
result(s) for
"Verteiltes System"
Sort by:
Raft consensus mechanism and the applications
Raft consensus algorithm is one of the commonly used consensus algorithms in distributed systems. It is mainly used to manage the consistency of log replication. It has the same function as Paxos, but compared to Paxos, Raft algorithm is easier to understand and easier to apply to actual systems. The Raft algorithm is a consensus algorithm adopted by the alliance chain. This article describes the details of Raft consensus algorithm and its application in detail.
Journal Article
Mastering Ethereum : building smart contracts and DApps
Ethereum represents the gateway to a worldwide, decentralized computing paradigm. This platform enables you to run decentralized applications (DApps) and smart contracts that have no central points of failure or control, integrate with a payment network, and operate on an open blockchain. With this practical guide, Andreas M. Antonopoulos and Gavin Wood provide everything you need to know about building smart contracts and DApps on Ethereum and other virtual-machine blockchains. Discover why IBM, Microsoft, NASDAQ, and hundreds of other organizations are experimenting with Ethereum. This essential guide shows you how to develop the skills necessary to be an innovator in this growing and exciting new industry.
Book
Cost optimization of intermodal freight transportation in the transport network
Intermodal freight transport is an alternative to trucking to distribute large volumes of goods. The article presents the solution of the problem of tactical planning and choice of transportation options. When using railway freight consignors take into account the traffic capacity. Trucking is used for short distances for transportation to intermodal terminals or direct supplies to customers. The study provides an analysis of trucking and intermodal transport in relation to cargo consolidation and cost of services on a model basis. The approach is applied to the industrial distribution system of the region.
Journal Article
Blockchain technology in supply chain management: an empirical study of the factors affecting user adoption/acceptance
Blockchain overcomes numerous complicated problems related to confidentiality, integrity, availability of fast and secure distributed systems. Using data from a cross-sectoral survey of 449 industries, we investigate factors that hinder or facilitate blockchain adoption in supply chains. To capture the most vital aspects of blockchain adoption in supply chains, our conceptual model integrates the unified theory of acceptance and use of technology (UTAUT) model with the task-technology fit (TTF) and information system success (ISS) models, with trust-based information technology innovation adoption constructs. Using structural equation modelling, we find that the ISS, TTF, and UTAUT models positively influence the key factors affecting supply chain employees’ willingness to adopt blockchain. Our results show that the UTAUT’s social influence factor has no significant effect on the intention to adopt blockchain, while inter-organisational trust has a significant effect on the relationship between the UTAUT dimension and intention to adopt blockchain.
Journal Article
Designing of distributed systems of hydrolithosphere processes parameters control for the efficient extraction of hydromineral raw materials
Using methods developed for systems with distributed parameters allows us to optimize processes of hydromineral raw materials production in practice. In accordance with the theory of distributed systems, formation of control actions on each well of a complex of production wells requires taking into account a state of the entire complex of wells, which ensures better dynamics and accuracy of a control process. The methodology of constructing distributed control systems for controlling the entire complex of wells involves the use of dynamic and static characteristics of an exploited aquifer. In this connection, a problem of mathematical description (identification) of the processes under consideration arises, which can be realized, for example, using the methods and formulas of Theis-Jacob. Using the Theis-Jacob formulas for the identification of the processes under consideration assumes an availability of information about parameters of hydrolytosphere processes (piezoelectric conductivity, overflow coefficients, etc.). The calculation of the considered parameters is a rather laborious task. The article proposes a methodology for constructing approximation models of the processes under consideration based on experimental studies using 2 wells of a field. Based on the obtained approximation model, a synthesis of the system for the hydrolytosphere processes parameters control was implemented.
Journal Article
FROST—Fast row-stochastic optimization with uncoordinated step-sizes
In this paper, we discuss distributed optimization over directed graphs, where doubly stochastic weights cannot be constructed. Most of the existing algorithms overcome this issue by applying push-sum consensus, which utilizes column-stochastic weights. The formulation of column-stochastic weights requires each agent to know (at least) its out-degree, which may be impractical in, for example, broadcast-based communication protocols. In contrast, we describe FROST (Fast Row-stochastic-Optimization with uncoordinated STep-sizes), an optimization algorithm applicable to directed graphs that does not require the knowledge of out-degrees, the implementation of which is straightforward as each agent locally assigns weights to the incoming information and locally chooses a suitable step-size. We show that FROST converges linearly to the optimal solution for smooth and strongly convex functions given that the largest step-size is positive and sufficiently small.
Journal Article
A brief introduction to distributed systems
Distributed systems are by now commonplace, yet remain an often difficult area of research. This is partly explained by the many facets of such systems and the inherent difficulty to isolate these facets from each other. In this paper we provide a brief overview of distributed systems: what they are, their general design goals, and some of the most common types.
Journal Article
Loss Reduction in Distribution System using Best Practices
This paper talks about the implementation of the best practices to reduce the losses related to Transmission and Distribution (T&D) system. Distribution system is one of the major areas where the distribution companies (DisComs) face huge losses, therefore, reduction of T&D losses may bring profit to the DisComs. In this work, various technical losses are identified and tackled accordingly. This paper also discusses the measures to be taken to reduce the losses and hence increase the overall efficiency of the network.
Journal Article
Combined task- and network-level scheduling for distributed time-triggered systems
Ethernet-based time-triggered networks (e.g. TTEthernet) enable the cost-effective integration of safety-critical and real-time distributed applications in domains where determinism is a key requirement, like the aerospace, automotive, and industrial domains. Time-Triggered communication typically follows an offline and statically configured schedule (the synthesis of which is an NP-complete problem) guaranteeing contention-free frame transmissions. Extending the end-to-end determinism towards the application layers requires that software tasks running on end nodes are scheduled in tight relation to the underlying time-triggered network schedule. In this paper we discuss the simultaneous co-generation of static network and task schedules for distributed systems consisting of preemptive time-triggered tasks which communicate over switched multi-speed time-triggered networks. We formulate the schedule problem using first-order logical constraints and present alternative methods to find a solution, with or without optimization objectives, based on satisfiability modulo theories (SMT) and mixed integer programming (MIP) solvers, respectively. Furthermore, we present an incremental scheduling approach, based on the demand bound test for asynchronous tasks, which significantly improves the scalability of the scheduling problem. We demonstrate the performance of the approach with an extensive evaluation of industrial-sized synthetic configurations using alternative state-of-the-art SMT and MIP solvers and show that, even when using optimization, most of the problems are solved within reasonable time using the incremental method.
Journal Article