XI Workshop de Testes e Tolerância a Falhas (WTF) - SBRC 2010
XI Workshop de Testes e Tolerância a Falhas (WTF) - SBRC 2010
XI Workshop de Testes e Tolerância a Falhas (WTF) - SBRC 2010
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
30 Anais<br />
instantânea. Além disso, o anel não precisa ser reconstruído e, se o token contiver dados<br />
da aplicação, estes po<strong>de</strong>m ser mais facilmente recuperados.<br />
Referências<br />
Amir, Y., Moser, L. E., Melliar-Smith, P. M., Agarwal, D. A., and Ciarfella, P. (1995).<br />
The totem single-ring or<strong>de</strong>ring and membership protocol. ACM Trans. Comput. Syst.,<br />
13(4):311–342.<br />
Chang, E. and Roberts, R. (1979). An improved algorithm for <strong>de</strong>centralized extremafinding<br />
in circular configurations of processes. Commun. ACM, 22(5):281–283.<br />
Chang, I., Singhal, M., and Liu, M. T. (1990). A fault tolerant algorithm for distributed<br />
mutual exclusion. In Proceedings of the IEEE 9th Symposium on Reliable Distributed<br />
Systems, pages 146–154.<br />
Chang, J.-M. and Maxemchuck, N. F. (1984). Reliable broadcast protocols. ACM Trans.<br />
Comput. Syst., 2(3):351–273.<br />
Défago, X., Schiper, A., and Urbán, P. (2004). Total or<strong>de</strong>r broadcast and multicast algorithms:<br />
Taxonomy and survey. ACM Comput. Surv., 36(4):372–421.<br />
Dijkstra, E. W., Feijen, W. H. J., and van Gasteren, A. J. M. (1986). Derivation of a<br />
termination <strong>de</strong>tection algorithm for distributed computations. In Proc. of the NATO<br />
Advanced Study Institute on Control flow and data flow: concepts of distributed programming,<br />
pages 507–512.<br />
Ekwall, R., A.Schiper, and Urbán, P. (2004). Token-based atomic broadcast using unreliable<br />
failure <strong>de</strong>tectors. In SRDS, pages 52–65.<br />
Franklin, R. W. (1982). On an improved algorithm for <strong>de</strong>centralized extrema finding in<br />
circular configurations of processors. Communications of the ACM, 25(5):336–337.<br />
Lann, G. L. (1977). Distributed systems - towards a formal approach. In IFIP Congress,<br />
pages 155–160.<br />
Manivannan, D. and Singhal, M. (1994). An efficient fault-tolerant mutual exclusion<br />
algorithm for distributed systems. In ISCA International Conference on Parallel and<br />
Distributed Computing Systems, pages 525–530.<br />
Misra, J. (1983). Detecting termination of distributed computations using markers. In<br />
PODC ’83: Proceedings of the second annual ACM symposium on Principles of distributed<br />
computing, pages 290–294.<br />
Mueller, F. (2001). Fault tolerance for token-based synchronization protocols. <strong>Workshop</strong><br />
on Fault-Tolerant Parallel and Distributed Systems, IEEE.<br />
Nishio, S., Li, K. F., and Manning, E. G. (1990). A resilient mutual exclusion algorithm<br />
for computer networks. IEEE Trans. on Parallel and Distributed Systems, 1(3):344–<br />
355.<br />
Peterson, G. L. (1982). An o(nlog n) unidirectional algorithm for the circular extrema<br />
problem. ACM Transactions on Programming Languages and Systems (TOPLAS),<br />
4(4):758–762.