08332 Executive Summary -- Distributed Verification and Grid Computing

The Dagstuhl Seminar on Distributed Verification and Grid Computing took place from 10.08.2008 to 14.08.2008 and brought together two groups of researchers to discuss their recent work and recent trends related to parallel verification of large scale computer systems on large scale grids. In total, 29 experts from 12 countries attended the seminar

08332 Abstracts Collection -- Distributed Verification and Grid Computing

From 08/10/2008 to 08/14/2008 the Dagstuhl Seminar 08332 ``Distributed Verification and Grid Computing\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Dynamic Effects Increasing Network Vulnerability to Cascading Failures

We study cascading failures in networks using a dynamical flow model based on simple conservation and distribution laws to investigate the impact of transient dynamics caused by the rebalancing of loads after an initial network failure (triggering event). It is found that considering the flow dynamics may imply reduced network robustness compared to previous static overload failure models. This is due to the transient oscillations or overshooting in the loads, when the flow dynamics adjusts to the new (remaining) network structure. We obtain {\em upper} and {\em lower} limits to network robustness, and it is shown that {\it two} time scales $\tau$ and $\tau_0$, defined by the network dynamics, are important to consider prior to accurately addressing network robustness or vulnerability. The robustness of networks showing cascading failures is generally determined by a complex interplay between the network topology and flow dynamics, where the ratio $\chi=\tau/\tau_0$ determines the relative role of the two of them.Comment: 4 pages Latex, 4 figure

Cubic Twistorial String Field Theory

Witten has recently proposed a string theory in twistor space whose D-instanton contributions are conjectured to compute N=4 super-Yang-Mills scattering amplitudes. An alternative string theory in twistor space was then proposed whose open string tree amplitudes reproduce the D-instanton computations of maximal degree in Witten's model. In this paper, a cubic open string field theory action is constructed for this alternative string in twistor space, and is shown to be invariant under parity transformations which exchange MHV and googly amplitudes. Since the string field theory action is gauge-invariant and reproduces the correct cubic super-Yang-Mills interactions, it provides strong support for the conjecture that the string theory correctly computes N-point super-Yang-Mills tree amplitudes.Comment: 19+1 pages, 4+1 EPS figures, JHEP3 LaTeX; v2: minor corrections, references added; v3: the final version published in JHEP with a new footnote on the d=0 on-shell contributio

Sulfur disproportionating microbial communities in a dynamic, microoxic‐sulfidic karst system

Biogeochemical sulfur cycling in sulfidic karst systems is largely driven by abiotic and biological sulfide oxidation, but the fate of elemental sulfur (S0) that accumulates in these systems is not well understood. The Frasassi Cave system (Italy) is intersected by a sulfidic aquifer that mixes with small quantities of oxygen-rich meteoric water, creating Proterozoic-like conditions and supporting a prolific ecosystem driven by sulfur-based chemolithoautotrophy. To better understand the cycling of S0 in this environment, we examined the geochemistry and microbiology of sediments underlying widespread sulfide-oxidizing mats dominated by Beggiatoa. Sediment populations were dominated by uncultivated relatives of sulfur cycling chemolithoautotrophs related to Sulfurovum, Halothiobacillus, Thiofaba, Thiovirga, Thiobacillus, and Desulfocapsa, as well as diverse uncultivated anaerobic heterotrophs affiliated with Bacteroidota, Anaerolineaceae, Lentimicrobiaceae, and Prolixibacteraceae. Desulfocapsa and Sulfurovum populations accounted for 12%–26% of sediment 16S rRNA amplicon sequences and were closely related to isolates which carry out autotrophic S0 disproportionation in pure culture. Gibbs energy (∆Gr) calculations revealed that S0 disproportionation under in situ conditions is energy yielding. Microsensor profiles through the mat-sediment interface showed that Beggiatoa mats consume dissolved sulfide and oxygen, but a net increase in acidity was only observed in the sediments below. Together, these findings suggest that disproportionation is an important sink for S0 generated by microbial sulfide oxidation in this oxygen-limited system and may contribute to the weathering of carbonate rocks and sediments in sulfur-rich environments

Approximate and exact nodes of fermionic wavefunctions: coordinate transformations and topologies

A study of fermion nodes for spin-polarized states of a few-electron ions and molecules with $s,p,d$ one-particle orbitals is presented. We find exact nodes for some cases of two electron atomic and molecular states and also the first exact node for the three-electron atomic system in $^4S(p^3)$ state using appropriate coordinate maps and wavefunction symmetries. We analyze the cases of nodes for larger number of electrons in the Hartree-Fock approximation and for some cases we find transformations for projecting the high-dimensional node manifolds into 3D space. The node topologies and other properties are studied using these projections. We also propose a general coordinate transformation as an extension of Feynman-Cohen backflow coordinates to both simplify the nodal description and as a new variational freedom for quantum Monte Carlo trial wavefunctions.Comment: 7 pages, 7 figure

DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking

In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-accelerated version of the algorithm and we discuss where the limits of the tool are and what we intend to do in the future to avoid them

Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs

Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multi-core computing in the context of deadlock resolution

Tarmo: A Framework for Parallelized Bounded Model Checking

This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo. Our framework can be used with any incremental SAT encoding for BMC but for the results in this paper we use only the current state-of-the-art encoding for full PLTL. Using this encoding allows us to check both safety and liveness properties, contrary to an earlier work on distributing BMC that is limited to safety properties only. Despite our focus on BMC after it has been translated to SAT, existing distributed SAT solvers are not well suited for our application. This is because solving a BMC problem is not solving a set of independent SAT instances but rather involves solving multiple related SAT instances, encoded incrementally, where the satisfiability of each instance corresponds to the existence of a counterexample of a specific length. Our framework includes a generic architecture for a shared clause database that allows easy clause sharing between SAT solver threads solving various such instances. We present extensive experimental results obtained with multiple variants of our Tarmo implementation. Our shared memory variants have a significantly better performance than conventional single threaded approaches, which is a result that many users can benefit from as multi-core and multi-processor technology is widely available. Furthermore we demonstrate that our framework can be deployed in a typical cluster of workstations, where several multi-core machines are connected by a network