Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
16,006
result(s) for
"Distributed computing"
Sort by:
Blockchain in the Industrial Internet of Things
Blockchain and the Internet of Things are separately regarded as highly capable popular technologies. Combining these gives Blockchain for the Industrial Internet of Things, which overcomes the security issues associated with the IOT and can further the development of Industry 4.0.
eBook
Cloud computing for dummies
A guide to managing and securing cloud services covers such topics as developing a cloud strategy, managing data, using software as a service, setting standards, and governing the cloud.
Book
Towards a distributed quantum computing ecosystem
The Quantum Internet, by enabling quantum communications among remote quantum nodes, is a network capable of supporting functionalities with no direct counterpart in the classical world. Indeed, with the network and communications functionalities provided by the Quantum Internet, remote quantum devices can communicate and cooperate for solving challenging computational tasks by adopting a distributed computing approach. The aim of this study is to provide the reader with an overview about the main challenges and open problems arising in the design of a distributed quantum computing ecosystem. For this, the authors provide a survey, following a bottom-up approach, from a communications engineering perspective. They start by introducing the Quantum Internet as the fundamental underlying infrastructure of the distributed quantum computing ecosystem. Then they go further, by elaborating on a high-level system abstraction of the distributed quantum computing ecosystem. They describe such an abstraction through a set of logical layers. Thereby, they clarify dependencies among the aforementioned layers and, at the same time, a road-map emerges.
Journal Article
Optimization of resource-aware parallel and distributed computing: a review
This paper presents a review of state-of-the-art solutions concerning the optimization of computing in the field of parallel and distributed systems. Firstly, we contribute by identifying resources and quality metrics in this context including servers, network interconnects, storage systems, computational devices as well as execution time/performance, energy, security, and error vulnerability, respectively. We subsequently identify commonly used problem formulations and algorithms for integer linear programming, greedy algorithms, dynamic programming, genetic algorithms, particle swarm optimization, ant colony optimization, game theory, and reinforcement learning. Afterward, we characterize frequently considered optimization problems by stating these terms in domains such as data centers, cloud, fog, blockchain, high performance, and volunteer computing. Based on the extensive analysis, we identify how particular resources and corresponding quality metrics are considered in these domains and which problem formulations are used for which system types, either parallel or distributed environments. This allows us to formulate open research problems and challenges in this field and analyze research interest in problem formulations/domains in recent years.
Journal Article
Toward Creating a Subsurface Camera
In this article, the framework and architecture of a Subsurface Camera (SAMERA) are envisioned and described for the first time. A SAMERA is a geophysical sensor network that senses and processes geophysical sensor signals and computes a 3D subsurface image in situ in real time. The basic mechanism is geophysical waves propagating/reflected/refracted through subsurface enter a network of geophysical sensors, where a 2D or 3D image is computed and recorded; control software may be connected to this network to allow view of the 2D/3D image and adjustment of settings such as resolution, filter, regularization, and other algorithm parameters. System prototypes based on seismic imaging have been designed. SAMERA technology is envisioned as a game changer to transform many subsurface survey and monitoring applications, including oil/gas exploration and production, subsurface infrastructures and homeland security, wastewater and CO2 sequestration, and earthquake and volcano hazard monitoring. System prototypes for seismic imaging have been built. Creating SAMERA requires interdisciplinary collaboration and the transformation of sensor networks, signal processing, distributed computing, and geophysical imaging.
Journal Article
On implementing SWMR registers from SWSR registers in systems with Byzantine failures
The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport’s pioneering work (Lamport in Distrib Comput 1(2):77–101, 1986), this problem has been extensively studied in the context of asynchronous processes with crash failures. In this paper, we investigate this problem in the context of Byzantine process failures, with and without process signatures. We first prove that, without signatures, there is no wait-free linearizable implementation of a 1-writer n-reader register from atomic 1-writer 1-reader registers. In fact, we show a stronger result, namely, even under the assumption that the writer can only crash and at most one reader can be malicious, there is no linearizable implementation of a 1-writer n-reader register from atomic 1-writer (n-1)-reader registers that ensures that every correct process eventually completes its operations. In light of this impossibility result, we give two implementations of a 1-writer n-reader register from atomic 1-writer 1-reader registers that work under different assumptions. The first implementation is linearizable (under any combination of Byzantine process failures), but it guarantees that every correct process eventually completes its operations only under the assumption that the writer is correct or no reader is Byzantine—thus matching the impossibility result. The second implementation assumes process signatures; it is wait-free and linearizable under any number and combination of Byzantine process failures.
Journal Article
A reformed task scheduling algorithm for heterogeneous distributed systems with energy consumption constraints
As the scale increases and performance improves, the energy consumption of high-performance computer systems is rapidly increasing. The energy-aware task scheduling for high-performance computer systems has become a hot spot for major supercomputing centers and data centers. In this paper, we study the task scheduling problem to minimize the schedule length of parallel applications while satisfying the energy constraints in heterogeneous distributed systems. The existing approaches mainly allocate unassigned tasks with minimal energy consumption which cannot achieve optimistic scheduling length in most cases. Based on this situation, we propose a reformed scheduling method with energy consumption constraint algorithm, which is based on an energy consumption level to pre-allocate energy consumption for unassigned tasks. The experimental results show that compared with the existing algorithms, our new algorithm can achieve better scheduling length under the energy consumption constraints.
Journal Article