Asynchronous Communication Scheme Research Articles

Event-Based Fuzzy Tracking Control for Nonlinear Networked Systems Subject to Dynamic Quantization

This paper investigates the problem of event-based output feedback tracking control for discrete-time nonlinear networked systems with dynamic quantization. The Takagi-Sugeno (T-S) fuzzy systems theory is utilized to approximate the investigated nonlinear systems. Three general dynamic quantizers and an improved asynchronous event-triggering communication scheme are carried out to comprehensively decrease the amount of data in the communication of network and realize the rational utilization of limited communication resources. The objective is to design an event-based static output feedback tracking controller such that, in the presence of dynamic quantization, the closed-loop system can be asymptotically stabilized, and the tracking error achieves the predefined tracking performance. Moreover, the parameters for the desired dynamic quantizers and tracking controller can be obtained simultaneously by solving a set of linear matrix inequalities. Finally, the simulation responses are provided to demonstrate the validity of the proposed tracking control strategy.

Event-triggered scheme for finite-time distributed economic dispatch in smart grids

This paper considers the finite-time distributed economic dispatch problem in smart grids: the power generated by individual generators are designed to satisfy a certain demand while minimizing the total generation cost in a distributed manner, which guarantees the convergence in finite time. The proposed method facilitates the solution of real time power dispatch problems. First, a class of distributed economic dispatch algorithm is proposed to achieve the optimal solution in finite-time with and without capacity limitations. Second, in order to reduce the information exchange requirements, a distributed, asynchronous event-triggered communication scheme is established which is free of Zeno with guaranteed finite-time convergence. Furthermore, both proposed algorithms are robust to the time-varying communication networks. Simulation results illustrate the effectiveness and scalability of the distributed algorithms.

Asynchronous One-Way Range Measurement Applied to Microspace Probes

This paper presents a one-way range measurement method using an asynchronous communication scheme that is derived from Global Navigation Satellite Systems (GNSS) such as that represented by the Global Positioning System (GPS). The method does not require a transponder aboard a spacecraft and functions without a phase delay measurement facility using a highly stable clock on the ground. Besides, the method enables not only the range measurement but also the clock synchronization as well. This paper presents how it works and shows how it is practically applied to small and low-cost microspace probes flying in cislunar space and near-Earth interplanetary field. Semi-real-time positioning feasibility in cislunar space is also discussed.

Finite-Time Asynchronous Event-Triggered Formation of UAVs with Semi-Markov-Type Topologies.

In this paper, the finite-time formation problem of UAVs is investigated with consideration of semi-Markov-type switching topologies. More precisely, finite-time passivity performance is adopted to overcome the dynamical effect of disturbances. Furthermore, an asynchronous event-triggered communication scheme is proposed for more efficient information exchanges. The mode-dependent formation controllers are designed in terms of the Lyapunov–Krasovskii method, such that the configuration formation can be accomplished. Finally, simulation results are given to demonstrate the validity of the proposed formation approach.

Accelerating neural network training with distributed asynchronous and selective optimization (DASO)

With increasing data and model complexities, the time required to train neural networks has become prohibitively large. To address the exponential rise in training time, users are turning to data parallel neural networks (DPNN) and large-scale distributed resources on computer clusters. Current DPNN approaches implement the network parameter updates by synchronizing and averaging gradients across all processes with blocking communication operations after each forward-backward pass. This synchronization is the central algorithmic bottleneck. We introduce the distributed asynchronous and selective optimization (DASO) method, which leverages multi-GPU compute node architectures to accelerate network training while maintaining accuracy. DASO uses a hierarchical and asynchronous communication scheme comprised of node-local and global networks while adjusting the global synchronization rate during the learning process. We show that DASO yields a reduction in training time of up to 34% on classical and state-of-the-art networks, as compared to current optimized data parallel training methods.

Addressing Scalability with Message Queues: Architecture and Use Cases for DIRAC Interware

The Message Queue (MQ) architecture is an asynchronous communication scheme that provides an attractive solution for certain scenarios in a distributed computing model. The introduction of MQ as an intermediate component in-between the interacting processes allows to decouple the end-points making the system more flexible and providing high scalability and redundancy. DIRAC is a general-purpose interware software for distributed computing systems, which offers a common interface to a number of heterogeneous providers and guarantees transparent and reliable usage of the resources. The DIRAC platform has been adapted by several scientific projects, including High Energy Physics communities like LHCb, the Linear Collider and Belle2. A Message Queue generic interface has been incorporated into the DIRAC framework to help solving the scalability challenges that must be addressed during LHC Run3, starting in 2021. It allows to use the MQ scheme for a message exchange among the DIRAC components or to communicate with third-party services. Within this contribution we describe the integration of MQ systems with DIRAC and several use cases are shown. Message Queues are foreseen to be used in the pilot logging system, and as a backbone of the DIRAC component logging system and monitoring.

A Scalable Parallel PWTD-Accelerated SIE Solver for Analyzing Transient Scattering From Electrically Large Objects

