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 those of 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.
Unable to display preview. Download preview PDF.
- [CM91]Cooper, R., Marzullo, K.: Consistent detection of global predicates. In: Proc. of the Workshop on Parallel and Distributed Debugging, Santa Cruz, CA, pp. 163–173 (May 1991)Google Scholar
- [Fid89]Fidge, C.J.: Partial orders for parallel debugging. In: Proc. of the ACM SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, vol. 24(1), pp. 183–194 (January 1989)Google Scholar
- [Gan84]Ganter, B.: Two basic algorithms in concept analysis. Technical Report 831, Techniche Hochschule, Darmstadt (1984)Google Scholar
- [Gar03]Garg, V.K.: Enumerating global states of a distributed computation. In: Intl Conf. on Parallel and Distributed Computing and Systems, pp. 134–139 (November 2003)Google Scholar
- [Gar13]Garg, V.K.: Maximal antichain lattice algorithms for distributed computations. In: Proc. of Distributed Computing and Networking - 14th International Conference, ICDCN 2013 (January 2013)Google Scholar
- [GM01]Garg, V.K., Mittal, N.: On slicing a distributed computation. In: 21st Intnatl. Conf. on Distributed Computing Systems, ICDCS 2001, pp. 322–329. IEEE, Washington (2001)Google Scholar
- [GW97]Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, 1st edn. Springer-Verlag New York, Inc., Secaucus (1997)Google Scholar
- [HM84]Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. In: Kameda, T., Misra, J., Peters, J., Santoro, N. (eds.) PODC, pp. 50–61. ACM (1984)Google Scholar
- [Mat89]Mattern, F.: Virtual time and global states of distributed systems. In: Proc. of the Intl. Workshop on Parallel and Distributed Algorithms, pp. 215–226 (1989)Google Scholar
- [MG01]Mittal, N., Garg, V.K.: On detecting global predicates in distributed computations. In: 21st Intnatl. Conf. on Distributed Computing Systems, ICDCS 2001, pp. 3–10. IEEE, Washington (2001)Google Scholar