Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 5, Issue 2, 1983, Pages 190-222

  Lamport, Leslie ^a  

^a Intl Computer Science Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976663837     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/69624.357207     Document Type: Article

References (38)

1. BENES, V.E. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.
2. BURNS, J.E., FISCHER, M.J., JACKSON, P., LYNCH, N.A., AND PETERSON, G.L. Shared data requirements for implementations of mutual exclusion using a test-and-set primitive. In Proceedings, 1978 International Conference on Parallel Processing, Bellaire, Mich., 1978, pp. 79-87.
3. BURROUGHS CORP. Numerical aerodynamic simulation facility feasibility study. Rep. NAS2-9897, Mr. 1979.
4. CLOS, C. A study of nonblocking switching networks. Bell Syst. Tech. J. 32 (1953), 406-424.
5. DEO, N., PANG, C.Y., AND LORD, R.E. Two parallel algorithms for shortest path problems. In Proceedings, 1980 International Conference on Parallel Processing, Bellaire, Mich., 1980, pp. 244-253.
6. DIJKSTRA, E.W. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (Nov. 1974), 643-644.
7. DIJKSTRA, E.W. Hierarchical orderings of sequential processes. Acta Inf. 1, 2 (0ct.1971), 115-138.
8. DIJKSTRA, E.W. Solution of a problem in concurrent programming control. Commun. ACM 8, 9 (Sept. 1965), 569.
9. DOLEV, D. A Comparative Study of Synchronization by Parallel Control Systems. Ph.D. dissertation, Dep. of Computer Science, Weizmann Inst. of Science, Rehovot, Israel, 1979.
10. DRAUGHGN, E., GRISHMAN, R, SCHWARTZ, J., AND STEIN, A. Programming considerations for parallel computers. Rep. IMM 362, Courant Inst. of Mathematical Sciences, New York Univ., New York, Nov. 1967.
11. EISENBERG, M.A., AND McGuire., M.R. Further comments on Dijkstra's concurrent programming control problem. Commun. ACM 15, 11 (Nov. 1972), 999.
12. ELLIS, C.S. Concurrent search and insertion in AVL trees. IEEE Trans. Comput. C-29, 9 (Sept. 1980), 811-817.
13. GOTTLIEB, A. Washcloth-The logical successor to Soapsuds. Ultracomputer note 12, Courant Inst. of Mathemtical Sciences, New York Univ., New York, 1980.
14. GOTTLIEB, A., GRISHMAN, R., KRUSKAL, C.P., MCAULIFFE, K.P., RUDOLPH, L., AND SNIR, M. The NYU ultracomputer-Designing an MIMD shared memory parallel machine. To appear in IEEE Trans. Comput, C-32, 2 (Feb. 1983).
15. GOTTLIEB, A., AND KRUSKAL, C. A data motion algorithm. Ultracomputer note 7, Courant Inst. of Mathematical Sciences, New York Univ, New York, 1980.
16. HOLOBER, G., AND SNYDER, L. Scheduling parallel processes without a common scheduler. In Proceedings, 1979 International Conference on Parallel Processing, Bellalre, Mich., 1979, pp. 186-195.
17. KATSEFF, H.P. A new solution to the critical section problem. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, Calif., May 1-3, 1978, pp. 86-88.
18. KLAPPHOLZ, D. Private communication, 1981.
19. KNUTH, D.E. The Art of Computer Programming, vol 3: Sorting and Searching. Addison- Wesley, Reading, Mass., 1973, p. 153.
20. KNUTH, D.E. Additional comments on a problem in concurrent programming control. Commun. ACM 9, 5 (May 1966), 321-322.
21. KRUSKAL, C.P., AND SNIR, M. Some results on multistage interconnection networks for multiprocessors. Ultracomputer note 41, Courant Inst. of Mathematical Sciences, New York Univ., New York, 1982.
22. LAMPORT, L. A new solution of Dijkstra's concurrent programming problem. Commun. ACM.17, 8 (Aug. 1974), 453-455.
23. LAWRIE, D.H. Access and alignment of data in an array processor. IEEE Trans. Comput. C.24, 12 (Dec. 1975), 1145-1155.
24. LIPTON, R.J. Limitations of synchronization primitives with conditional branching and global variables. In Conference Record of Sixth Annual ACM Symposium on Theory of Computing, Seattle, Wash., April 30-May 2, 1974, pp. 230-241.
25. LIPTON, R.J., SNYDER, L., AND ZALCSTEIN, Y. Evaluation criteria for process synchronization. In Proceedings, IEEE Sagamore Conference on Parallel Processing, Silver Springs, Md., 1975, pp. 245-250.
26. PEASE, M.C. An adaptation of the Fast Fourier Transform for parallel processing. J. ACM 15, 2 (Apr. 1968), 252-264.
27. PEASE, M.C. Matrix inversion using parallel processing. J. ACM 14, 4 (Oct. 1967), 757-764.
28. PETERSON, G.L., AND FISCHER, M.J. Economical solutions for the critical section problem in a distributed system. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colo., May 2-4, 1977, pp. 91-97.
29. RIVEST, R., AND PRATT, V.R. The mutual exclusion problem for unreliable processors: Preliminary report. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976, pp. 1-8.
30. Rudolph, L. Software structures for ultraparallel computing. Ph.D. dissertation, Dep. of Computer Science, New York Univ., New York, 1982.
31. SCHWARTZ, J.T. Ultracomputers. ACM Trans. Program. Lang. Syst. 2, 4 (Oct. 1980), 484-521.
32. SCHWARTZ, J.T. The Burroughs FMP machine. Ultracomputer note 5, Courant Inst. of Mathematical Sciences, New York Univ., New York, 1980.
33. SIEGEL, H.J. Single instruction-multiple data stream machine interconnection design. In Proceedings, 1976 International Conference on Parallel Processing, Bellaire, Mich., 1976, pp. 272-280.
34. STONE, H.S. Parallel processing with the perfect shuffle. IEEE Trans. Comput. C-20, 2 (Feb. 1971), 153-161.
35. SULLIVAN, H., BASHKOW, T., AND KLAPPHOLZ, D. A large scale homogeneous, fully distributed parallel machine. Comput. Archit News 5, 7 (Mar. 1977), 105-125.
36. VALIANT, L.G. Experiments with a parallel communications scheme. Presented at 18th Allerton Conference on Communication, Control, and Computing, 1980.
37. VANTILBORGH, H., AND VANLAMSWEERDE, A. On an extension of Dijkstra's semaphore primitives. Inf. Process. Lett. 1 (1972), 181-186.
38. WU, C.-L., AND FENG, T.-Y. On a class of multistage interconnection networks. IEEE Trans. Comput. C-29, 8 (Aug. 1980), 694-702.