Detecting the existence of a consistent global state that satisfies a predicate in a
distributed environment is a processing intensive task since all the consistent global states
must be checked to verify that none of them satisfies the predicate. Three different serial
implementations have been provided for a breath-first, depth-first, and lexical traversal of
the lattice generated by enumerating the possible consistent global states has been
provided by Alagar and Venkatesan, Cooper and Marzullo, and Garg. This paper
modifies those implementations to perform the checks in a distributed environment,
providing the final algorithms, source code, and preliminary results for comparisons with
the original algorithms. / text
| Identifer | oai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/ETD-UT-2012-08-6023 |
| Date | 27 November 2012 |
| Creators | Wong, Don Tak-San |
| Source Sets | University of Texas |
| Language | English |
| Detected Language | English |
| Type | thesis |
| Format | application/pdf |
Page generated in 0.0024 seconds