Complete and efficient methods for supporting side effects in independent/restricted and-parallelism

It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of such programs. In particular, it is possible to parallelize pure Prolog programs while maintaining the semantics of the language. However, when builtin side-effects (such as write or assert) appear in the program, if an identical observable behaviour to that of sequential Prolog implementations is to be preserved, such side-effects have to be properly sequenced. Previously proposed solutions to this problem are either incomplete (lacking, for example, backtracking semantics) or they force sequentialization of significant portions of the execution graph which could otherwise run in parallel. In this paper a series of side-effect synchronization methods are proposed which incur lower overhead and allow more parallelism than those previously proposed. Most importantly, and unlike previous proposals, they have well-defined backward execution behaviour and require only a small modification to a given (And-parallel) Prolog implementation

A Microscopic Model of Non-Reciprocal Optical Effects in Cr_2 O_3

This manuscript deals with the question "How does light couple to an antiferromagnetic order parameter"? For that we develop a microscopic model that explains the non-reciprocal optical effects in centrosymmetric Cr_2 O_3. It is shown that light can couple {\em directly} to the antiferromagnetic order parameter. This coupling is mediated by the spin-orbit interaction and involves an interplay between the breaking of inversion symmetry due to the antiferromagnetic order parameter and the trigonal field contribution to the ligand field at the Cr^{3+} ion.Comment: Accepted for publication in Phys. Rev. Let

The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

There has been significant interest in parallel execution models for logic programs which exploit Independent And-Parallelism (IAP). In these models, it is necessary to determine which goals are independent and therefore eligible for parallel execution and which goals have to wait for which others during execution. Although this can be done at run-time, it can imply a very heavy overhead. In this paper, we present three algorithms for automatic compiletime parallelization of logic programs using IAP. This is done by converting a clause into a graph-based computational form and then transforming this graph into linear expressions based on &-Prolog, a language for IAP. We also present an algorithm which, given a clause, determines if there is any loss of parallelism due to linearization, for the case in which only unconditional parallelism is desired. Finally, the performance of these annotation algorithms is discussed for some benchmark programs

Determination of variable dependence information through abstract interpretation

Traditional schemes for abstract interpretation-based global analysis of logic programs generally focus on obtaining procedure argument mode and type information. Variable sharing information is often given only the attention needed to preserve the correctness of the analysis. However, such sharing information can be very useful. In particular, it can be used for predicting run-time goal independence, which can eliminate costly run-time checks in and-parallel execution. In this paper, a new algorithm for doing abstract interpretation in logic programs is described which infers the dependencies of the terms bound to program variables with increased precisión and at all points in the execution of the program, rather than just at a procedure level. Algorithms are presented for computing abstract entry and success substitutions which extensively keep track of variable aliasing and term dependence information. The algorithms are illustrated with examples

Simulation of structural and electronic properties of amorphous tungsten oxycarbides

Electron beam induced deposition with tungsten hexacarbonyl W(CO)6 as precursors leads to granular deposits with varying compositions of tungsten, carbon and oxygen. Depending on the deposition conditions, the deposits are insulating or metallic. We employ an evolutionary algorithm to predict the crystal structures starting from a series of chemical compositions that were determined experimentally. We show that this method leads to better structures than structural relaxation based on guessed initial structures. We approximate the expected amorphous structures by reasonably large unit cells that can accommodate local structural environments that resemble the true amorphous structure. Our predicted structures show an insulator to metal transition close to the experimental composition at which this transition is actually observed. Our predicted structures also allow comparison to experimental electron diffraction patterns.Comment: 17 Pages, 11 figure

Spontaneous breaking of the Fermi surface symmetry in the t-J model: a numerical study

We present a variational Monte Carlo (VMC) study of spontaneous Fermi surface symmetry breaking in the t-J model. We find that the variational energy of a Gutzwiller projected Fermi sea is lowered by allowing for a finite asymmetry between the x- and the y-directions. However, the best variational state remains a pure superconducting state with d-wave symmetry, as long as the underlying lattice is isotropic. Our VMC results are in good overall agreement with slave boson mean field theory (SBMFT) and renormalized mean field theory (RMFT), although apparent discrepancies do show up in the half-filled limit, revealing some limitations of mean field theories. VMC and complementary RMFT calculations also confirm the SBMFT predictions that many-body interactions can enhance any anisotropy in the underlying crystal lattice. Thus, our results may be of consequence for the description of strongly correlated superconductors with an anisotropic lattice structure.Comment: 6 pages, 7 figures; final versio

Combined determination of sharing and freeness of program variables through abstract interpretation

In this paper, abstract interpretation algorithms are described for computing the sharmg as well as the freeness information about the run-time instantiations of program variables. An abstract domain is proposed which accurately and concisely represents combined freeness and sharing information for program variables. Abstract unification and all other domain-specific functions for an abstract interpreter working on this domain are presented. These functions are illustrated with an example. The importance of inferring freeness is stressed by showing (1) the central role it plays in non-strict goal independence, and (2) the improved accuracy it brings to the analysis of sharing information when both are computed together. Conversely, it is shown that keeping accurate track of sharing allows more precise inference of freeness, thus resulting in an overall much more powerful abstract interpreter