Lattice Completion Algorithms for Distributed Computations

Abstract

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.

DOI: 10.1007/978-3-642-35476-2_12
View Slides

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Garg2012LatticeCA, title={Lattice Completion Algorithms for Distributed Computations}, author={Vijay K. Garg}, booktitle={OPODIS}, year={2012} }