ACM Home Page
Please provide us with feedback. Feedback
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
Full text PdfPdf (1.50 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 5 ,  Issue 2  (April 1983) table of contents
Pages: 164 - 189  
Year of Publication: 1983
ISSN:0164-0925
Authors
Allan Gottlieb  Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Boris D. Lubachevsky  Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Larry Rudolph  Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 57,   Citation Count: 84
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/69624.357206
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
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 $yst. Tech. J. 32 (1953), 406-424.
5
 
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.
7
 
8
DIJKSTRA, E.W. Hierarchical orderings of sequential processes. Acta Inf. 1, 2 (0ct. 1971), 115-138.
9
 
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.
 
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.
12
 
13
ELLIS, C.S. Concurrent search and insertion in AVL trees. IEEE Trans. Comput. C-29, 9 (Sept. 1980), 811-817.
 
14
GOTTLIEB, A. Washcloth--The logical successor to Soapsuds. Ultracomputer note 12, Courant Inst. of Mathemtical Sciences, New York Univ., New York, 1980.
 
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).
 
16
GOTTLXEB, A., AND KRUSKAL, C. A data motion algorithm. Ultracomputer note 7, Courant Inst. of Mathematical Sciences, New York Univ,, New York, 1980.
 
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.
 
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.
19
 
20
KLAPPHOLZ, D. Private communication, 1981.
 
21
KNU?H, D.E. The Art~of Computer Programming, voL 3: Sorting and Searching. Addison- Wesley, Reading, Mass., 1973, p. 153.
22
 
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.
24
 
25
LAWXU~., D.H. Access and alignment of data in an array processor, iEEE Trans. Comput. C-24, 12 (Dec. 1975), 1145-1155.
26
 
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.
28
29
30
 
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.
 
32
33
 
34
SCHWARTZ, J.T. The Burroughs FMP machine. Ultracomputer note 5, Courant Inst. of Mathematical Sciences, New York Univ., New York, 1980.
 
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.
 
36
STONE, H.S. Parallel processing with the perfect shuffle, iEEE Trans. Comput. C-20, 2 (Feb. 1971), 153-161.
 
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.
 
38
VALL~NT, L.G. Experiments with a parallel communications scheme. Presented at 18th Allerton Conference on Communication, Control, and Computing, 1980.
 
39
VANTILBORGH, H., AND VANLAMSWEERDE, A. On an extension of Dijkstra's semaphore primifives. Inf. Process. Lett. I (1972), 181-186.
 
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.

CITED BY  84

Collaborative Colleagues:
Allan Gottlieb: colleagues
Boris D. Lubachevsky: colleagues
Larry Rudolph: colleagues