Allan Gottlieb
Boris D. Lubachevsky
- 1 BENES, V.E. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.]]Google Scholar
- 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.]]Google Scholar
- 3 BURROUGHS CORP. Numerical aerodynamic simulation facility feasibility study. Rep. NAS2- 9897, Mr. 1979.]]Google Scholar
- 4 CLOS, C. A study of nonblocking switching networks. Bell $yst. Tech. J. 32 (1953), 406-424.]]Google Scholar
- 5 COURTOIS, P.J., HE~ANS, F., AND PARNAS, D.L. Concurrent control with "readers" and "writers." Commun. ACM 14, 10 (Oct. 1971), 667-668.]] Google Scholar
- 6 DEO, N., PANG, C.Y., AND LORD, R.E. Two parallel algorithms for shortest path problems. In Proceedings, 1980 International Conference on Parallel Processing, Bells/re, Mich., 1980, pp. 244-253.]]Google Scholar
- 7 DIJKSTRA, E.W. Seff-stab'fiizing systems in spite of distributed control. Commun. A CM 17, 11 (Nov. 1974), 643-644.]] Google Scholar
- 8 DIJKSTRA, E.W. Hierarchical orderings of sequential processes. Acta Inf. 1, 2 (0ct. 1971), 115-138.]]Google Scholar
- 9 DIJg~STRA, E.W. Solution of a problem in concurrent programming control. Commun. ACM 8, 9 (Sept. 1965), 569.]] Google Scholar
- 10 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.]]Google Scholar
- 11 DRAUGHON, 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.]]Google Scholar
- 12 EISENBERG, M.A., AND McGUIRE, M.R. Further comments on Dijkstra's concurrent programming control problem. Commun. ACM 15, 11 (Nov. 1972), 999.]] Google Scholar
- 13 ELLIS, C.S. Concurrent search and insertion in AVL trees. IEEE Trans. Comput. C-29, 9 (Sept. 1980), 811-817.]]Google Scholar
- 14 GOTTLIEB, A. Washcloth--The logical successor to Soapsuds. Ultracomputer note 12, Courant Inst. of Mathemtical Sciences, New York Univ., New York, 1980.]]Google Scholar
- 15 GOTTLIEB, A., GRISHMAN, R., KaUSKAL, 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).]]Google Scholar
- 16 GOTTLXEB, A., AND KRUSKAL, C. A data motion algorithm. Ultracomputer note 7, Courant Inst. of Mathematical Sciences, New York Univ,, New York, 1980.]]Google Scholar
- 17 HENDERSON, P.B., AND ZALCSTEIN, Y. Characterization of the synchronization languages for PVsystems. In Proceedings, 1978 International Conference on Parallel Processing, Bellaire, Mich., 1978.]]Google Scholar
- 18 HOLOBER, G., AND SNYDER, L. Scheduling parallel processes without a common scheduler. In Proceedings, 1979 International Conference on Parallel Processing, Bellaire, Mich., 1979, pp. 186-195.]]Google Scholar
- 19 I~?SEFF, 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.]] Google Scholar
- 20 KLAPPHOLZ, D. Private communication, 1981.]]Google Scholar
- 21 KNU?H, D.E. The Art~of Computer Programming, voL 3: Sorting and Searching. Addison- Wesley, Reading, Mass., 1973, p. 153.]]Google Scholar
- 22 KNUTH, D.E. Additional comments on a problem in concurrent programming control. Commun. ACM 9, 5 (May 1966), 321-322.]] Google Scholar
- 23 KRUSKAL, C.P., AND SNm, M. Some results on multistage interconnection networks for multiprocessors. Ultracomputer note 41, Courant Inst. of Mathematical Sciences, New York Univ., New York, 1982.]]Google Scholar
- 24 LAMPORT, L. A new solution of Dijkstra's concurrent programming problem. Commun. ACM'17, 8 (Aug. 1974), 453-455.]] Google Scholar
- 25 LAWXU~., D.H. Access and alignment of data in an array processor, iEEE Trans. Comput. C-24, 12 (Dec. 1975), 1145-1155.]]Google Scholar
- 26 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.]] Google Scholar
- 27 LrPTON, R.J., SNYO~.R, L., AND ZALCSTEIN, Y. Evaluation criteria for process synchronization. In Proceedings, IEEE Sagamore Conference on Parallel Processing, Silver Springs, Md., 1975, pp. 245--250.]]Google Scholar
- 28 P~.ASE, M.C. An adaptation of the Fast Fourier Transform for parallel processing. J. ACM 15, 2 (Apr. 1968), 252-264.]] Google Scholar
- 29 PEASe., M.C. Matrix inversion using parallel processing. J. ACM 14, 4 (Oct. 1967), 757-764.]] Google Scholar
- 30 PETERSON, G.L., ANO FXSCHER, 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.]] Google Scholar
- 31 RIVEST, R., ANO 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.]]Google Scholar
- 32 'RuDoLPh, L. Software structures for ultraparallel computing. Ph.D. dissertation, Dep. of Computer Science, New York Univ., New York, 1982.]] Google Scholar
- 33 SCHWARTZ, J.T. Ultracomputers. ACM Trans. Program. Lang. Syst. 2, 4 (Oct. 1980), 484-521.]] Google Scholar
- 34 SCHWARTZ, J.T. The Burroughs FMP machine. Ultracomputer note 5, Courant Inst. of Mathematical Sciences, New York Univ., New York, 1980.]]Google Scholar
- 35 SXP.(~EL, H.J. Single instruction-multiple data strear~ machine interconnection design. In Proceedings, 1976 International Conference on Parallel Processing, Bellaire, Mich., 1976, pp. 272-280.]]Google Scholar
- 36 STONE, H.S. Parallel processing with the perfect shuffle, iEEE Trans. Comput. C-20, 2 (Feb. 1971), 153-161.]]Google Scholar
- 37 SULLIVAN, H., BASHKOW, T., AND I4~LAPPHOLZ, D. A large scale homogeneous, fully distributed parallel machine. Comput. Archit News 5, 7 (Mar. 1977), 105-125.]] Google Scholar
- 38 VALL~NT, L.G. Experiments with a parallel communications scheme. Presented at 18th Allerton Conference on Communication, Control, and Computing, 1980.]]Google Scholar
- 39 VANTILBORGH, H., AND VANLAMSWEERDE, A. On an extension of Dijkstra's semaphore primifives. Inf. Process. Lett. I (1972), 181-186.]]Google Scholar
- 40 WU, C.-L., AND FENG, T.-Y. On a class of multistage interconnection networks, iEEE Trans. Comput. C-29, 8 (Aug. 1980), 694-702.]]Google Scholar
Index Terms
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
Comments