How to achieve high throughput with dynamic tree-structured coterie

Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

Volumn , Issue , 2006, Pages 82-89

  Frain, Ivan ^a   M'zoughi, Abdelaziz ^a   Bahsoun, Jean Paul ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; GRID COMPUTING; TREES (MATHEMATICS);

DATA CONSISTENCY PROTOCOLS; ELEMENTARY PERMUTATION PROTOCOL; QUORUM PROTOCOL; TREE RECONFIGURATION;

THROUGHPUT;

EID: 34547498852     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2006.29     Document Type: Conference Paper

References (21)

1. A. E. Abbadi, D. Skeen, and F. Cristian. An efficient, faulttolerant protocol for replicated data management. In Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, pages 215-229. ACM Press, 1985.
2. D. Agrawal and A. E. Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1-20, February 1991.
3. D. Agrawal and A. E. Abbadi. Using reconfiguration for efficient management of replicated data. IEEE Transactions on Knowledge and Data Engineering, 8(5):786-801, October 1996.
4. L. Alvisi, E. T. Pierce, D. Malkhi, M. K. Reiter, and R. N. Wright. Dynamic byzantine quorum systems. In DSN'00: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8), page 283, Washington, DC, USA, 2000. IEEE Computer Society.
5. P. Barford and M. Crovella. Critical path analysis of TCP transactions. In ACM SIGCOMM Internet Measurement Workshop, June 2001.
6. G. Cao and M. Singhal. A delay-optimal quorum-based mutual exclusion algorithm for distributed systems. IEEE Trans. Parallel Distrib. Syst., 12(12):1256-1268, 2001.
7. P. Carmi, S. Dolev, S. Har-Peled, M. J. Katz, and M. Segal. Geographic quorum systems approximations. In to appear in algorithmica, December 2003.
8. S. Cheung, M. Ammar, and A. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. IEEE Transactions on Knowledge and Data Engineering, 4(6):582-592, December 1992.
9. I. Foster, C. Kesselman, and S. Tueke. The anatomy of the grid - enabling scalable virtual organizations. Intl J. Supercomputer Applications, 2001.
10. A. W. Fu. Delay-optimal quorum consensus for distributed systems. IEEE Transactions on Parallel and Distributed Systems, 8(1):59-69, January 1997.
11. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32(4):841-860, October 1985.
12. D. K. Gifford. Weighted voting for replicated data. In Proceedings of the seventh ACM symposium on Operating systems principles, pages 150-162. ACM Press, 1979.
13. A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Transactions on Computers, 40(9):996-1004, September 1991.
14. N. A. Lynch and A. A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In FTCS '97: Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97). IEEE Computer Society, 1997.
15. D. Peleg and A. Wool. Crumbling walls: a class of practical and efficient quorum systems. Distributed Computing, 10(2):87-97, 1997.
16. M. Rabinovich and E. D. Lazowska. The dynamic tree protocol: avoiding "graceful degradation" in the tree protocol for distributed mutual exclusion. In Conference Proceedings., Eleventh Annual International Phoenix Conference on Computers and Communications, pages 101-107, Scottsdale, AZ, USA, April 1992.
17. M. Rabinovich and E. D. Lazowska. Improving fault tolerance and supporting partial writes in structured coterie protocols for replicated objects. In Proceedings of the 1992 ACM SIGMOD international conference on Management of data, pages 226-235. ACM Press, 1992.
18. F. Thiébolt, I. Frain, and A. M'Zoughi. Virtualisation du stockage dans les grilles informatiques. In 16ème Rencontres Francophones du Parallélisme, (Renpar'05), Croisic, France, pages 219-224. ASF/ACM/Sigops, 6-8 avril 2005.
19. R. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2): 180-209, June 1979.
20. T. Tsuchiya, M. Yamaguchi, and T. Kikuno. Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes. IEEE Transactions on parallel and distributed systems, 10(4):337-345, April 1999.
21. P. Urban, X. Défago, and A. Schiper. Neko: A single environment to simulate and prototype distributed algorithms. In 15th Int'l Confereence on Information Networking (ICOIN15), pages 503-511, 2001.