A scalable parallel plane-wave time-domain (PWTD) algorithm for efficient and accurate analysis of transient scattering from electrically large objects is presented. The algorithm produces scalable communication patterns on very large numbers of processors by leveraging two mechanisms: 1) a hierarchical parallelization strategy to evenly distribute the computation and memory loads at all levels of the PWTD tree among processors and 2) a novel asynchronous communication scheme to reduce the cost and memory requirement of the communications between the processors. The efficiency and accuracy of the algorithm are demonstrated through its applications to the analysis of transient scattering from a perfect electrically conducting (PEC) sphere with a diameter of 70 wavelengths and a PEC square plate with a dimension of 160 wavelengths. Furthermore, the proposed algorithm is used to analyze transient fields scattered from realistic airplane and helicopter models under high frequency excitation.

A prospect for computing in porous materials research: Very large fluid flow simulations

Properties of porous materials, abundant both in nature and industry, have broad influences on societies via, e.g. oil recovery, erosion, and propagation of pollutants. The internal structure of many porous materials involves multiple scales which hinders research on the relation between structure and transport properties: typically laboratory experiments cannot distinguish contributions from individual scales while computer simulations cannot capture multiple scales due to limited capabilities. Thus the question arises how large domain sizes can in fact be simulated with modern computers. This question is here addressed using a realistic test case; it is demonstrated that current computing capabilities allow the direct pore-scale simulation of fluid flow in porous materials using system sizes far beyond what has been previously reported. The achieved system sizes allow the closing of some particular scale gaps in, e.g. soil and petroleum rock research. Specifically, a full steady-state fluid flow simulation in a porous material, represented with an unprecedented resolution for the given sample size, is reported: the simulation is executed on a CPU-based supercomputer and the 3D geometry involves 16,3843 lattice cells (around 590 billion of them are pore sites). Using half of this sample in a benchmark simulation on a GPU-based system, a sustained computational performance of 1.77 PFLOPS is observed. These advances expose new opportunities in porous materials research. The implementation techniques here utilized are standard except for the tailored high-performance data layouts as well as the indirect addressing scheme with a low memory overhead and the truly asynchronous data communication scheme in the case of CPU and GPU code versions, respectively.

Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication

This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost function is strictly convex, we establish asymptotic convergence under connected graph topologies. We also characterize the algorithm’s correctness under time-varying interaction topologies and study its privacy preservation properties. Motivated by practical considerations, we analyze the algorithm implementation with discrete-time communication. We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication. Building on this result, we design a provably-correct centralized event-triggered communication scheme that is free of Zeno behavior. Finally, we develop a distributed, asynchronous event-triggered communication scheme that is also free of Zeno with asymptotic convergence guarantees. Several simulations illustrate our results.

An asynchronous communication system based on the hyperchaotic system of 6th-order cellular neural network

This paper proposes a novel asynchronous communication scheme. Based on this scheme, a model using the hyperchaotic system of 6th-order Cellular Neural Network (CNN) is designed. This scheme enhances the security of asynchronous communication compared to the conventional ones. It is noteworthy that the proposed communication scheme does not depend on synchronization, and almost all chaotic systems can be involved in this scheme. Numerical simulations show the effectiveness of this scheme.

High-performance blob-based iterative three-dimensional reconstruction in electron tomography using multi-GPUs

BackgroundThree-dimensional (3D) reconstruction in electron tomography (ET) has emerged as a leading technique to elucidate the molecular structures of complex biological specimens. Blob-based iterative methods are advantageous reconstruction methods for 3D reconstruction in ET, but demand huge computational costs. Multiple graphic processing units (multi-GPUs) offer an affordable platform to meet these demands. However, a synchronous communication scheme between multi-GPUs leads to idle GPU time, and a weighted matrix involved in iterative methods cannot be loaded into GPUs especially for large images due to the limited available memory of GPUs.ResultsIn this paper we propose a multilevel parallel strategy combined with an asynchronous communication scheme and a blob-ELLR data structure to efficiently perform blob-based iterative reconstructions on multi-GPUs. The asynchronous communication scheme is used to minimize the idle GPU time so as to asynchronously overlap communications with computations. The blob-ELLR data structure only needs nearly 1/16 of the storage space in comparison with ELLPACK-R (ELLR) data structure and yields significant acceleration.ConclusionsExperimental results indicate that the multilevel parallel scheme combined with the asynchronous communication scheme and the blob-ELLR data structure allows efficient implementations of 3D reconstruction in ET on multi-GPUs.

Transmission time analysis for the parallel asynchronous communication scheme

In asynchronous systems, the sender encodes a data word with a code word from an unordered code and transmits the code word on the parallel bus lines. In this paper, a transmission time analysis for the above parallel asynchronous communication scheme is presented. It is proven that the average transmission time for a code word is a strictly increasing function of the weight of the code word and it approaches the worst transmission time possible when the weight goes to infinity. This implies that fast parallel asynchronous systems can be designed using low weight codes. This paper also analyzes the transmission time performances of the proximity detecting codes and gives some efficient low constant weight code designs.