An implementation and analysis of a randomized distributed stack
MetadataShow full item record
This thesis presents an algorithm for a randomized distributed stack, a coded simulator for examining its behavior, and an analysis of data collected from simulations configured to investigate its performance in particular situations. This randomized distributed stack represents an experimental extension of the probabilistic quorum algorithm of Malki et al. [5,4] and the random regular register of Welch and Lee . Employing the probabilistic quorum algorithm in the same manner as the random regular register, the randomized distributed stack stands to positively affect the load and availability of a system. Popping this randomized distributed stack, however, sometimes returns incorrect values. Analysis of the data assembled reveals two interesting conclusions: 1) as the number of uninterrupted pops increases, the variance of the pop success percentage increases, and 2) for a fixed quorum size percentage, a larger system of data servers yields a higher pop success percentage. Further research remains to fully characterize and generalize the behavior of the randomized distributed stack.
DescriptionDue to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to email@example.com, referencing the URI of the item.
Includes bibliographical references (leaf 25).
Kirkland, Dustin Charles (2001). An implementation and analysis of a randomized distributed stack. Texas A&M University. Available electronically from