283,838 research outputs found

    Energy-Aware Lease Scheduling in Virtualized Data Centers

    Full text link
    Energy efficiency has become an important measurement of scheduling algorithms in virtualized data centers. One of the challenges of energy-efficient scheduling algorithms, however, is the trade-off between minimizing energy consumption and satisfying quality of service (e.g. performance, resource availability on time for reservation requests). We consider resource needs in the context of virtualized data centers of a private cloud system, which provides resource leases in terms of virtual machines (VMs) for user applications. In this paper, we propose heuristics for scheduling VMs that address the above challenge. On performance evaluation, simulated results have shown a significant reduction on total energy consumption of our proposed algorithms compared with an existing First-Come-First-Serve (FCFS) scheduling algorithm with the same fulfillment of performance requirements. We also discuss the improvement of energy saving when additionally using migration policies to the above mentioned algorithms.Comment: 10 pages, 2 figures, Proceedings of the Fifth International Conference on High Performance Scientific Computing, March 5-9, 2012, Hanoi, Vietna

    New Algorithms for Balancing Energy Consumption and Performance in Computational Clusters

    Get PDF
    In this paper, we propose new real-time measurement-based scheduling algorithms to achieve a trade-off between the energy efficiency and the performance capability of computational clusters. An investigation is performed using a specific scenario of computing clusters with realistic parameters. Numerical results show that a trade-off between the performance and the energy efficiency can be controlled by the proposed algorithms

    ATLAS b-jet identification performance and efficiency measurement with tt¯ events in pp collisions at √s = 13 TeV

    Get PDF
    The algorithms used by the ATLAS Collaboration during Run 2 of the Large Hadron Collider to identify jets containing b-hadrons are presented. The performance of the algorithms is evaluated in the simulation and the efficiency with which these algorithms identify jets containing b-hadrons is measured in collision data. The measurement uses a likelihood-based method in a sample highly enriched in tt ¯ events. The topology of the t → W b decays is exploited to simultaneously measure both the jet flavour composition of the sample and the efficiency in a transverse momentum range from 20 to 600 GeV. The efficiency measurement is subsequently compared with that predicted by the simulation. The data used in this measurement, corresponding to a total integrated luminosity of 80.5 fb−1, were collected in proton–proton collisions during the years 2015–2017 at a centre-of-mass energy √s = 13 TeV. By simultaneously extracting both the efficiency and jet flavour composition, this measurement significantly improves the precision compared to previous results, with uncertainties ranging from 1 to 8% depending on the jet transverse momentum.La lista completa de autores puede verse al final del archivo asociado.Instituto de Física La Plat

    A New Perspective and Extension of the Gaussian Filter

    Full text link
    The Gaussian Filter (GF) is one of the most widely used filtering algorithms; instances are the Extended Kalman Filter, the Unscented Kalman Filter and the Divided Difference Filter. GFs represent the belief of the current state by a Gaussian with the mean being an affine function of the measurement. We show that this representation can be too restrictive to accurately capture the dependences in systems with nonlinear observation models, and we investigate how the GF can be generalized to alleviate this problem. To this end, we view the GF from a variational-inference perspective. We analyse how restrictions on the form of the belief can be relaxed while maintaining simplicity and efficiency. This analysis provides a basis for generalizations of the GF. We propose one such generalization which coincides with a GF using a virtual measurement, obtained by applying a nonlinear function to the actual measurement. Numerical experiments show that the proposed Feature Gaussian Filter (FGF) can have a substantial performance advantage over the standard GF for systems with nonlinear observation models.Comment: Will appear in Robotics: Science and Systems (R:SS) 201

    Rapid-purification protocols for optical homodyning

    Full text link
    We present a number of rapid-purification feedback protocols for optical homodyne detection of a single optical qubit. We derive first a protocol that speeds up the rate of increase of the average purity of the system, and find that like the equivalent protocol for a non-disspative measurement, this generates a deterministic evolution for the purity in the limit of strong feedback. We also consider two analogues of the Wiseman-Ralph rapid-purification protocol in this setting, and show that like that protocol they speed up the average time taken to reach a fixed level of purity. We also examine how the performance of these algorithms changes with detection efficiency, being an important practical consideration.Comment: 6 pages, revtex4, 3 eps figure

    Measurement of the ATLAS di-muon trigger efficiency in proton-proton collisions at 7 TeV

    Full text link
    At the LHC, muons are produced in many final states and used in a variety of analysis, such as Standard Model precision measurements and searches for new physics. The B-physics programme in ATLAS includes the measurement of CP violating effects in B meson decays, the search for rare b decay signatures, as well as the study of the production cross sections. The ATLAS detector can identify muons with high purity in a transverse momentum (pTp_{T}) range from a few GeV to several TeV. In order to achieve a high trigger efficiency for low pTp_{T} di-muon events and at the same time keep an acceptable trigger rate, dedicated trigger algorithms have been designed and implemented in the trigger menu since the 2010 data taking period. There are two categories of B-physics triggers, one topological and one non-topological. Both of these have been studied and their performance assessed using collision data at s\sqrt{s} = 7 TeV. The performance found with data has been verified with simulated events.Comment: This submission is part of the conference proceedings for PIC201

    Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver

    Full text link
    Recently variational quantum algorithms have been considered promising quantum computation methods, where the mainstream algorithms are based on the conventional quantum circuit scheme. However, in the Measurement-Based Quantum Computation (MBQC) scheme, multi-qubit rotation operations are implemented with a straightforward approach that only requires a constant number of single-qubit measurements, providing potential advantages in both resource cost and fidelity. The structure of Hamiltonian Variational Ansatz (HVA) aligns well with this characteristic. In this paper, we propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, alluded to as Measurement-Based Hamiltonian Variational Ansatz (MBHVA). We then demonstrate its effectiveness, efficiency, and advantages with two quantum many-body system models. Numerical experiments show that MBHVA is expected to reduce resource overhead compared to the construction of quantum circuits especially in the presence of large-scale multi-qubit rotation operations. Furthermore, when compared to measurement-based Hardware Efficient Ansatz (MBHEA) on quantum many-body system problems, MBHVA also demonstrates superior performance. We conclude that the MBQC scheme is potentially better suited for quantum simulation than the circuit-based scheme in terms of both resource efficiency and error mitigation

    Solar thermal collector yield: experimental validation of calculations based on steady-state and quasi-dynamic test methodologies

    Get PDF
    The characterization of collector efficiency is the fundamental tool for long term calculation of collector yield. It is, thus, one of the most important inputs in software tools aiming the design of solar thermal systems. Presently two test methodologies are available for characterization of the efficiency of glazed collectors: i) steady state test and ii) quasi-dynamic test, methodologies based in different model approaches to a solar collector, providing different collector efficiency curve parameters and, consequently, imposing different power calculation algorithms. Moreover, Horta et al (2008) demonstrated that the use of the collector efficiency curve derived from steady state test method is not enough for a thorough characterization of the long term performance of a collector. The present work takes into account the introduction of the above referred test methodologies in the European Test Standard for Solar Thermal Collectors, and aims at clarifying how each test results should be used in long term thermal performance calculations. The paper presents a synthesis of the different efficiency parameters provided by each test methodology and corresponding algorithms, applicable in the calculation of delivered power. Application of these algorithms to two days of measured data allows for a comparison of the results obtained with these different methodologies. For validation purposes, results of tests performed on a CPC type collector with a concentration ratio C=1.72 are used. Measurement sequences are used to validate the calculation of power delivered by the collector using both algorithms based on steady-state methodology (with and without correction) and quasi-dynamic methodology
    • …
    corecore