distributed quantum computing (DQC) is a rapidly evolving field with its own unique challenges. Distributing a quantum algorithm involves several key steps and considerations. The steps involve decomposition at variou...
详细信息
ISBN:
(纸本)9798331541378
distributed quantum computing (DQC) is a rapidly evolving field with its own unique challenges. Distributing a quantum algorithm involves several key steps and considerations. The steps involve decomposition at various levels of abstraction, given the underlying quantum stack and quantum network capabilities. In our DQC design explorations, we focus on the distribution at the algorithm and circuit levels. Algorithmic distribution involves distributing tasks before compilation, allowing different quantum processing units (QPUs) to receive distinct parts of an algorithm. Circuit distribution involves executing a quantum algorithm in a distributed manner at the circuit execution level using circuit and adaptive quantum technologies. If entanglement across QPUs is supported, then quantum states can be shared between qubits on remote quantum processors. This requires a specialized architecture with data and communication qubits with non-local gates such as telegates and teledata gates. This paper presents our progress towards a framework for exploring quantum distribution at the algorithm and circuit levels. Our implementation and case studies demonstrate the feasibility of our approach and show effective pathways for distributed quantum algorithm experiments.
This paper investigates distributed time-varying optimization-based formation tracking problems for discrete-time heterogeneous multi-agent systems with unknown disturbances. Firstly, an optimization-based formation t...
详细信息
ISBN:
(纸本)9798350354416;9798350354409
This paper investigates distributed time-varying optimization-based formation tracking problems for discrete-time heterogeneous multi-agent systems with unknown disturbances. Firstly, an optimization-based formation tracking problem with privacy preservation is established, which formulates the relation between the formation tracking and the distributed optimization on the formation reference. Then, a distributed formation tracking controller composing of differential privacy mechanism and stochastic subgradient method is designed. Furthermore, the privacy, stability and optimality are proved by utilizing the discrete-time Lyapunov method. Finally, numerical simulations demonstrate the effectiveness of the proposed method.
The edge computing paradigm brings the capabilities of the cloud such as on-demand resource availability to the edge for applications with low-latency and real-time requirements. While cloud-native load balancing and ...
详细信息
ISBN:
(纸本)9798350339024
The edge computing paradigm brings the capabilities of the cloud such as on-demand resource availability to the edge for applications with low-latency and real-time requirements. While cloud-native load balancing and scheduling algorithms strive to improve performance metrics like mean response times, real-time systems, that govern physical systems, must satisfy deadline requirements. This paper explores the potential of an edge computing architecture that utilizes the on-demand availability of computational resources to satisfy firm real-time requirements for applications with stochastic execution and inter-arrival times. As it might be difficult to know precise execution times of individual jobs prior to completion, we consider an admission policy that relies on single-bit execution time predictions for dispatching. We evaluate its performance in terms of the number of jobs that complete by their deadlines via simulations. The results indicate that the prediction-based admission policy can achieve reasonable performance for the considered settings.
Hardware testbeds play a crucial role in evaluating the energy consumption and performance of distributedsystems. In this paper, we present a multi-functional testbed for distributedsystems that is easily accessible...
详细信息
ISBN:
(纸本)9798350351866;9798350351859
Hardware testbeds play a crucial role in evaluating the energy consumption and performance of distributedsystems. In this paper, we present a multi-functional testbed for distributedsystems that is easily accessible, operable, and configurable. We describe the design, implementation, and orchestration of the testbed that consists of off-the-shelf devices with varying specifications, energy consumption, and network connectivity. Additionally, we provide all technical information in an opensource GitLab repository. Using the presented testbed, we evaluate in a specific test scenario the download time and energy consumption of a distributed caching system that operates using the InterPlanetary File System (IPFS) and the Multi Access Recoding System (MARS), an addition to IPFS using network coding. Our results show that an increase in the number of nodes in the network can significantly reduce download time for the user by 57%, while MARS is 10% faster than IPFS with less than 8 peers. The number of transmitting nodes does not affect the energy the user requires for the download process. Also, every node in the network requires less energy when more nodes are available. However, the overall energy required for the network rises significantly by 400%. Such network-wide observations are difficult to obtain in simulations or emulations, emphasizing the importance of using real testbeds to evaluate distributedsystems.
The main goal of this paper is to investigate continuous-time distributed dynamic programming (DP) algorithms for networked multi-agent Markov decision problems (MAMDPs). In our study, we adopt a distributed multi-age...
详细信息
ISBN:
(纸本)9798350354416;9798350354409
The main goal of this paper is to investigate continuous-time distributed dynamic programming (DP) algorithms for networked multi-agent Markov decision problems (MAMDPs). In our study, we adopt a distributed multi-agent framework where individual agents have access only to their own rewards, lacking insights into the rewards of other agents. Moreover, each agent has the ability to share its parameters with neighboring agents through a communication network, represented by a graph. We first introduce a novel distributed DP, inspired by the distributed optimization method of Wang and Elia. Next, a new distributed DP is introduced through a decoupling process. The convergence of the DP algorithms is proved through systems and control perspectives. The study in this paper sets the stage for new distributed temporal different learning algorithms.
In the pooled data problem we are given a set of n agents, each of which holds a hidden state bit, either 0 or 1. A querying procedure returns for a query set the sum of the states of the queried agents. The goal is t...
详细信息
ISBN:
(数字)9781665471770
ISBN:
(纸本)9781665471770
In the pooled data problem we are given a set of n agents, each of which holds a hidden state bit, either 0 or 1. A querying procedure returns for a query set the sum of the states of the queried agents. The goal is to reconstruct the states using as few queries as possible. In this paper we consider two noise models for the pooled data problem. In the noisy channel model, the result for each agent flips with a certain probability. In the noisy query model, each query result is subject to random Gaussian noise. Our results are twofold. First, we present and analyze for both error models a simple and efficient distributed algorithm that reconstructs the initial states in a greedy fashion. Our novel analysis pins down the range of error probabilities and distributions for which our algorithm reconstructs the exact initial states with high probability. Secondly, we present simulation results of our algorithm and compare its performance with approximate message passing (AMP) algorithms that are conjectured to be optimal in a number of related problems.
With the advancement and application of blockchain technology, its limitations in security, performance, and other aspects have become increasingly prominent. The cryptographic foundations that blockchain relies on ar...
详细信息
In the rapidly evolving digital technology landscape, community-oriented wearable computingsystems are emerging as a key tool for enhancing connectivity and interaction within communal spaces. This paper contributes ...
详细信息
ISBN:
(纸本)9798350304367;9798350304374
In the rapidly evolving digital technology landscape, community-oriented wearable computingsystems are emerging as a key tool for enhancing connectivity and interaction within communal spaces. This paper contributes to this burgeoning field by presenting the development and implementation of a proximity-based wearable computing testbed designed to forge stronger links within communities. The testbed exploits Ultra-Wideband (UWB) position sensors, 9-axis motion sensors, edge nodes, and a centralized server, forming a cohesive network that actively facilitates community interactions and engagements. By employing anchors and targets within the UWB sensors, the system achieves high precision in location and distance measurements, laying the groundwork for various proximity-based applications. Integrating 9-axis motion sensors and advanced edge nodes further underscores the system's versatility and robustness in wearable and edge computing. This paper delves into an in-depth exploration and evaluation of the proposed system's architecture, design, and implementation processes. It provides a comprehensive analysis of experimental results and discusses the system's potential impact on enhancing community networks, along with the future directions this technology could take.
With the rapid development of wireless sensor networks (WSNs) and the Internet of Things (IoT), increasing computing tasks are sinking to mobile edge networks, such as distributed learning systems. These systems benef...
详细信息
With the rapid development of wireless sensor networks (WSNs) and the Internet of Things (IoT), increasing computing tasks are sinking to mobile edge networks, such as distributed learning systems. These systems benefit from the massive amounts of data and computing power on mobile devices and can learn qualified models on the premise of protecting user privacy. In fact, coordinating mobile devices to participate in computing is challenging. On the one hand, the heterogeneous performance of devices makes it difficult to guarantee computing efficiency. On the other hand, there are unreliable factors in the mobile network, which will destroy the stability of the distributed learning. Therefore, we design a three-layer framework called an edge-intelligence-based distributed learning system (EIDLS). Specifically, a novel multilayer perceptron-based device availability evaluation model is proposed to select devices with good performance. The evaluation model performs online learning and optimization according to the resources (CPU, battery, etc.) of devices. Meanwhile, we propose a dynamic trust evaluation algorithm to reduce the side effects of unreliable devices. The experimental results of some commonly used datasets validate that the proposed EIDLS dramatically minimizes the energy consumption and communication cost and improves the calculation accuracy and the stability of the system.
Function-as-a-Service (FaaS) has emerged as a revolutionary service platform, abstracting the complexities of hardware, operating systems, and web hosting services. This allows developers to focus solely on implementi...
详细信息
暂无评论