121 research outputs found

    A Robust Fault-Tolerant and Scalable Cluster-wide Deduplication for Shared-Nothing Storage Systems

    Full text link
    Deduplication has been largely employed in distributed storage systems to improve space efficiency. Traditional deduplication research ignores the design specifications of shared-nothing distributed storage systems such as no central metadata bottleneck, scalability, and storage rebalancing. Further, deduplication introduces transactional changes, which are prone to errors in the event of a system failure, resulting in inconsistencies in data and deduplication metadata. In this paper, we propose a robust, fault-tolerant and scalable cluster-wide deduplication that can eliminate duplicate copies across the cluster. We design a distributed deduplication metadata shard which guarantees performance scalability while preserving the design constraints of shared- nothing storage systems. The placement of chunks and deduplication metadata is made cluster-wide based on the content fingerprint of chunks. To ensure transactional consistency and garbage identification, we employ a flag-based asynchronous consistency mechanism. We implement the proposed deduplication on Ceph. The evaluation shows high disk-space savings with minimal performance degradation as well as high robustness in the event of sudden server failure.Comment: 6 Pages including reference

    Measurement of wetted area fraction in subcooled pool boiling of water using infrared thermography

    Get PDF
    The wetted area fraction in subcooled pool boiling of water at atmospheric pressure is measured using the DEPIcT (DEtection of Phase by Infrared Thermography) technique. DEPIcT exploits the contrast in infrared (IR) light emissions between wet and dry areas on the surface of an IR-transparent heater to visualize the instantaneous distribution of the liquid and gas phases in contact with the heater surface. In this paper time-averaged wetted area fraction data in nucleate boiling are reported as functions of heat flux (from 30% up to 100% of the Critical Heat Flux) and subcooling (ΔTsub = 0, 5, 10, 30 and 50 °C). The results show that the wetted area fraction monotonically decreases with increasing heat flux and increases with increasing subcooling: both trends are expected. The range of time-averaged wetted area fractions is from 90%, at low heat flux and high subcooling, to 50% at high heat flux (right before CHF) and low subcooling. It is also shown that the dry areas are periodically rewetted by liquid sloshing on the surface at any subcooling and heat flux; however, the dry areas expand irreversibly at CHF.MIT Energy Initiativ

    Game-based data offloading scheme for IoT system traffic congestion problems

    Get PDF
    Internet of things (IoT) is seen as another information and industrial wave after the invention of personal computers, the Internet, and mobile communication networks. Especially, IoT/cellular network integration becomes a new service platform for the different kinds of traffic manipulation. However, due to the excessive traffic demands, it is currently facing a severe traffic overload problem. In this paper, we propose a new traffic control scheme based on the data offloading technique. By using the Vickrey-Clarke-Groves (VCG) mechanism and Rubinstein bargaining game model, our data offloading approach can effectively alleviate the IoT traffic congestion while enhancing the quality-of-service (QoS) in cellular network systems. Finally, we show the effectiveness of our proposed scheme through extensive simulations. Document type: Articl

    CLARA: Classifying and Disambiguating User Commands for Reliable Interactive Robotic Agents

    Full text link
    In this paper, we focus on inferring whether the given user command is clear, ambiguous, or infeasible in the context of interactive robotic agents utilizing large language models (LLMs). To tackle this problem, we first present an uncertainty estimation method for LLMs to classify whether the command is certain (i.e., clear) or not (i.e., ambiguous or infeasible). Once the command is classified as uncertain, we further distinguish it between ambiguous or infeasible commands leveraging LLMs with situational aware context in a zero-shot manner. For ambiguous commands, we disambiguate the command by interacting with users via question generation with LLMs. We believe that proper recognition of the given commands could lead to a decrease in malfunction and undesired actions of the robot, enhancing the reliability of interactive robot agents. We present a dataset for robotic situational awareness, consisting pair of high-level commands, scene descriptions, and labels of command type (i.e., clear, ambiguous, or infeasible). We validate the proposed method on the collected dataset, pick-and-place tabletop simulation. Finally, we demonstrate the proposed approach in real-world human-robot interaction experiments, i.e., handover scenarios
    • …
    corecore