Abstract
Given a set V of active components in charge of a distributed execution, a storage scheme is a sequence of subsets, B 1,B 2,...,B b , of V where, succesive global states are recorded. The subsets, called blocks, have the same size and are scheduled according to some fixed and cyclic calendar of b steps. During i-th step, block B i is selected. Next, a global snapshot is taken and each component sends its corresponding local state to one of the appointed places in B i , in a way that each component stores (approx.) the same number of local states. Afterwards, if a component of B i crashes, all of the data stored in the block is useless, because the global state can not be reconstructed. In this case, the information recorded in an earlier block can be used to recover a global state, provided there is at least one such block where no component has crashed. The goal is to design storage schema that tolerate as many crashes as possible, while trying to have each component participating in as few blocks as possible and, at the same time, working with large blocks (so that a component in a block stores a small number of local states). In this paper several such schema are described and compared in terms of these measures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azagury, A., Factor, M.E., Satran, J.: Point-in-time copy: Yesterday, today and tomorrow. In: 19th IEEE Symposium on Mass Storage Systems, pp. 259–270. IEEE, Los Alamitos (2002)
Chandy, M., Lamport, L.: Distributed snapshots: Determining global states in distributed systems. ACM Trans. on Computer Science 3(1), 63–75 (1985)
Babaoglu, O., Marzullo, K.: Consistent global states of distributed systems: Fundamental concepts and mechanisms. In: Mullender, S. (ed.) Distributed Systems, 2nd edn. ch. 4, pp. 55–96. ACM, New York (1993)
Fraleigh, J.B.: Álgebra Abstracta. Addison-Wesley, Iberoamericana (1987)
Rhea, S., et al.: Maintenance-free global data storage. IEEE Internet Computing, pp. 40–49 (September/October 2001)
MacWilliams, F.J., Sloane, N.J.: The Theory of Error-correcting codes, 8th edn. North-Holland, Amsterdam (1993)
Tonchev, V.: Combinatorial Configurations Designs, Codes, Graphs. Longman Scientific and Technical (1988)
Stinson, D.R.: An introduction to combinatorial designs. Technical report, University of Waterloo, Dept. of Combinatorics and Optimization (December 1999)
Colbourn, C.J., Dinitz, J.H., Stinson, D.R.: Applications of combinatorial designs to communications, cryptography, and networking. Technical report, University of Vermont (2000)
Kotz, D.: Introduction to multiprocessor i/o architecture. In: Jain, R., Werth, J., Browne, J.C. (eds.) Input/Output in Parallel and Distributed Computer Systems. Kluwer Academic Publishers, Dordrecht (1996)
Mourad, A.N., Fuchs, K.W., Saab, D.G.: Site partitioning for redundant arrays of distributed disks. Journal of Parallel and Distributed Computing (33), 1–11 (1996)
Berenbrink, P., Brinkmann, A., Scheideler, C.: Design of the presto multimedia storage network. In: International Workshop on Communication and Data Management in Large Networks, pp. 2–12 (1999)
Russell, A., Shvartsman, A.A.: Distributed computation meets design theory: Local schedulling for disconnected operations. In: Bulletin of the EATCS, June 2002, pp. 120–131 (2002)
Bhagwan, R., Moore, D., Savage, S., Voelker, G.: Replication strategies for highly available peer-to-peer storage. In: International Workshop on Future Directions in Distributed Computing (2002)
Rabin, M.O.: Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the ACM 36(2), 335–348 (1989)
Peleg, D., Wool, A.: The availability of quorum systems. Information and Computation 123(2), 210–223 (1995)
Garg, V.K., Ghosh, J.: Repeated computation of global functions in a distributed environment. IEEE Trans. on Parallel and Distributed Systems 5(8), 823–834 (1994)
Lynch, N.: Distributed Algorithms. Morgan Kaufman Pub., San Francisco (1996)
Deswarte, Y.: Tolérance aux fautes, sécurité et protection. In: Balter, R., et al. (eds.) Construction des Systèmes d’exploitation Répartis. INRIA, Paris, France (1991)
Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms. CRC Press, Boca Raton (1998)
Batten, L.M.: Combinatorics of finite geometries. Cambridge University Press, Cambridge (1997)
Dembowski, P.: Finite Geometries. Springer, Heidelberg (1968)
Cederberg, J.N.: A Course in Modern Geometries. Springer, Heidelberg (1989)
Bruen, A.A., Silverman, R.: Acs and blocking sets ii. European Journal of Combinatorics 8(4), 351–356 (1987)
Brouwer, A.E., Schrijver, A.: The blocking number of an affine space. Journal of Combinatorial Theory ser. A 24(2), 251–253 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marcelín-Jiménez, R., Rajsbaum, S. (2003). Cyclic Strategies for Balanced and Fault-Tolerant Distributed Storage. In: de Lemos, R., Weber, T.S., Camargo, J.B. (eds) Dependable Computing. LADC 2003. Lecture Notes in Computer Science, vol 2847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45214-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45214-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20224-0
Online ISBN: 978-3-540-45214-0
eBook Packages: Springer Book Archive