1,270 research outputs found

    Constructs and evaluation strategies for intelligent speculative parallelism - armageddon revisited

    Get PDF
    This report addresses speculative parallelism (the assignment of spare processing resources to tasks which are not known to be strictly required for the successful completion of a computation) at the user and application level. At this level, the execution of a program is seen as a (dynamic) tree —a graph, in general. A solution for a problem is a traversal of this graph from the initial state to a node known to be the answer. Speculative parallelism then represents the assignment of resources to múltiple branches of this graph even if they are not positively known to be on the path to a solution. In highly non-deterministic programs the branching factor can be very high and a naive assignment will very soon use up all the resources. This report presents work assignment strategies other than the usual depth-first and breadth-first. Instead, best-first strategies are used. Since their definition is application-dependent, the application language contains primitives that allow the user (or application programmer) to a) indícate when intelligent OR-parallelism should be used; b) provide the functions that define "best," and c) indícate when to use them. An abstract architecture enables those primitives to perform the search in a "speculative" way, using several processors, synchronizing them, killing the siblings of the path leading to the answer, etc. The user is freed from worrying about these interactions. Several search strategies are proposed and their implementation issues are addressed. "Armageddon," a global pruning method, is introduced, together with both a software and a hardware implementation for it. The concepts exposed are applicable to áreas of Artificial Intelligence such as extensive expert systems, planning, game playing, and in general to large search problems. The proposed strategies, although showing promise, have not been evaluated by simulation or experimentation

    Higher-order finite element methods for elliptic problems with interfaces

    Get PDF
    We present higher-order piecewise continuous finite element methods for solving a class of interface problems in two dimensions. The method is based on correction terms added to the right-hand side in the standard variational formulation of the problem. We prove optimal error estimates of the methods on general quasi-uniform and shape regular meshes in maximum norms. In addition, we apply the method to a Stokes interface problem, adding correction terms for the velocity and the pressure, obtaining optimal convergence results.Comment: 26 pages, 6 figures. An earlier version of this paper appeared on November 13, 2014 in http://www.brown.edu/research/projects/scientific-computing/reports/201

    Offshore support vessels market: sales & purchase, and chartering strategies for PSV and AHTS : an evaluation of the influential factors

    Get PDF

    A Program Transformation for Continuation Call-Based Tabled Execution

    Full text link
    The advantages of tabled evaluation regarding program termination and reduction of complexity are well known --as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspension) require. This implementation effort is reduced by program transformation-based continuation call techniques, at some efficiency cost. However, the traditional formulation of this proposal by Ramesh and Cheng limits the interleaving of tabled and non-tabled predicates and thus cannot be used as-is for arbitrary programs. In this paper we present a complete translation for the continuation call technique which, using the runtime support needed for the traditional proposal, solves these problems and makes it possible to execute arbitrary tabled programs. We present performance results which show that CCall offers a useful tradeoff that can be competitive with state-of-the-art implementations.Comment: Part of the proceedings of CICLOPS 200

    Influence of chemical reaction kinetics on electrokinetic remediation modelling results

    Get PDF
    A numerical model describing transport of multiple species and chemical reactions during electrokinetic treatment is presented. The transport mechanisms included in the model were electromigration and electroosmosis. The chemical reactions taken into account were water electrolysis at the electrodes, aqueous species complexation, precipitation, and dissolution. The model was applied to simulate experimental data from an acid-enhanced electrokinetic treatment of a Pb-contaminated calcareous soil. The kinetics of the main pH buffering process (i.e., calcite dissolution) was taken into account and its time-dependent behavior was described by a rate law. The influence of kinetics was evaluated by comparing the results from a set of simulations in which calcite dissolution was implemented considering thermodynamic equilibrium and another set in which the same reaction was described by the rate law. The results show that the prediction capability of the model significantly improves when the kinetic rate is taken into account.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
    • …