Search

Magnon spintronics is an emerging field that explores the use of magnons, the quanta of spin waves in magnetic materials for information processing and communication. Achieving unidirectional information transport with fast switching capability is critical for the development of fast integrated magnonic circuits, which offer significant advantages in high-speed, low-power information processing. However, previous unidirectional information transport has primarily focused on Damon-Eshbach spin wave modes, which are non-switchable as their propagation direction is defined by the direction of the external field and cannot be changed in a short time. Here, we experimentally demonstrate a fast switchable unidirectional magnon emitter in the forward volume spin wave mode by a current-induced asymmetric Oersted field. Our findings reveal significant nonreciprocity and nanosecond switchability, underscoring the potential of the method to advance high-speed spin-wave processing networks., Comment: 15 pages, 4 figures

Bistability, a universal phenomenon found in diverse fields such as biology, chemistry, and physics, describes a scenario in which a system has two stable equilibrium states and resets to one of the two states. The ability to switch between these two states is the basis for a wide range of applications, particularly in memory and logic operations. Here, we present a universal approach to achieve bistable switching in magnonics, the field processing data using spin waves. As an exemplary application, we use magnonic bistability to experimentally demonstrate the still missing magnonic repeater. A pronounced bistable window is observed in a 1um wide magnonic conduit under an external rf drive characterized by two magnonic stable states defined as low and high spin-wave amplitudes. The switching between these two states is realized by another propagating spin wave sent into the rf driven region. This magnonic bistable switching is used to design the magnonic repeater, which receives the original decayed and distorted spin wave and regenerates a new spin wave with amplified amplitude and normalized phase. Our magnonic repeater is proposed to be installed at the inputs of each magnonic logic gate to overcome the spin-wave amplitude degradation and phase distortion during previous propagation and achieve integrated magnonic circuits or magnonic neuromorphic networks., Comment: 13 pages, 4 figures

Network embedding (NE) can generate succinct node representations for massive-scale networks and enable direct applications of common machine learning methods to the network structure. Various NE algorithms have been proposed and used in a number of applications, such as node classification and link prediction. NE algorithms typically contain hyperparameters that are key to performance, but the hyperparameter tuning process can be time consuming. It is desirable to have the hyperparameters tuned within a specified length of time. Although AutoML methods have been applied to the hyperparameter tuning of NE algorithms, the problem of how to tune hyperparameters in a given period of time is not studied for NE algorithms before. In this paper, we propose JITuNE, a just-in-time hyperparameter tuning framework for NE algorithms. Our JITuNE framework enables the time-constrained hyperparameter tuning for NE algorithms by employing the tuning over hierarchical network synopses and transferring the knowledge obtained on synopses to the whole network. The hierarchical generation of synopsis and a time-constrained tuning method enable the constraining of overall tuning time. Extensive experiments demonstrate that JITuNE can significantly improve performances of NE algorithms, outperforming state-of-the-art methods within the same number of algorithm runs.

An ever increasing number of configuration parameters are provided to system users. But many users have used one configuration setting across different workloads, leaving untapped the performance potential of systems. A good configuration setting can greatly improve the performance of a deployed system under certain workloads. But with tens or hundreds of parameters, it becomes a highly costly task to decide which configuration setting leads to the best performance. While such task requires the strong expertise in both the system and the application, users commonly lack such expertise. To help users tap the performance potential of systems, we present BestConfig, a system for automatically finding a best configuration setting within a resource limit for a deployed system under a given application workload. BestConfig is designed with an extensible architecture to automate the configuration tuning for general systems. To tune system configurations within a resource limit, we propose the divide-and-diverge sampling method and the recursive bound-and-search algorithm. BestConfig can improve the throughput of Tomcat by 75%, that of Cassandra by 63%, that of MySQL by 430%, and reduce the running time of Hive join job by about 50% and that of Spark join job by about 80%, solely by configuration adjustment.

To support the variety of Big Data use cases, many Big Data related systems expose a large number of user-specifiable configuration parameters. Highlighted in our experiments, a MySQL deployment with well-tuned configuration parameters achieves a peak throughput as 12 times much as one with the default setting. However, finding the best setting for the tens or hundreds of configuration parameters is mission impossible for ordinary users. Worse still, many Big Data applications require the support of multiple systems co-deployed in the same cluster. As these co-deployed systems can interact to affect the overall performance, they must be tuned together. Automatic configuration tuning with scalability guarantees (ACTS) is in need to help system users. Solutions to ACTS must scale to various systems, workloads, deployments, parameters and resource limits. Proposing and implementing an ACTS solution, we demonstrate that ACTS can benefit users not only in improving system performance and resource utilization, but also in saving costs and enabling fairer benchmarking.

This document outlines the approach to supporting cross-node transactions over a Redis cluster.

Although ACID is the previous golden rule for transaction support, durability is now not a basic requirement for data storage. Rather, high availability is becoming the first-class property required by online applications. We show that high availability of data is almost surely a stronger property than durability. We thus propose ACIA (Atomicity, Consistency, Isolation, Availability) as the new standard for transaction support. Essentially, the shift from ACID to ACIA is due to the change of assumed conditions for data management. Four major condition changes exist. With ACIA transactions, more diverse requirements can be flexibly supported for applications through the specification of consistency levels, isolation levels and fault tolerance levels. Clarifying the ACIA properties enables the exploitation of techniques used for ACID transactions, as well as bringing about new challenges for research.

Highly-available datastores are widely deployed for online applications. However, many online applications are not contented with the simple data access interface currently provided by highly-available datastores. Distributed transaction support is demanded by applications such as large-scale online payment used by Alipay or Paypal. Current solutions to distributed transaction can spend more than half of the whole transaction processing time in distributed commit. An efficient atomic commit protocol is highly desirable. This paper presents the HACommit protocol, a logless one-phase commit protocol for highly-available systems. HACommit has transaction participants vote for a commit before the client decides to commit or abort the transaction; in comparison, the state-of-the-art practice for distributed commit is to have the client decide before participants vote. The change enables the removal of both the participant logging and the coordinator logging steps in the distributed commit process; it also makes possible that, after the client initiates the transaction commit, the transaction data is visible to other transactions within one communication roundtrip time (i.e., one phase). In the evaluation with extensive experiments, HACommit outperforms recent atomic commit solutions for highly-available datastores under different workloads. In the best case, HACommit can commit in one fifth of the time 2PC does., Comment: 11 pages