- - - - CENAPAD-MGCO

A seguir: Index Acima: DCC 837 Programação Paralela Anterior: Balanço e Conclusões

References

Andrews and Schneider, 1983

Andrews, G. R. and Schneider, F. B. (1983).
Concepts and notations for concurrent programming.
Computing Surveys, 15:3-43.

Bal et al., 1989

Bal, H. E., Steiner, J. G., and Tanembaum, A. S. (1989).
Programming languages for distributed computing systems.
ACM Computing Surveys, 21(3).

Barbara and Garcia-Molina, 1986

Barbara, D. and Garcia-Molina, H. (1986).
Mutual exclusion in partitioned distributed systems.
Distributed Computing, 1(1):119-132.

Ben-Ari, 1986

Ben-Ari, M. (1986).
Principles of Concurrent Programming.
Prentice-Hall, Englewood Cliffs, NJ.

Bernstein et al., 1987

Bernstein, P. A., Hadzilacos, V., and Goodman, N. (1987).
Concurrency Control and Recovery in Database Systems.
Addison-Wesley, Reading.

Bitton et al., 1984

Bitton, D., DeWitt, D. J., Hsiao, D. K., and Menon, J. (1984).
A taxonomy of parallel sorting.
ACM Computing Surveys, 16(3):287-318.

Campbell and Habermann, 1974

Campbell, R. H. and Habermann, A. N. (1974).
The specification of process synchronization by path expressions, volume 16 of Lecture Notes in Computer Science.
Springer Verlag.

Carvalho and Roucairol, 1983

Carvalho, O. S. F. and Roucairol, G. (1983).
On mutual exclusion in computer networks.
Communications of the ACM, 26(2).

Chandy and Misra, 1984

Chandy, K. M. and Misra, J. (1984).
The drinking philosophers problem.
ACM Transactions on Programming Languages and Systems, 6(4).

de Aguiar Campos and Carvalho, 1988

de Aguiar Campos, S. V. and Carvalho, O. S. F. (1988).
Um algoritmo distribuído para exclusão mútua com $o(\sqrt{n})$ mensagens.
In Anais do 6$^{\underline{o}}$ Simpósio Brasileiro de Redes de Computadores, PortoAlegre. Sociedade Brasileira de Computação.

Dijkstra, 1965a

Dijkstra, E. W. (1965a).
Co-operating Sequential Processes.
Academic Press, London.

Dijkstra, 1965b

Dijkstra, E. W. (1965b).
Solution of a problem in concurrent programming control.
Communications of the ACM, 8(9):569.

Dijkstra, 1975

Dijkstra, E. W. (1975).
Guarded commands, nondeterminacy and formal derivation of programs.
Communications of the ACM, 18(8):453-457.

Dinning, 1989

Dinning, A. (1989).
A survey of synchronization methods for parallel computers.
Computer, 22(7):66-77.

Dubois et al., 1988

Dubois, M., Scheurich, C., and Briggs, F. A. (1988).
Synchronization, coherence, and event ordering in multiprocessors.
Computer, 21(2):9-21.

Eswaran et al., 1976

Eswaran, K. P., Gray, J. N., Lorie, R. A., and Traiger, I. L. (1976).
The notions of consistency and predicate locks in a database system.
Communications of the ACM, 19(11).

Floyd, 1967

Floyd, R. W. (1967).
Assigning meaning to programs.
In Schwartz, J. T., editor, Mathematical aspects of computer science: Proc. American Mathematics Soc. symposia, volume 19, pages 19-31, Providence RI. American Mathematical Society.

Gray and Reuter, 1993a

Gray, J. and Reuter, A. (1993a).
Transaction Processing: Concepts and Techniques.
Morgan Kaufmann Publishers, San Mateo, CA.

Gray and Reuter, 1993b

Gray, J. and Reuter, A. (1993b).
Transaction Processing: concepts and techniques.
Morgan Kaufmann Publishers, Inc.

Hansen, 1972

Hansen, P. B. (1972).
Concurrent programming concepts.
ACM Computing Surveys, 5:233-245.

Hoare, 1969

Hoare, C. A. R. (1969).
An axiomatic basis for computer programming.
Communications of the ACM, 12(10):576-580.

Hoare, 1974

Hoare, C. A. R. (1974).
Monitors, an operating system structuring concept.
Communications of the ACM, 17(10):549-557.

Hoare, 1978

Hoare, C. A. R. (1978).
Communicating sequential processes.
Communications of the ACM, 21(8):666-677.

Johnson and Shasha, 1993

Johnson, T. and Shasha, D. (1993).
The performance of concurrent B-Tree algorithms.
ACM Transactions on Database Systems, 18(1):51-101.

Keller, 1976

Keller, R. M. (1976).
Formal verification of parallel programs.
Communications of the ACM, 19(7).

Knuth, 1966

Knuth, D. E. (1966).
Additional comments on a problem in concurrent programming control.
Communications of the ACM, 9(5):321-322.
Letter to the editor.

Kohler, 1981

Kohler, W. H. (1981).
A survey of techniques for synchronization and recovery in decentralized computer systems.
ACM Computing Surveys, 13(2).

Lakshman and Agrawala, 1986

Lakshman, T. V. and Agrawala, A. K. (1986).
Efficient decentralized consensus protocols.
IEEE Transactions on Software Engineering, SE-12(5):600-607.

Lamport, 1978

Lamport, L. (1978).
Time, clocks, and the ordering of events in a distributed system.
Communications of the ACM, 21(7).

Maekawa, 1985

Maekawa, M. (1985).
A $\sqrt{n}$ algorithm for mutual exclusion in decentralized systems.
ACM Transactions on Computing Systems, 3(2).

Manna and Pnueli, 1981

Manna, Z. and Pnueli, A. (1981).
Verification of concurrent programs: Temporal proof principles.
In Kahn, G., editor, Logics of Programs, volume 131 of LNCS, pages 200-252. Springer-Verlag , Berlin, Germany.

Milner, 1984

Milner, R. (1984).
Lectures on a Calculus for Communicating Systems, volume 197 of LNCS.
Springer-Verlag, New York, NY.

Naimi and Trehel, 1987

Naimi, M. and Trehel, M. (1987).
An improvement of the $\log{N}$ distributed algorithm for mutual exclusion.
In 7th International Conference on Distributed Computing Systems, pages 371-377, Washington, D.C., USA. IEEE Computer Society Press.

Owick and Gries, 1976

Owick, S. and Gries, D. (1976).
Verifying properties of parallel programs: an axiomatic approach.
Communications of the ACM, 19(5).

Peterson, 1981

Peterson, G. L. (1981).
Myths about the mutual exclusion problem.
Information Processing Letters, 12(3):115-116.

Pnueli, 1979

Pnueli, A. (1979).
The temporal semantics of concurrent programs.
In Kahn, G., editor, Semantics of Concurrent Computations, volume 70 of LNCS, pages 1-20, Evian, France. Springer-Verlag , Berlin, Germany.

Ricart and Agrawala, 1981

Ricart, G. and Agrawala, A. K. (1981).
An optimal algorithm for mutual exclusion in computer networks.
Communications of the ACM, 24(1).

Shankar, 1993

Shankar, A. U. (1993).
An introduction to assertional reasoning for concurrent systems.
ACM Computing Surveys, 25(3):225-262.

Tanenbaum, 1987

Tanenbaum, A. S. (1987).
Operating Systems Design Implemtations.
Prentice-Hall.