Lattice Completion Algorithms for Distributed Computations
نویسنده
چکیده
A distributed computation is usually modeled as a finite partially ordered set (poset) of events. Many operations on this poset require computing meets and joins of subsets of events. The lattice of normal cuts of a poset is the smallest lattice that embeds the poset such that all meets and joins are defined. In this paper, we propose new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed for distributed computing applications and have lower time or space complexity than existing algorithms. We also show applications of this lattice to the problems in distributed computing such as finding the extremal events and detecting global predicates.
منابع مشابه
v 2 1 2 M ay 2 00 6 Computing generating sets of lattice ideals 1
In this article, we present a new algorithm for computing generating sets and Gröbner bases of lattice ideals. In contrast to other existing methods, our algorithm starts computing in projected subspaces and then iteratively lifts the results back into higher dimensions, by using a completion procedure, until the original dimension is reached. We give a completely geometric presentation of our ...
متن کاملMaximal Antichain Lattice Algorithms for Distributed Computations
The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct an...
متن کاملMeet- and join-closure of CTL operators
Results from lattice theory have successfully been applied by several researchers, e.g. [1, 7, 9, 10], to reduce the complexity of verification of distributed computations. The set of all reachable states of a distributed computation forms a lattice under a certain partial order relation. A property is said to exhibit meet-closure if the set of reachable states satisfying it is closed under the...
متن کاملLinear Space Algorithm for On - line Detectionof Global
A fundamental problem in debugging and monitoring is detecting whether the state of a system satisses some predicate. Cooper and Marzullo deened this problem as Possibly() for distributed computations. This paper presents the rst on{line algorithm using linear space which resolve this problem in the general case, improving all existing algorithms both in time and space. It is particularly inter...
متن کاملMatrix Distributed Processing: A set of C++ Tools for implementing generic lattice computations on parallel systems
We present a set of programming tools (classes and functions written in C++ and based on Message Passing Interface) for fast development of generic parallel (and non-parallel) lattice simulations. They are collectively called MDP 1.2. These programming tools include classes and algorithms for matrices, random number generators, distributed lattices (with arbitrary topology), fields and parallel...
متن کامل