Ji Yin Wang
Please Note
10 records found
1
We study the current-phase relation (CPR) of an InSb-Al nanowire Josephson junction in parallel magnetic fields up to 700 mT. At high magnetic fields and in narrow voltage intervals of a gate under the junction, the CPR exhibits π shifts. The supercurrent declines within these gate intervals and shows asymmetric gate voltage dependence above and below them. We detect these features sometimes also at zero magnetic field. The observed CPR properties are reproduced by a theoretical model of supercurrent transport via interference between direct transmission and a resonant localized state.
Large data centers are currently the mainstream infrastructures for big data processing. As one of the most fundamental tasks in these environments, the efficient execution of distributed data operators (e.g., join and aggregation) are still challenging current data systems, and one of the key performance issues is network communication time. State-of-the-art methods trying to improve that problem focus on either application-layer data locality optimization to reduce network traffic or on network-layer data flow optimization to increase bandwidth utilization. However, the techniques in the two layers are totally independent from each other, and performance gains from a joint optimization perspective have not yet been explored. In this article, we propose a novel approach called NEAL (NEtwork-Aware Locality scheduling) to bridge this gap, and consequently to further reduce communication time for distributed big data operators. We present the detailed design and implementation of NEAL, and our experimental results demonstrate that NEAL always performs better than current approaches for different workloads and network bandwidth configurations.
Special Session - Emerging Memristor Based Memory and CIM Architecture
Test, Repair and Yield Analysis
Emerging memristor-based architectures are promising for data-intensive applications as these can enhance the computation efficiency, solve the data transfer bottleneck and at the same time deliver high energy efficiency using their normally-off/instant-on attributes. However, their storing devices are more susceptible to manufacturing defects compared to the traditional memory technologies because they are fabricated with new materials and require different manufacturing processes. Hence, in order to ensure correct functionalities for these technologies, it is necessary to have accurate fault modeling as well as proper test methodologies with high test coverage. In this paper, we propose technology specific cell-level defect modeling, accurate fault analysis and yield improvement solutions for memristor-based memory as well as Computation-In-Memory (CIM) architectures. Our overall contributions cover three abstraction levels, namely, device, architecture and system. First, we propose a device-aware test methodology in which we have introduced a key device-level characteristic to develop accurate defect model. Second, we demonstrate a yield analysis framework for memristor arrays considering reliability and permanent faults due to parametric variations and explore fault-tolerant solutions. Third, a lightweight on-line test and repair schemes is proposed for emerging CIM devices in machine learning applications.
A novel adaptive fuzzy dynamic surface control (DSC) scheme is for the first time constructed for a larger class of (multi-input multi-output) MIMO non-affine pure-feedback systems in the presence of input saturation nonlinearity. First of all, the restrictive differentiability assumption on non-affine functions has been canceled after using the piecewise functions to reconstruct the model for non-affine nonlinear functions. Then, a novel auxiliary system with bounded compensation term is firstly introduced to deal with input saturation, and the dynamic system employed in this work designs a bounded compensation term of tangent function. Thus, we successfully relax the strictly bounded assumption of the dynamic system. Additionally, the fuzzy logic systems (FLSs) are used to approximate unknown continuous systems functions, and the minimal learning parameter (MLP) technique is exploited to simplify control design and reduce the number of adaptive parameters. Finally, two simulation examples with input saturation are given to validate the effectiveness of the developed method.
In dynamic surface control (DSC) methods, the control gain functions of systems are always assumed to be bounded, which is a restrictive assumption. This work proposes a novel DSC approach for an extended class of strict-feedback nonlinear systems whose control gain functions are continuous and possibly unbounded. Appropriate compact sets are constructed in such a way that the trajectories of the closed-loop system do not leave these sets, therefore, in these sets, maximums and minimums values of the continuous control gain functions are well defined even if the control gain functions are possibly unbounded. By using Lyapunov theory and invariant set theory, semi-globally uniformly ultimately boundedness is analytically proved: all the signals of closed-loop system will always stay in these compact sets, while the tracking error is shown to converge to a residual set that can be made as small as desired by adjusting design parameters appropriately. Finally, the effectiveness of the designed method is demonstrated via two examples.
For the pure feedback systems with uncertain actuator nonlinearity and non-differentiable non-affine function, a novel adaptive neural control scheme is proposed. Firstly, the assumption that the non-affine function must be differentiable everywhere with respect to control input has been canceled; in addition, the proposed approach can not only be applicable to actuator input dead zone nonlinearity, but also to backlash nonlinearity without changing the controller. Secondly, the neural network (NN) is used to approximate unknown nonlinear functions of system generated in the process of control design and a nonlinear robust term is introduced to eliminate the actuator nonlinearity modeling error, the NN approximation error and the external disturbances. Semi-globally uniformly ultimately boundedness of all signals in the closed loop system is analytically proved by utilizing Lyapunov theory. Finally, the effectiveness of the designed method is demonstrated via two examples.
communication time of these operators in large systems is becoming increasingly important, and also challenging current techniques. Significant performance improvements have been achieved by using state-of-the-art methods, such as reducing network traffic designed in the data management domain, and data flow scheduling in the data communications domain.
However, the proposed techniques in both fields just view each other as a black box, and performance gains from a co-optimization perspective have not yet been explored.
In this paper, based on current research in coflow scheduling,
we propose a novel Coflow-based Co-optimization Framework
(CCF), which can co-optimize application-level data movement
and network-level data communications for distributed operators,
and consequently contribute to their performance in
large distributed environments. We present the detailed design
and implementation of CCF, and conduct an experimental
evaluation of CCF using large-scale simulations on large data
joins. Our results demonstrate that CCF can always perform
faster than current approaches on network communications in
large-scale distributed scenarios. ...
communication time of these operators in large systems is becoming increasingly important, and also challenging current techniques. Significant performance improvements have been achieved by using state-of-the-art methods, such as reducing network traffic designed in the data management domain, and data flow scheduling in the data communications domain.
However, the proposed techniques in both fields just view each other as a black box, and performance gains from a co-optimization perspective have not yet been explored.
In this paper, based on current research in coflow scheduling,
we propose a novel Coflow-based Co-optimization Framework
(CCF), which can co-optimize application-level data movement
and network-level data communications for distributed operators,
and consequently contribute to their performance in
large distributed environments. We present the detailed design
and implementation of CCF, and conduct an experimental
evaluation of CCF using large-scale simulations on large data
joins. Our results demonstrate that CCF can always perform
faster than current approaches on network communications in
large-scale distributed scenarios.