Referˆencias 59
[12] CERN. Large hadron collider, glo bal grid service for lhc computing suc-
ceeds in gigabyte-per-second challenge. http://press.web.cern.ch/Press/
PressReleases/Releases2006/PR03.06E.html, 2006. [Acesso feito em: 2007 .1 1.07].
[13] Chang, Y.-I. A simulation study on distributed mutual exclusion. JPDC: Journal
of Parallel and Distributed Computing 33, 2 (1996), 107–121 .
[14] Chang, Y.-I., Singhal, M. e Liu, M. A hybrid approa ch to mutual exclusion for
distributed systems. Computer Software and Applications Conference, COMPSAC
90 (1990), 289–294 .
[15] Chang, Y.-I., Singhal, M. e Liu, M. T. A fa ult tolerant algorithm for distri-
buted mutual exclusion. Em Proceedings Ninth Symposium on Reliable Distributed
Systems (9th SRDS’90) (Huntsville, Alabama, USA, outubro de 1990), IEEE Com-
puter Society Press, pp. 146–154.
[16] Chang, Y.-I., Singhal, M. e Liu, M. T. An improved O(logn) mutual exclusion
algorithm for distributed systems. Em ICPP International Conference on Parallel
Processing (1990), pp. 295–30 2.
[17] DeMent, N. S. e Srimani, P. K. A new algorithm for mutual exclusions in
distributed systems. Journal of Systems and Software 26, 2 (1994), 179–191.
[18] Drummond, L. M. A. e Barbosa, V. C. On reducing the complexity of matrix
clocks. Parallel Computing 29, 7 (julho de 2003), 895–905.
[19] Erciyes, K. Distributed mutual exclusion algorithms on a ring of clusters. Em
Computational Science and Its Applications - ICCSA 2004, International Confe rence
(2004), A. Lagan`a, M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K. Ta n, e O. Gervasi,
Eds., vol. 3045 of Lecture Notes in Computer Science, Springer, pp. 518–527.
[20] Fidge, C. J. Timestamps in message-passing systems that preserve the partial
ordering. Em Proc. 11th Australian Computer Science Conference (1988), pp. 56–66.
[21] Garcia-Molina, H. e Barbara, D. How to assign votes in a distributed system.
JACM: Journal of the ACM 32, 4 (1985), 841–860.
[22] Gifford, D. K. Weighted voting for replicated data. Em SOSP ’79: Proceedings of
the seventh ACM symposium on Operating systems prin ciples (New York, NY, USA,
1979), ACM, pp. 150–162.
[23] Han, H., Jung, H., Yeom, H. Y., Kweon, H. S. e Lee, J. HVEM g r id: Expe-
riences in constructing an electron microscopy grid. Em Frontiers of WWW Research
and Development - APWeb 2006, 8th Asia-Pacific Web Conference , Harbin, China,
January 16-18, 2006, Proceedings (2006), X. Zhou, J. Li, H. T. Shen, M. Kitsure-
gawa, e Y. Zhang, Eds., vol. 3841 of Lecture Notes in Computer Science, Springer,
pp. 1159–11 62.
[24] Helary, J. M., Plouzeau, N. e Raynal, M. A distributed algorithm for mutual
exclusion in an arbitrary network. The Computer Journal. 31, 4 (1988), 289–295.
[25] Hemminger, S. Network emulation with netem. Tech report, Open Source Deve-
lopment lab, 4 2005. [Acesso feito em: 20 08.03.19].