Distributed Shared Memory (DSM) systems typically support one consistency model [3, 5, 6]. However, recent work [1, 11, 12, 14, 16] proposes the use of adaptive consistency based on a heuristical analysis of recent access patterns. Although heuristic-based approaches can significantly improve runtime, the access pattern alone does not necessarily define the most appropriate consistency model. T...

We are dealing with solving planning problems by the GraphPlan algorithm. We concentrate on solving a problem of finding supporting actions for a goal. This problem arises as a sub-problem many times during search for a solution. We showed in the paper that the supports problem is NP-complete. In order to improve the solving process of the supports problems we proposed a new global consistency ...

One of the major challenges in distributed systems is establishing consistency among replicated data in a timely fashion. While the consistent ordering of events has been extensively researched, the time span to reach a consistent state is mostly considered an effect of the chosen consistency model, rather than being considered a parameter itself. This paper argues that it is possible to give g...

It is generally assumed that during reading, the activation produced over orthographic units feeds forward to phonological units. Supporting interactive models of word recognition, Stone, Vanhoy, and Van Orden (1997) recently claimed that phonological activation reverberates to orthographic processing units and consequently constrains orthographic encoding. They found that the consistency of th...

In this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank diierence for elements in the two input sequences. Here we give an almost matching lower bound for odd-even merge a...

We use term regular directed graph (r. d. g.) for the graph of irreflexive binary relation with the constant number outputs (or inputs) for each vertex. The paper is devoted to studies of maximal size ER(d, v) of r. d. g. of order v without commutative diagrams formed by two directed passes of length < d with the common starting and ending points. We introduce the upper bound for ER(d, v), whic...

There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often re...