Highly-Efficient Wait-Free Synchronization

We study a simple technique, originally presented by Herlihy (ACM Trans. Program. Lang. Syst. 15(5):745–770, 1993), for executing concurrently, in a wait-free manner, blocks of code that have been programmed for sequential execution and require significant synchronization in order to be performed in parallel. We first present an implementation of this technique, called Sim, which employs a collect object. We describe a simple implementation of a collect object from a single shared object that supports atomic Add (or XOR) in addition to read; this implementation has step complexity O(1). By plugging in to Sim this implementation, Sim exhibits constant step complexity as well. This allows us to derive lower bounds on the step complexity of implementations of several shared objects, like Add, XOR, collect, and snapshot objects, from LL/SC objects. We then present a practical version of Sim, called PSim, which is implemented in a real shared-memory machine. From a theoretical perspective, PSim has worse step complexity than Sim, its theoretical analog; in practice though, we experimentally show that PSim is highly-efficient: it outperforms several state-of-the-art lock-based and lock-free synchronization techniques, and this given that it is wait-free, i.e. that it satisfies a stronger progress condition than all the algorithms that it outperforms. We have used PSim to get highly-efficient wait-free implementations of stacks and queues.     

Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)

We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player’s payoffs are bounded and independent random variables, not necessarily identically distributed, but with almost common expectations. We show that the completely mixed uniform strategy profile, i.e., the combination of mixed strategies (one per player) where each player plays with equal probability each one of her available pure strategies, is with high probability a $\sqrt{\frac{\ln n}{n}}$ -Nash equilibrium and a $\sqrt{\frac{3\ln n}{n}}$ -well supported Nash equilibrium, where n is the number of pure strategies available to each player. This asserts that the completely mixed, uniform strategy profile is an almost Nash equilibrium for random bimatrix games, since it is, with high probability, an ?-well-supported Nash equilibrium where ? tends to zero as n tends to infinity.     

The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.     

Universal constructions that ensure disjoint-access parallelism and wait-freedom

A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object.     

Chemical investigation and antimicrobial properties of mastic water and its major constituents

Mastic water is a commercial flavouring obtained during the steam distillation of mastic resin (the resin of Pistacia lentiscus var. chia) for the production of mastic oil. The mastic water extracts were analysed by GC−MS. The major compounds identified were verbenone, α-terpineol, linalool and trans-pinocarveol. Overall the composition was found to be very different from that of mastic oil. Additional GC−MS revealed the enantiomeric ratio of the chiral constituents of mastic water. The antimicrobial activity of mastic water extract, as well as that of its major constituents, was examined against Escherichia coli, Staphylococcus aureus and Candida spp. including ATCC wild clinical and food-borne strains. Linalool and α-terpineol were found to be the most potent antimicrobial constituents. Finally the stability of mastic water at different temperatures was studied, showing no change in the GC−MS profile of the organic extract for a period of 4 months at storage temperatures up to 4 °C.     

Read-modify-write networks

A read-modify-write register for a set of functions F provides an operation that atomically (1) returns the variables current value v, and (2) replaces that value with f(v), where f is a function in F.A read-modify-write network is a distributed data structure that implements a concurrent, lock-free, low-contention read-modify-write register. For example, counting networks ([3]) are a family of read-modify-write networks that support atomic increments and decrements.We consider the problem of constructing read-modify-write networks for particular sets of functions. Of particular interest are the read-modify-write networks fetch&add, which add to the value an arbitrary number, and fetch&mul, which multiply the value by an arbitrary number.We identify a simple algebraic property of the function set F that requires any distributed read-modify-write implementation for F to have high latency. Any such network has sequential executions in which each token traverses a number of switching elements essentially linear in the number of processes. By contrast, there exist counting networks ([9, 18]) in which tokens traverse a logarithmic number of switches.We provide a matching upper bound for a large class of read-modify-write networks including fetch&add, fetch&mul, and related networks of interest.Received: 15 October 2002, Accepted: 15 May 2003, Published online: 6 February 2004Panagiota Fatourou: Partially supported by funds from the Program E. .E.A.E.K.II of the Greek Ministry of Education. Part of the work of theauthor was performed while at the Max-Planck Institut für Informatik,Saarbrücken, Germany, while at the Department of Computer Science,University of Toronto, Canada, and while visiting the Departmentof Computer Science, Brown University, Providence, USA.Maurice Herlihy: Partially supported by NSF grant 9912401.A preliminary version of this work appears in the Proceedings of the 15th International Symposium on DIStributed Computing, pp. 330-341, Lisbon, Portugal, October 2001. This work also appears as a brief announcement in the Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, August 2001.     

