اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTransmission Line Inspires A New Distributed Algorithm to Solve the Nonlinear Dynamical System of Physical Circuit
333
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As known, physical circuits, e.g. integrated circuits or power system, work in a distributed manner, but these circuits could not be easily simulated in a distributed way. This is mainly because that the dynamical system of physical circuits is nonlinear and the linearized system of physical circuits is nonsymmetrical. This paper proposes a simple and natural strategy to mimic the distributed behavior of the physical circuit by mimicking the distributed behavior of the internal wires inside this circuit. Mimic Transmission Method (MTM) is a new distributed algorithm to solve the nonlinear ordinary differential equations extracted from physical circuits. It maps the transmission delay of interconnects between subcircuits to the communication delay of digital data link between processors. MTM is a black-box algorithm. By mimicking the transmission lines, MTM seals the nonlinear dynamical system within the subcircuit. As the result, we do not need to pay attention on how to solve the nonlinear dynamic system or nonsymmetrical linear system in parallel. MTM is a global direct algorithm, and it does only one distributed computation at each time window to obtain accurate result, so unconvergence issues do not need to be worried about.
قيم البحث
اقرأ أيضاً
In this paper, we propose a new parallel algorithm which could work naturally on the parallel computer with arbitrary number of processors. This algorithm is named Virtual Transmission Method (VTM). Its physical backgroud is the lossless transmission
line and microwave network. The basic idea of VTM is to insert lossless transmission lines into the sparse linear system to achieve distributed computing. VTM is proved to be convergent to solve SPD linear system. Preconditioning method and performance model are presented. Numerical experiments show that VTM is efficient, accurate and stable. Accompanied with VTM, we bring in a new technique to partition the symmetric linear system, which is named Generalized Node & Branch Tearing (GNBT). It is based on Kirchhoffs Current Law from circuit theory. We proved that GNBT is feasible to partition any SPD linear system.
Waveform Relaxation method (WR) is a beautiful algorithm to solve Ordinary Differential Equations (ODEs). However, because of its poor convergence capability, it was rarely used. In this paper, we propose a new distributed algorithm, named Waveform T
ransmission Method (WTM), by virtually inserting waveform transmission lines into the dynamical system to achieve distributed computing of extremely large ODEs. WTM has better convergence capability than the traditional WR algorithms.
According to the pay-per-use model adopted in clouds, the more the resources consumed by an application running in a cloud computing environment, the greater the amount of money the owner of the corresponding application will be charged. Therefore, a
pplying intelligent solutions to minimize the resource consumption is of great importance. Because centralized solutions are deemed unsuitable for large-distributed systems or large-scale applications, we propose a fully distributed algorithm (called DRA) to overcome the scalability issues. Specifically, DRA migrates the inter-communicating components of an application, such as processes or virtual machines, close to each other to minimize the total resource consumption. The migration decisions are made in a dynamic way and based only on local information. We prove that DRA achieves convergence and results always in the optimal solution.
A strong photon-photon nonlinear interaction is a necessary condition for photon blockade. Moreover, this nonlinearity can also result a bistable behavior in the cavity field. We analyze the relation between detecting field and photon blockade in a s
uperconducting circuit QED system, and show that photon blockade cannot occur when the detecting field is in the bistable regime. This photon blockade is the microwave-photonics analog of the Coulomb blockade. We further demonstrate that the photon transmission through such system can be controlled (from photon blockade to transparency) by the detecting field. Numerical calculations show that our proposal is experimentally realizable with current technology.
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental questions in
theory of distributed computing: what are the possible time complexity classes of LCL problems in the LOCAL model? In essence, we have a graph problem $Pi$ in which a solution can be verified by checking all radius-$O(1)$ neighbourhoods, and the question is what is the smallest $T$ such that a solution can be computed so that each node chooses its own output based on its radius-$T$ neighbourhood. Here $T$ is the distributed time complexity of $Pi$. The time complexity classes for deterministic algorithms in bounded-degree graphs that are known to exist by prior work are $Theta(1)$, $Theta(log^* n)$, $Theta(log n)$, $Theta(n^{1/k})$, and $Theta(n)$. It is also known that there are two gaps: one between $omega(1)$ and $o(log log^* n)$, and another between $omega(log^* n)$ and $o(log n)$. It has been conjectured that many more gaps exist, and that the overall time hierarchy is relatively simple -- indeed, this is known to be the case in restricted graph families such as cycles and grids. We show that the picture is much more diverse than previously expected. We present a general technique for engineering LCL problems with numerous different deterministic time complexities, including $Theta(log^{alpha}n)$ for any $alphage1$, $2^{Theta(log^{alpha}n)}$ for any $alphale 1$, and $Theta(n^{alpha})$ for any $alpha <1/2$ in the high end of the complexity spectrum, and $Theta(log^{alpha}log^* n)$ for any $alphage 1$, $smash{2^{Theta(log^{alpha}log^* n)}}$ for any $alphale 1$, and $Theta((log^* n)^{alpha})$ for any $alpha le 1$ in the low end; here $alpha$ is a positive rational number.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
