Distributed global predicate detection algorithms

dc.contributor.advisorGarg, Vijay K. (Vijay Kumar), 1963-en
dc.contributor.committeeMemberGraser, Thomasen
dc.creatorWong, Don Tak-Sanen
dc.date.accessioned2012-11-27T18:24:00Zen
dc.date.accessioned2017-05-11T22:30:06Z
dc.date.available2012-11-27T18:24:00Zen
dc.date.available2017-05-11T22:30:06Z
dc.date.issued2012-08en
dc.date.submittedAugust 2012en
dc.date.updated2012-11-27T18:24:05Zen
dc.descriptiontexten
dc.description.abstractDetecting 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.en
dc.description.departmentElectrical and Computer Engineeringen
dc.format.mimetypeapplication/pdfen
dc.identifier.slug2152/ETD-UT-2012-08-6023en
dc.identifier.urihttp://hdl.handle.net/2152/ETD-UT-2012-08-6023en
dc.language.isoengen
dc.subjectDistributed computingen
dc.subjectConsistent global stateen
dc.titleDistributed global predicate detection algorithmsen
dc.type.genrethesisen

Files