376,333 research outputs found

    Parallel Batch-Dynamic Graph Connectivity

    Full text link
    In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. The most well known sequential algorithm for dynamic connectivity is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves O(log2n)O(\log^2 n) amortized time per edge insertion or deletion, and O(logn/loglogn)O(\log n / \log\log n) time per query. We design a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large. Given a sequence of batched updates, where Δ\Delta is the average batch size of all deletions, our algorithm achieves O(lognlog(1+n/Δ))O(\log n \log(1 + n / \Delta)) expected amortized work per edge insertion and deletion and O(log3n)O(\log^3 n) depth w.h.p. Our algorithm answers a batch of kk connectivity queries in O(klog(1+n/k))O(k \log(1 + n/k)) expected work and O(logn)O(\log n) depth w.h.p. To the best of our knowledge, our algorithm is the first parallel batch-dynamic algorithm for connectivity.Comment: This is the full version of the paper appearing in the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 201

    Selective maintenance optimisation for series-parallel systems alternating missions and scheduled breaks with stochastic durations

    Get PDF
    This paper deals with the selective maintenance problem for a multi-component system performing consecutive missions separated by scheduled breaks. To increase the probability of successfully completing its next mission, the system components are maintained during the break. A list of potential imperfect maintenance actions on each component, ranging from minimal repair to replacement is available. The general hybrid hazard rate approach is used to model the reliability improvement of the system components. Durations of the maintenance actions, the mission and the breaks are stochastic with known probability distributions. The resulting optimisation problem is modelled as a non-linear stochastic programme. Its objective is to determine a cost-optimal subset of maintenance actions to be performed on the components given the limited stochastic duration of the break and the minimum system reliability level required to complete the next mission. The fundamental concepts and relevant parameters of this decision-making problem are developed and discussed. Numerical experiments are provided to demonstrate the added value of solving this selective maintenance problem as a stochastic optimisation programme

    Parallel Weighted Random Sampling

    Get PDF
    Data structures for efficient sampling from a set of weighted items are an important building block of many applications. However, few parallel solutions are known. We close many of these gaps both for shared-memory and distributed-memory machines. We give efficient, fast, and practicable algorithms for sampling single items, k items with/without replacement, permutations, subsets, and reservoirs. We also give improved sequential algorithms for alias table construction and for sampling with replacement. Experiments on shared-memory parallel machines with up to 158 threads show near linear speedups both for construction and queries

    Rehabilitation of a water distribution system using sequential multiobjective optimization models

    Get PDF
    Identification of the optimal rehabilitation plan for a large water distribution system (WDS) with a substantial number of decision variables is a challenging task, especially when no supercomputer facilities are available. This paper presents an initiative methodology for the rehabilitation of WDS based on three sequential stages of multiobjective optimization models for gradually identifying the best-known Pareto front (PF). A two-objective optimization model is used in the first two stages where the objectives are to minimize rehabilitated infrastructure costs and operational costs. The optimization model in the first stage applies to a skeletonized WDS. The PFs obtained in Stage 1 are further improved in Stage 2 using the same two-objective optimization problem but for the full network. The third stage employs a three-objective optimization model by minimizing the cost of additional pressure reducing valves (PRVs) as the third objective. The suggested methodology was demonstrated through use of a real and large WDS from the literature. Results show the efficiency of the suggested methodology to achieve the optimal solutions for a large WDS in a reasonable computational time. Results also suggest the minimum total costs that will be obtained once maximum leakage reduction is achieved due to maximum possible pipeline rehabilitation without increasing the existing tanks
    corecore