Effects of Monoterpenoids, Acting Alone or in Pairs, on Seed Germination and Subsequent Seedling Growth

We compared the potential allelopathic activity of 47 monoterpe- noids of different chemical groups, by estimating their effect on seed germination and subsequent growth of Lactuca sativa seedlings. Apart from individual compounds, eleven pairs at different proportions were also tested. As a group, the hydrocarbons, except for (+)-3-carene, were the least inhibitory. Of the oxygenated compounds, the least inhibitory were the acetates; whenever the free hydroxyl group of an alcohol turned into a carboxyl group, the activity of the resulting ester was markedly lower (against both germination and seedling growth). Twenty-four compounds were extremely active against seedling growth (inhibiting it by more than 85%), but only five against seed germination. The compounds that were most active against both processes belonged to the groups of ketones and alcohols; they were terpinen-4-ol, dihydrocarvone, and two carvone stereoisomers. We used a model to investigate whether compounds acted independently when applied in pairs. The combined effect varied. In half of the cases, it followed the pattern expected under the assumption of independence; in the rest, either synergistic or antagonistic interactions were found in both germination and elongation. However, even in cases of synergistic interactions, the level of inhibition was not comparable to that of a single extremely active compound, unless such a compound already participated in the combination. The specific structural factors that operate and determine the activity of monoterpenoids still remain rather obscure. The same holds true for the combined effect; its character cannot in general be predicted on the basis of individual compounds acting alone.     

Effect of Lactobacillus cultures on microbiological,chemical and odour changes during storage of rainbow trout fillets

The purpose of this study was to investigate the effect of applying two Lactobacillus protective cultures on microbiological, chemical and odour changes during storage of refrigerated vacuum‐packed rainbow trout (Oncorrynchus mykiss) fillets. Lactobacillus sakei CECT 4808 and Lb. curvatus CECT 904^T were inoculated individually or in combination into rainbow trout fillets. The samples were vacuum‐packed and stored at 4 ± 0.5 °C and were assessed during a 20‐day storage period for microbiological (Enterobacteriaceae, Pseudomonas spp., lactic acid bacteria (LAB), H₂S‐producing bacteria, yeasts and moulds) and chemical (pH, total volatile basic nitrogen, lipid oxidation) parameters and off‐odour. Samples inoculated with Lb. sakei and with both strains had significantly (P≤0.05) lower counts of all microbiological spoilage indicator organisms (Enterobacteriaceae, Pseudomonas spp., H₂S‐producing bacteria, yeasts and moulds) than those inoculated with Lb. curvatus or the controls. All chemical parameters examined and off‐odour scores were also significantly (P≤0.05) improved in the samples inoculated with Lb. sakei or with both strains compared with those inoculated with Lb. curvatus or the controls. Lb. sakei generally showed a better preservative effect (P≤0.05) than the combination of strains. Inoculation with Lb. sakei CECT 4808 could provide an additional hurdle to improve shelf‐life of refrigerated vacuum‐packaged trout fillets, as inoculation with this strain resulted in extension of shelf‐life by 5 days. Furthermore, this strain showed some antioxidative ability, which could retard lipid oxidation in fish. Copyright © 2006 Society of Chemical Industry