Bounded Concurrent Timestamp Systems Using Vector Clocks

Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication object, and has been shown to be a powerful tool to solve many concurrency control problems. It has turned out to be possible to construct such higher typed objects from primitive lower typed ones. The next step is to find efficient constructions. We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer multireader registers. This finalizes, corrects, and extends, a preliminary bounded multiwriter construction proposed by the second author in 1986. That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.Comment: LaTeX source, 35 pages; To apper in: J. Assoc. Comp. Mac

Optimal path planning for surveillance with temporal-logic constraints

In this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by an arbitrary linear temporal-logic (LTL) formula over propositions satisfied at the regions of a partitioned environment. The mission specification contains an optimizing proposition, which must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot path that minimizes the cost function. The problem is motivated by applications in robotic monitoring and data-gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the LTL formula specifies a complex data-collection mission. Our method utilizes Büchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal-logic specification. We then present a graph algorithm that computes a run corresponding to the optimal robot path. We present an implementation for a robot performing data collection in a road-network platform.This material is based upon work supported in part by ONR-MURI (award N00014-09-1-1051), ARO (award W911NF-09-1-0088), and Masaryk University (grant numbers LH11065 and GD102/09/H042), and other funding sources (AFOSR YIP FA9550-09-1-0209, NSF CNS-1035588, NSF CNS-0834260). (N00014-09-1-1051 - ONR-MURI; W911NF-09-1-0088 - ARO; LH11065 - Masaryk University; GD102/09/H042 - Masaryk University; FA9550-09-1-0209 - AFOSR YIP; CNS-1035588 - NSF; CNS-0834260 - NSF

A differential refresh scheme for remote end-user\u27s views

The growth of end-user computing and recent developments in information technology, such as client/server architecture and data warehouse, promote the use of remote materialized views (RMVs) to support end-users. This article presents a differential scheme to refresh remote end-user\u27s views. The scheme stores the effects of updates relevant to the RMV in a difference table which is transmitted to the remote site upon receiving the refresh request to update the RMV. The scheme provides a fast response to a user\u27s refresh request. We discuss the data structures and algorithms of the scheme. Performance measures are developed and compared with the regeneration scheme

Anonymous and fault-tolerant shared-memory computing

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reasons of privacy? We consider asynchronous shared-memory systems that are anonymous. The shared memory contains only the most common type of shared objects, read/write registers. We investigate, for the first time, what can be implemented deterministically in this model when processes can fail. We give anonymous algorithms for some fundamental problems: time-stamping, snapshots and consensus. Our solutions to the first two are wait-free and the third is obstruction-free. We also show that a shared object has an obstruction-free implementation if and only if it satisfies a simple property called idempotence. To prove the sufficiency of this condition, we give a universal construction that implements any idempotent objec

Stars and gas in the very large interacting galaxy NGC 6872

The dynamical evolution of the large (> 100 kpc), barred spiral galaxy NGC 6872 and its small companion IC 4970 in the southern group Pavo is investigated. We present N-body simulations with stars and gas and 21 cm HI observations carried out with the Australia Telescope Compact Array of the large-scale distribution and kinematics of atomic gas. HI is detected toward the companion, corresponding to a gas mass of ca 1.3 10^9 Msun. NGC 6872 contains ca 1.4 10^{10} Msun of HI gas, distributed in an extended rotating disk. Massive concentrations of gas (10^9 Msun) are found at the tip of both tidal tails and towards the break seen in the optical northern arm near the companion. We detect no HI counterpart to the X-ray trail between NGC 6872 and NGC 6876, the dominant elliptical galaxy in the Pavo group located 8 arcmin to the southeast. At the sensitivity and the resolution of the observations, there is no sign in the overall HI distribution that NGC 6876 has affected the evolution of NGC 6872. There is no evidence of ram pressure stripping either. The X-ray trail could be due to gravitational focusing of the hot gas in the Pavo group behind NGC 6872 as the galaxy moves supersonically through the hot medium. The simulations of a gravitational interaction with a small nearby companion on a low-inclination prograde passage are able to reproduce most of the observed features of NGC 6872, including the general morphology of the galaxy, the inner bar, the extent of the tidal tails and the thinness of the southern tail.Comment: 12 pages, 11 figures. Accepted for publication in Astronomy & Astrophysics. The resolution of the figures has been greatly reduced. The paper with the original figures can found at http://www.oso.chalmers.se/~horellou/PAPERS/2006n6872.pd