
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ricardo Marcel?nJim?nez, Sergio Rajsbaum, Brett Stevens, "Cyclic Storage for FaultTolerant Distributed Executions," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 9, pp. 10281036, September, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.120, author = {Ricardo Marcel?nJim?nez and Sergio Rajsbaum and Brett Stevens}, title = {Cyclic Storage for FaultTolerant Distributed Executions}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {9}, issn = {10459219}, year = {2006}, pages = {10281036}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.120}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Cyclic Storage for FaultTolerant Distributed Executions IS  9 SN  10459219 SP1028 EP1036 EPD  10281036 A1  Ricardo Marcel?nJim?nez, A1  Sergio Rajsbaum, A1  Brett Stevens, PY  2006 KW  Load balancing and task assignment KW  distributed applications KW  checkpoint/restart KW  faulttolerance KW  storage/repositories KW  distributed systems KW  network repositories/data mining/backup. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given a set
[1] A. Azagury, M.E. Factor, and J. Satran, “PointinTime Copy: Yesterday, Today and Tomorrow,” Proc. 19th IEEE Symp. Mass Storage Systems, pp. 259270, 2002.
[2] O. Babaoglu and K. Marzullo, “Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms,” Distributed Systems, pp. 5596, 1993.
[3] L.M. Batten, Combinatorics of Finite Geometries. Cambridge Univ. Press, 1997.
[4] P. Berenbrink, A. Brinkmann, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network,” Proc. Int'l Workshop Comm. and Data Management in Large Networks, pp. 212, 1999.
[5] R. Bhagwan, D. Moore, S. Savage, and G. Voelker, “Replication Strategies for Highly Available PeertoPeer Storage,” Proc. Int'l Workshop Future Directions in Distributed Computing, 2002.
[6] A.E. Brouwer and A. Schrijver, “The Blocking Number of an Affine Space,” J. Combinatorial Theory Series A, vol. 24, no. 2, pp. 251253, 1978.
[7] A.A. Bruen and R. Silverman, “Arcs and Blocking Sets II,” European J. Combinatorics, vol. 8, no. 4, pp. 351356, 1987.
[8] J.N. Cederberg, A Course in Modern Geometries. SpringerVerlag, 1989.
[9] M. Chandy and L. Lamport, “Distributed Snapshots: Determining Global States in Distributed Systems,” ACM Trans. Computer Science, vol. 3, no. 1, pp. 6375, 1985.
[10] T. Chiueh and P. Deng, “Evaluation of Checkpoint Mechanisms for Massively Parallel Machines,” Proc. 26th Ann. Int'l Symp. FaultTolerant Computing (FTCS '96), pp. 370381, 1996.
[11] M.B. Cohen and C.J. Colbourn, “Steiner Triple Systems as Multiple Erasure Correcting Codes in Disk Arrays,” Proc. 19th IEEE Int'l Conf. Performance, Computing, and Comm., pp. 288294, 2000.
[12] M.B. Cohen and C.J. Colbourn, “Ordering Disks for Double Erasure Codes,” Proc. Symp. Parallel Algorithms and Architectures (SPAA '01), pp. 229236, 2001.
[13] M.B. Cohen and C.J. Colbourn, “Optimal and Pessimal Orderings,” Discrete Applied Math., 2002.
[14] M.B. Cohen and C.J. Colbourn, “Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays,” Theoretical Computer Science, vol. 297, pp. 103117, 2003.
[15] C.J. Colbourn et al., “Applications of Combinatorial Designs to Communications, Cryptography, and Networking,” technical report, Univ. of Vermont, 2000.
[16] P. Dembowski, Finite Geometries. SpringerVerlag, 1968.
[17] Y. Deswarte, “Tolérance aux Fautes, Sécurité et Protection,” Construction des Systèmes d'Exploitation Répartis, INRIA, 1991.
[18] E.N. Elnozahy, D. Johnson, and W. Zwanaepoel, “The Performance of Consistent Checkpoints,” Proc. 11th IEEE Symp. Reliable Distributed Systems, pp. 8695, 1992.
[19] J.B. Fraleigh, Álgebra Abstracta. AddisonWesley Iberoamericana, 1987.
[20] V.K. Garg and J. Ghosh, “Repeated Computation of Global Functions in a Distributed Environment,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 823834, 1994.
[21] R. Koo and S. Toueg, “Checkpointing and RollBack Recovery for Distributed Systems,” IEEE Trans. Software Eng., vol. 13, no. 1, pp. 2331, 1987.
[22] D. Kotz, “Introduction to Multiprocessor I/O Architecture,” Input/Output in Parallel and Distributed Computer Systems, Kluwer Academic, 1996.
[23] D.L. Kreher and D.R. Stinson, Combinatorial Algorithms. CRC Press. 1998.
[24] K. Li, J.F. Naughton, and J.S. Plank, “Real Time, Concurrent Checkpoint for Parallel Programs,” Proc. Second ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 7988, 1990.
[25] M.J. Litzkow, M. Livny, and M.W. Mutka, “Condor— A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems, pp. 104111, 1988.
[26] N. Lynch, Distributed Algorithms. Morgan Kaufman, 1996.
[27] F.J. MacWilliams and N.J. Sloane, The Theory of ErrorCorrecting Codes. NorthHolland, 1993.
[28] R. MarcelínJiménez, “Performance Measures for Distributed Storage,” Proc. Design, Analysis, and Simulation of Distributed Systems (DASD), pp. 5362, 2005.
[29] A.N. Mourad, K.W. Fuchs, and D.G. Saab, “Site Partitioning for Redundant Arrays of Distributed Disks,” J. Parallel and Distributed Computing, vol. 33, pp. 111, 1996.
[30] D. Peleg and A. Wool, “The Availability of Quorum Systems,” Information and Computation, vol. 123, no. 2, pp. 210223, 1995.
[31] M.O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” J. ACM, vol. 36, no. 2, pp. 335348, 1989.
[32] S. Rhea et al., “MaintenanceFree Global Data Storage,” IEEE Internet Computing, pp. 4049, Sept. 2001.
[33] A. Russell and A.A. Shvartsman, “Distributed Computation Meets Design Theory: Local Schedulling for Disconnected Operations,” Bull. EATCS, pp. 120131, June 2002.
[34] D.R. Stinson, “An Introduction to Combinatorial Designs,” technical report, Princeton Univ., 1999.
[35] V. Tonchev, Combinatorial Configurations Designs, Codes, Graphs. Longman Scientific and Technical, 1988.
[36] Z. Yang and T.A. Marsland, “Global Snapshots for Distributed Debugging: An Overview,” technical report, Univ. of Alberta, 1992.