Abstract
As part of a service oriented e-Science and Grid infrastructure, a quorum-consensus method is a valuable tool for managing replicated data and finding meaningful patterns of immense data sets. In general, a workflow is defined as set of atomic tasks that may have dependencies between each other. Tasks also may define a so-called “quorum” which denotes a number of precedence constraints to be fulfilled before execution may proceed. To solve the problem of designing a quorum that fits a scalable and dynamic environment where data are distributed sparsely or too far apart, we propose a cell approximation method to fit into some form (e.g., voting, grid) of logical structure in quorum-based protocols. In our method, adjacent nodes are configured by an Intra cell which can improve their data locality. Furthermore, Intra-cell relationships can be represented by an Inter cell for minimizing access time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bernstain, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. (TODS) 4(2), 180–209 (1979)
Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems, New York, pp. 150–162 (1979)
Kumar, A.: Hierarchical quorum consensus: a new algorithm for managing replicated data. IEEE Trans. Comput. 40(9), 996–1004 (1991)
Cheung, S.Y., Ammar, M.H., Ahamad, M.: The grid protocol: a high performance scheme for maintaining replicated data. IEEE Trans. Knowl. Data Eng. 4(6), 582–592 (1992)
Erdos, P., Lovasz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. Janos Bolyai 10, 609–627
Agrawal, D., El Abbadi, A.: The tree quorum protocol: an efficient approach for managing replicated data. In: Proceedings of the Sixteenth International Conference on Very Large Databases, 1990
Agrawal, D., El Abbadi, A.: An efficient and fault-tolerance solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9, 1–20 (1991)
Fu, A.W.: Delay-optimal quorum consensus for distributed systems. IEEE Trans. Parallel Distrib. Syst. 8(1), 59–69 (1997)
Gilbert, S., Malewicz, G.: The quorum deployment problem. In: 8th International Conference on Principles of Distributed Systems (OPODIS’04), 2004
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. In: Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’01), p. 346, August 15–18, 2001
Hartigan, J.A., Wong, M.A.: (1979). A k-means clustering algorithm. Appl. Stat. 28
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lee, YJ., Kim, HY. & Lee, CH. Cell approximation method in quorum systems for minimizing access time. Cluster Comput 12, 387–398 (2009). https://doi.org/10.1007/s10586-009-0097-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-009-0097-8