Search

A primary objective of a distributed storage system is to reliably store huge amounts of source data for long periods of time using a large number of high storage capacity nodes. Storage nodes are prone to permanent failures, where such node failures cause all stored data to be permanently lost, and failed nodes are replaced with nodes that initially store no data. To maintain recoverability of the source data as storage nodes fail and are replaced, a total amount of storage capacity that is larger than the source data size is allocated to store the source data, and a repairer continually reads data from and writes data to the storage nodes as they fail and are replaced. We prove information-theoretic lower bounds on the rate at which a repairer reads data from the storage system as a function of the rate at which nodes fail and the amount by which the allocated storage capacity exceeds the source data size. These lower bounds hold for any repairer, i.e., any repairer that does not read data at or above the lower bound rate will provably not maintain recoverability of the source data. The bounds are provably tight asymptotically as the number of storage nodes grows and the allocated storage capacity approaches the source data size. [ABSTRACT FROM AUTHOR]

With increasingly complex neural network architectures and heterogeneous device characteristics, finding a reasonable graph partitioning and device placement strategy is challenging. There have been prior attempts at learned approaches for solving device placement, these approaches are computationally expensive, unable to handle large graphs consisting over 50000 nodes, and do not generalize well to unseen graphs. To address all these limitations, we propose an efficient single-shot, generalized deep RL method (SGDP) based on a scalable sequential attention mechanism over a graph neural network that is transferable to new graphs. On a diverse set of representative deep learning models, our method on average achieves 20% improvement over human placement and 18% improvement over the prior art with 15× faster convergence. We are the first to demonstrate super human performance on 8-layer recurrent neural network language model and 8-layer GNMT consisting of over 50000 nodes, on 8-GPUs. We provide rationales and sensitivity study on model architecture selections. [ABSTRACT FROM AUTHOR]

Interactive model steering helps people incrementally build machine learning models that are tailored to their domain and task. Existing visual analytic tools allow people to steer a single model (e.g., assignment attribute weights used by a dimension reduction model). However, the choice of model is critical in such situations. What if the model chosen is suboptimal for the task, dataset, or question being asked? What if instead of parameterizing and steering this model, a different model provides a better fit? This paper presents a technique to allow users to inspect and steer multiple machine learning models. The technique steers and samples models from a broader set of learning algorithms and model types. We incorporate this technique into a visual analytic prototype, BEAMES, that allows users to perform regression tasks via multimodel steering. This paper demonstrates the effectiveness of BEAMES via a use case, and discusses broader implications for multimodel steering. [ABSTRACT FROM AUTHOR]