Quiescent consistency: Defining and verifying relaxed linearizability

Concurrent data structures like stacks, sets or queues need to be highly optimized to provide large degrees of parallelism with reduced contention. Linearizability, a key consistency condition for concurrent objects, sometimes limits the potential for optimization. Hence algorithm designers have started to build concurrent data structures that are not linearizable but only satisfy relaxed consistency requirements. In this paper, we study quiescent consistency as proposed by Shavit and Herlihy, which is one such relaxed condition. More precisely, we give the first formal definition of quiescent consistency, investigate its relationship with linearizability, and provide a proof technique for it based on (coupled) simulations. We demonstrate our proof technique by verifying quiescent consistency of a (non-linearizable) FIFO queue built using a diffraction tree. © 2014 Springer International Publishing Switzerland

Verifying linearizability on TSO architectures

Linearizability is the standard correctness criterion for fine-grained, non-atomic concurrent algorithms, and a variety of methods for verifying linearizability have been developed. However, most approaches assume a sequentially consistent memory model, which is not always realised in practice. In this paper we define linearizability on a weak memory model: the TSO (Total Store Order) memory model, which is implemented in the x86 multicore architecture. We also show how a simulation-based proof method can be adapted to verify linearizability for algorithms running on TSO architectures. We demonstrate our approach on a typical concurrent algorithm, spinlock, and prove it linearizable using our simulation-based approach. Previous approaches to proving linearizabilty on TSO architectures have required a modification to the algorithm's natural abstract specification. Our proof method is the first, to our knowledge, for proving correctness without the need for such modification

Defining correctness conditions for concurrent objects in multicore architectures

Correctness of concurrent objects is defined in terms of conditions that determine allowable relationships between histories of a concurrent object and those of the corresponding sequential object. Numerous correctness conditions have been proposed over the years, and more have been proposed recently as the algorithms implementing concurrent objects have been adapted to cope with multicore processors with relaxed memory architectures. We present a formal framework for defining correctness conditions for multicore architectures, covering both standard conditions for totally ordered memory and newer conditions for relaxed memory, which allows them to be expressed in uniform manner, simplifying comparison. Our framework distinguishes between order and commitment properties, which in turn enables a hierarchy of correctness conditions to be established. We consider the Total Store Order (TSO) memory model in detail, formalise known conditions for TSO using our framework, and develop sequentially consistent variations of these. We present a work-stealing deque for TSO memory that is not linearizable, but is correct with respect to these new conditions. Using our framework, we identify a new non-blocking compositional condition, fence consistency, which lies between known conditions for TSO, and aims to capture the intention of a programmer-specified fence

Diffractive deeply inelastic scattering of hadronic states with small transverse size

Diffractive deeply inelastic scattering from a hadron is described in terms of diffractive quark and gluon distributions. If the transverse size of the hadronic state is sufficiently small, these distributions are calculable using perturbation theory. We present such a calculation and discuss the underlying dynamics. We comment on the relation between this dynamics and the pattern of scaling violation observed in the hard diffraction of large-size states at HERA.Comment: 8 pages including 3 figures, REVTE

Admit your weakness: Verifying correctness on TSO architectures

“The final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-319-15317-9_22 ”.Linearizability has become the standard correctness criterion for fine-grained non-atomic concurrent algorithms, however, most approaches assume a sequentially consistent memory model, which is not always realised in practice. In this paper we study the correctness of concurrent algorithms on a weak memory model: the TSO (Total Store Order) memory model, which is commonly implemented by multicore architectures. Here, linearizability is often too strict, and hence, we prove a weaker criterion, quiescent consistency instead. Like linearizability, quiescent consistency is compositional making it an ideal correctness criterion in a component-based context. We demonstrate how to model a typical concurrent algorithm, seqlock, and prove it quiescent consistent using a simulation-based approach. Previous approaches to proving correctness on TSO architectures have been based on linearizabilty which makes it necessary to modify the algorithm’s high-level requirements. Our approach is the first, to our knowledge, for proving correctness without the need for such a modification

Evaluation of semiochemical based push-pull strategy for population suppression of ambrosia beetle vectors of laurel wilt disease in avocado.

