9,895 research outputs found

    Asymptotically Optimal Approximation Algorithms for Coflow Scheduling

    Full text link
    Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful abstraction for modeling such scenarios is a {\em coflow}, which is a collection of flows (e.g., tasks, packets, data transmissions) that all share the same performance goal. In this paper, we present the first approximation algorithms for scheduling coflows over general network topologies with the objective of minimizing total weighted completion time. We consider two different models for coflows based on the nature of individual flows: circuits, and packets. We design constant-factor polynomial-time approximation algorithms for scheduling packet-based coflows with or without given flow paths, and circuit-based coflows with given flow paths. Furthermore, we give an O(logn/loglogn)O(\log n/\log \log n)-approximation polynomial time algorithm for scheduling circuit-based coflows where flow paths are not given (here nn is the number of network edges). We obtain our results by developing a general framework for coflow schedules, based on interval-indexed linear programs, which may extend to other coflow models and objective functions and may also yield improved approximation bounds for specific network scenarios. We also present an experimental evaluation of our approach for circuit-based coflows that show a performance improvement of at least 22% on average over competing heuristics.Comment: Fixed minor typo

    Prioritizing BIM Capabilities of an Organization: An Interpretive Structural Modeling Analysis

    Get PDF
    The Indian Architectural Engineering and Construction sector is grappling with the adoption of BIM as is evident from a relatively low level of adoption. While there have been sufficient number of successful (and unsuccessful) project level implementations of BIM in India, the maturity level of the overall industry and its constituents remains relatively low. One of the challenges faced, especially at the organizational level, is an understanding and development of the organization's BIM capabilities. These capabilities need attention in terms of their effectiveness and hierarchy of implementation in order to overcome the challenges of adoption and increasing maturity levels in BIM usage. The inability to identify crucial BIM capabilities is one of the primary barriers to ineffective BIM implementation and slow adoption in India. The aim of this study is to investigate the dynamics of different BIM capabilities and to understand how these capabilities can be represented as a set of interrelated elements by adopting Interpretive Structure Modeling (ISM) technique Accordingly, a clear understanding regarding the nature of each BIM capability is developed that will help the organizations to plan the strategic implementation of BIM on any project and gain systematic, logical and productive results. Through the three-phased study, it was concluded that BIM capabilities namely visualization, energy and environment analysis, structural analysis, MEP system modelling, constructability analysis, and BIM for as-built were found to be the independent BIM capabilities having strong driving power but weak dependence power. Facilities management is a dependent BIM capability with weak driving power but strong dependence power. This study provides a roadmap to BIM implementers by highlighting the driving and dependence power of each BIM capability which is deemed useful for enhanced delivery of construction projects. Significant theoretical and practical implications are envisioned for both researchers and project managers through the findings of this study

    A study of the transmission characteristics of suppressor nozzles

    Get PDF
    The internal noise radiation characteristics for a single stream 12 lobe 24 tube suppressor nozzle, and for a dual stream 36 chute suppressor nozzle were investigated. An equivalent single round conical nozzle and an equivalent coannular nozzle system were also tested to provide a reference for the two suppressors. The technique utilized a high voltage spark discharge as a noise source within the test duct which permitted separation of the incident, reflected and transmitted signals in the time domain. These signals were then Fourier transformed to obtain the nozzle transmission coefficient and the power transfer function. These transmission parameters for the 12 lobe, 24 tube suppressor nozzle and the reference conical nozzle are presented as a function of jet Mach number, duct Mach number polar angle and temperature. Effects of simulated forward flight are also considered for this nozzle. For the dual stream, 36 chute suppressor, the transmission parameters are presented as a function of velocity ratios and temperature ratios. Possible data for the equivalent coaxial nozzle is also presented. Jet noise suppression by these nozzles is also discussed

    On Approximating Restricted Cycle Covers

    Get PDF
    A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. The weight of a cycle cover of an edge-weighted graph is the sum of the weights of its edges. We come close to settling the complexity and approximability of computing L-cycle covers. On the one hand, we show that for almost all L, computing L-cycle covers of maximum weight in directed and undirected graphs is APX-hard and NP-hard. Most of our hardness results hold even if the edge weights are restricted to zero and one. On the other hand, we show that the problem of computing L-cycle covers of maximum weight can be approximated within a factor of 2 for undirected graphs and within a factor of 8/3 in the case of directed graphs. This holds for arbitrary sets L.Comment: To appear in SIAM Journal on Computing. Minor change

    Identifying Implementation Bugs in Machine Learning based Image Classifiers using Metamorphic Testing

    Full text link
    We have recently witnessed tremendous success of Machine Learning (ML) in practical applications. Computer vision, speech recognition and language translation have all seen a near human level performance. We expect, in the near future, most business applications will have some form of ML. However, testing such applications is extremely challenging and would be very expensive if we follow today's methodologies. In this work, we present an articulation of the challenges in testing ML based applications. We then present our solution approach, based on the concept of Metamorphic Testing, which aims to identify implementation bugs in ML based image classifiers. We have developed metamorphic relations for an application based on Support Vector Machine and a Deep Learning based application. Empirical validation showed that our approach was able to catch 71% of the implementation bugs in the ML applications.Comment: Published at 27th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2018

    Polylithiated (OLi2) functionalized graphane as a potential hydrogen storage material

    Full text link
    Hydrogen storage capacity, stability, bonding mechanism and the electronic structure of polylithiated molecules (OLi2) functionalized graphane (CH) has been studied by means of first principle density functional theory (DFT). Molecular dynamics (MD) have confirmed the stability, while Bader charge analysis describe the bonding mechanism of OLi2 with CH. The binding energy of OLi2 on CH sheet has been found to be large enough to ensure its uniform distribution without any clustering. It has been found that each OLi2 unit can adsorb up to six H2 molecules resulting into a storage capacity of 12.90 wt% with adsorption energies within the range of practical H2 storage application.Comment: 11 pages, 4 figures, 1 table, Phys. Chem. Chem. Phys. (submitted

    Electronic structure and chemical bonding in Ti2AlC investigated by soft x-ray emission spectroscopy

    Full text link
    The electronic structure of the nanolaminated transition metal carbide Ti2AlC has been investigated by bulk-sensitive soft x-ray emission spectroscopy. The measured Ti L, C K and Al L emission spectra are compared with calculated spectra using ab initio density-functional theory including dipole matrix elements. The detailed investigation of the electronic structure and chemical bonding provides increased understanding of the physical properties of this type of nanolaminates. Three different types of bond regions are identified; the relatively weak Ti 3d - Al 3p hybridization 1 eV below the Fermi level, and the Ti 3d - C 2p and Ti 3d - C 2s hybridizations which are stronger and deeper in energy are observed around 2.5 eV and 10 eV below the Fermi level, respectively. A strongly modified spectral shape of the 3s final states in comparison to pure Al is detected for the buried Al monolayers indirectly reflecting the Ti 3d - Al 3p hybridization. The differences between the electronic and crystal structures of Ti2AlC, Ti3AlC2 and TiC are discussed in relation to the number of Al layers per Ti layer in the two former systems and the corresponding change of the unusual materials properties.Comment: 14 pages, 7 figures; PACS:78.70.En, 71.15.Mb, 71.20.-

    Random manifolds in non-linear resistor networks: Applications to varistors and superconductors

    Full text link
    We show that current localization in polycrystalline varistors occurs on paths which are, usually, in the universality class of the directed polymer in a random medium. We also show that in ceramic superconductors, voltage localizes on a surface which maps to an Ising domain wall. The emergence of these manifolds is explained and their structure is illustrated using direct solution of non-linear resistor networks
    corecore