Atomic snapshots using lattice agreement

Summary Thesnapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to thelattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of read and write operations on atomic single-writer multi-reader registers. The transformation uses an unbounded amount of shared memory. We present a deterministic algorithm for lattice agreement that usedO (log² n) operations on 2-processorTest & Set registers, plusO (n) operations on atomic single-writer multi-reader registers. The shared objects are used by the algorithm in adynamic mode, that is, the identity of the processors that access each of the shared objects is determined dynamically during the execution of the algorithm. By a randomized implementation of 2-processorsTest & Set registers from atomic registers, this algorithm implies a randomized algorthm for lattice agreement that uses an expected number ofO (n) operations on (dynamic) atomic single-writer multi-reader registers. Combined with our transformation this yields implementations of atomic snapshots with the same complexity.Cambridge Research Laboratory, Digital Equipment Corporation Hagit Attiya received the B.Sc. degreeiin Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the departtment of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms. Maurice Herlihy received the A.B. degree in Mathematics from Harvard University, and the M.S. and the Ph.D. degrees in Computer Science from M.I.T. From 1984 to 1989 he was a faculty member in the Computer Science Department at Carnegie Mellon University in Pittsburgh, PA. In 1989 he joined the research staff at the Digital Equipment Corporation's Cambridge Research Laboratory in Cambridge MA. Since 1994, he has been on the faculty at the Computer Science Department at Brown University. Dr. Herlihy's research interests encompass practical and theoretical aspects of distributed and concurrent computation. Ophir achman received a B.A. in computer science from the Technion, Haifa, Israel in 1989 and M.Sc. in computer science from the Technion, Haifa, Israel, in 1992. He is now studying for a D.Sc. in computer science at the Technion. His currentarea of research is distributed computing, and in particular, asynchronous shared memory systems.This work appeared in preliminary form in proceedings ofthe 6th International Workshop on Distributed Algorithms [12]. This research was partially supported by grant No. 92-0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Technion V.P.R. funds — B. and G. Greenberg Research Fund (Ottawa), and the fund for the promotion of research in the TechnionPart of the work of this author was performed while visiting DEC Cambridge Research Laboratory     

A systolic array for the longest common subsequence problem

We introduce a linear systolic array for the Longest Common Subsequence (LCS, for short) problem. We first present an array of m identical cells which computes the length of an LCS of two strings of length m and n, respectively, in linear time (i.e., in time proportional to m + n). Then we show that, by extending any cell with the systolic stack introduced by Guibas and Liang (1982), a new array can be designed to recover an LCS in linear time.     

The modulation by neurosteroids of the scopolamine-induced learning impairment in mice involves an interaction with sigma1 (sigma1) receptors

Pulmonary tuberculosis: primary tuberculosis, usually asymptomatic, represents the first infection and is shown by a parenchymal mostly mid-pulmonary focus and satellite lymphadenopathy. Postprimary pulmonary tuberculosis, mostly located in the upper fields may be caused by endogenous reinfection for reactivation of a hematogenous focus formed during primary infection or from exogenous reinfection. Extrapulmonary tuberculosis: it includes numerous forms mostly from hematogenous spread. Miliary tuberculosis may involve a number of organs and apparatus besides the lung. Tuberculous meningitis predominantly involves the base of the skull, the fluid is clear with hypoglycorrhachia and lymphocyte pleocytosis. Lymph node tuberculosis is generally unilateral and cervical. Tuberculous pleuritis is exudative or dry. Other forms of tuberculous serositis are pericarditis and peritonitis. Renal tuberculosis involves the medullaris and intestinal tuberculosis the ileocecum; tuberculous spondilitis (Pott's disease) involves the last dorsal vertebrae. Other forms are osteoarthritis, genital tract tuberculosis, pancreatitis, laryngitis, otitis.     

Rupture of Valsalva''s sinus of subacute development

In this study, the effects of forearm static exercise were determined on local blood flow and oxygen consumption in 15 normal individuals (NL) and their responses were compared with ten patients in congestive heart failure (CHF). Forearm blood flow was determined by a plethysmographic technique before and during 15% of maximum voluntary contraction of the forearm. Regional arterial and venous oxygen contents were sampled and forearm oxygen consumption calculated by the Fick principle. At rest, forearm blood flow was less in patients with heart failure than in normal individuals; however, this was compensated for by an increased oxygen extraction, thus maintaining forearm oxygen consumption at a normal level. In contrast, during static exercise, forearm blood flow failed to rise normally with heart failure (NL 9.31; CHF 4.35 ml/min-100 ml, P less than 0.001) and the increased oxygen extraction was not sufficient to maintain a normal forearm oxygen consumption (NL .82; CHF .44 ml/min-100 ml, P less than 0.01). Therefore, patients with congestive heart failure demonstrate regional circulatory and metabolic abnormalities during static exercise that are comparable to those present during dynamic exercise. Because of a limited ability of their skeletal muscle resistance vessels to respond to dilator stimuli, they have an attenuation of their exercise hyperemia which leads to an earlier shift to anaerobic metabolism.     

Self-assembling of atomic vacancies at an oxide/intermetallic alloy interface

Oxide layers grown on the surface provide an effective way of protecting metallic materials against corrosion for sustainable use in a broad range of applications. However, the growth of cavities at the metal/oxide interface weakens the adherence of the protective layer and can promote its spallation under service conditions, as observed for alumina layers formed by selective oxidation of aluminide intermetallic alloys used in high-temperature applications. Here we show that direct atomic-scale observations of the interface between an ultrathin protective oxide layer (alumina) grown on an intermetallic titanium aluminide substrate (TiAl) can be performed with techniques sensitive to the topmost atomic layers at the surface. Nanocavities resulting from the self-assembling of atomic vacancies injected at the interface by the growth mechanism of the protective oxide are observed for the first time, bringing new insight into the understanding of the fate of injected cavities in oxidation processes.     

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.     

FACTORS DESCRIPTIVE OF PSYCHOPATHOLOGY AND BEHAVIOR OF HOSPITALIZED PSYCHOTICS.

"A sample of 423 psychotic patients from five veterans hospitals was observed and rated on behavior in the interview and on the ward. The intercorrelations between 55 of the rating scales were subjected to a multiple group factor analysis. The 11 oblique first order factors were interpreted." (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Nonaqueous potentiometry of coal-derived asphaltenes and model nitrogen-containing compounds in acetophenone and nitrobenzene

A series of 34 nitrogen-containing compounds with a wide range of basicities was examined under differential nonaqueous potentiometric conditions in acetophenone and nitrobenzene. These compounds could be resolved into five classes based on pK_aand half-neutralization-potential (HNP) values. Asphaltenes isolated from the vacuum still overhead (VSO) and vacuum still bottoms (VSB) fractions of the H-coal process were titrated under similar conditions. The titration results of both asphaltenes indicated the presence of two classes of nitrogen-containing compounds, a titratable class of the pyridine-ring or aniline type and a nontitratable class.     

Cuprates and Ruthenates: Similarities and Differences

There is growing evidence that the p-wave superconductivity of Sr₂RuO₄ occurs primarily in the planar -band. Thus the minimum model for both cuprates and ruthenates is a single active band with onsite Coulomb interactions. Recent renormalization group analysis shows that such a model can show singlet d-wave or triplet p-wave pairing. The energy of the van Hove singularity in the band and the shape of the Fermi surface are the decisive factors at weak to moderate interaction strengths.