Ambrosia beetles (Coleoptera: Curculionidae: Scolytinae and Platypodinae) bore into tree xylem to complete their life cycle, feeding on symbiotic fungi. Ambrosia beetles are a threat to avocado where they have been found to vector a symbiotic fungus, Raffaelea lauricola, the causal agent of the laurel wilt disease. We assessed the repellency of methyl salicylate and verbenone to two putative laurel wilt vectors in avocado, Xyleborus volvulus (Fabricius) and Xyleborus bispinatus (Eichhoff), under laboratory conditions. Then, we tested the same two chemicals released from SPLAT flowable matrix with and without low-dose ethanol dispensers for manipulation of ambrosia beetle populations occurring in commercial avocado. The potential active space of repellents was assessed by quantifying beetle catch on traps placed 'close' (~5-10 cm) and 'far' (~1-1.5 m) away from repellent dispensers. Ambrosia beetles collected on traps associated with all in-field treatments were identified to species to assess beetle diversity and community variation. Xyleborus volvulus was not repelled by methyl salicylate (MeSA) or verbenone in laboratory assays, while X. bispinatus was repelled by MeSA but not verbenone. Ambrosia beetle trap catches were reduced in the field more when plots were treated with verbenone dispensers (SPLAT) co-deployed with low-dose ethanol dispensers than when treated with verbenone alone. Beetle diversity was highest on traps deployed with low-dose ethanol lures. The repellent treatments and ethanol lures significantly altered the species composition of beetles captured in experiment plots. Our results indicate that verbenone co-deployed with ethanol lures holds potential for manipulating ambrosia beetle vectors via push-pull management in avocado. This tactic could discourage immigration and/or population establishment of ambrosia beetles in commercial avocado and function as an additional tool for management programs of laurel wilt

Lime, phosphorus and sulphur response of French serradella (Ornithopus sativus) grown in an acid upland soil

Soil acidity severely restricts legume persistence and growth in grazed upland agriculture in New Zealand. An alternative and potentially acid tolerant forage legume, French serradella (Ornithopus sativus), was examined in a climate controlled experiment. Plants were grown for 48 weeks in an acid (pHH20 4.9) upland soil and shoot yield measured every 8 weeks. Treatments were fully replicated combinations of lime (CaCO3; 0, 2, 4 or 8 t ha-1), phosphorus (P; 0, 50, 150 or 500 mg P L soil-1) plus various controls. Shoot yield varied significantly between lime treatments (P < 0.001), but were not strongly affected by P rate. Importantly, yields on the unlimed control treatments were 85% of maximum yield, suggesting that high yields are potentially achievable on even very acid soils. french serradella grew 16.9 g DM pot-1compared to 5.3 g DM pot-1 for the commonly grown reference species, subterranean clover (Trifolium subterraneum). French serradella showed significant potential as a new pasture legume suitable for acidic upland soils

Using coarse-grained abstractions to verify linearizability on TSO architectures

Most approaches to verifying linearizability assume a sequentially consistent memory model, which is not always realised in practice. In this paper we study correctness on a weak memory model: the TSO (Total Store Order) memory model, which is implemented in x86 multicore architectures. Our central result is a proof method that simplifies proofs of linearizability on TSO. This is necessary since the use of local buffers in TSO adds considerably to the verification overhead on top of the already subtle linearizability proofs. The proof method involves constructing a coarse-grained abstraction as an intermediate layer between an abstract description and the concurrent algorithm. This allows the linearizability proof to be split into two smaller components, where the effect of the local buffers in TSO is dealt with at a higher level of abstraction than it would have been otherwise

The Impacts of a Community-Based Health Education and Nutritional Support Program on Birth Outcomes Among Migrant Workers in Maesot, Thailand: A Retrospective Review

Here is presented a retrospective review of the Charis Project’s Family Engagement Program (FEN) as it existed in 2014-2017. FEN was a program of women’s health education, nutrition supplements, and family visitation. The education program consisted of a 12-week course on nutrition, maternity, and sex education taught individually and in groups, focusing on pregnant Burmese migrant laborers, but including approximately 20 percent male participation. The nutrition supplements consisted of 5 kilograms of fresh vegetables and 12 eggs weekly to pregnant mothers, from course onset to about six months after childbirth depending on family needs. Family visitation took place during food deliveries, and focused on individual counselling and family stability. The program served 39 families from 2014-2017. FEN did not reduce neonatal mortality (due to a miscarriage and severe congenital birth defect), but resulted in all surviving infants being born normal weight and surviving to the end of 2019, representing a significant improvement over the 25.6 percent low birth weights reported for Kayin State, Myanmar

Exclusive Production of Higgs Bosons in Hadron Colliders

We study the exclusive, double--diffractive production of the Standard Model Higgs particle in hadronic collisions at LHC and FNAL (upgraded) energies. Such a mechanism would provide an exceptionally clean signal for experimental detection in which the usual penalty for triggering on the rare decays of the Higgs could be avoided. In addition, because of the color singlet nature of the hard interaction, factorization is expected to be preserved, allowing the cross--section to be related to similar hard--diffractive events at HERA. Starting from a Fock state expansion in perturbative QCD, we obtain an estimate for the cross section in terms of the gluon structure functions squared of the colliding hadrons. Unfortunately, our estimates yield a production rate well below what is likely to be experimentally feasible.Comment: 17 pages, RevTeX file, four uufiled PostScript figures. UMPP #94-177. (Revised version. Some mistakenly missing Feynman diagrams are now added. Results do not change qualitatively. Paper reorganized.