|
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
|
|
|
|
|
Cynthia Dwork , Maurice Herlihy , Orli Waarts, Contention in shared memory algorithms, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.174-183, May 16-18, 1993, San Diego, California, United States
|
|
|
|
|
|
|
|
|
Yehuda Afek , Eytan Weisberger , Hanan Weisman, A completeness theorem for a class of synchronization objects, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.159-170, August 15-18, 1993, Ithaca, New York, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Maurice Herlihy , Beng-Hong Lim , Nir Shavit, Low contention load balancing on large-scale multiprocessors, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.219-227, June 29-July 01, 1992, San Diego, California, United States
|
|
|
|
|
|
|
|
|
Susan Flynn Hummel , Edith Schonberg , Lawrence E. Flynn, Factoring: a practical and robust method for scheduling parallel loops, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.610-632, November 18-22, 1991, Albuquerque, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Clyde P Kruskal , Larry Rudolph , Marc Snir, Efficient synchronization of multiprocessors with shared memory, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.218-228, August 11-13, 1986, Calgary, Alberta, Canada
|
|
|
|
|
|
Maged M. Michael , Michael L. Scott, Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.267-275, May 23-26, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
Guy E. Blelloch , Phillip B. Gibbons , Girija J. Narlikar , Yossi Matias, Space-efficient scheduling of parallelism with synchronization variables, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.12-23, June 23-25, 1997, Newport, Rhode Island, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Borodin , J. E. Hopcroft, Routing, merging and sorting on parallel models of computation, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.338-344, May 05-07, 1982, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
James Aspnes , Maurice Herlihy , Nir Shavit, Counting networks and multi-processor coordination, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.348-358, May 05-08, 1991, New Orleans, Louisiana, United States
|
|
|
|
|
|
Albert G. Greenberg , Boris D. Lubachevsky , Andrew M. Odlyzko, Simple, efficient asynchronous parallel algorithms for maximization, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.300-308, August 1985, Minaki, Ontario, Canada
|
|
|
|
|
|
|
|
|
Nancy Lynch , Nir Shavit , Alex Shvartsman , Dan Touitou, Counting networks are practically linearizable, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.280-289, May 23-26, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mark Moir , Daniel Nussbaum , Ori Shalev , Nir Shavit, Using elimination to implement scalable and lock-free FIFO queues, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
|
|
|
|
|
|
Kunal Agrawal , Yuxiong He , Wen Jing Hsu , Charles E. Leiserson, Adaptive scheduling with parallelism feedback, Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, March 29-31, 2006, New York, New York, USA
|
|
|
|
|
|
|
|
|
|
|
|
Zhen Fang , Lixin Zhang , John B. Carter , Ali Ibrahim , Michael A. Parker, Active memory operations, Proceedings of the 21st annual international conference on Supercomputing, June 17-21, 2007, Seattle, Washington
|
|
|
Jan Edler , Allan Gottlieb , Clyde P. Kruskal , Kevin P. McAuliffe , Larry Rudolph , Marc Snir , Patricia J. Teller , James Wilson, Issues related to MIMD shared-memory computers: the NYU ultracomputer approach, ACM SIGARCH Computer Architecture News, v.13 n.3, p.126-135, June 1985
|
|
|
|
|
|
|
|
|
|
|
|
Sanjeev Kumar , Daehyun Kim , Mikhail Smelyanskiy , Yen-Kuang Chen , Jatin Chhugani , Christopher J. Hughes , Changkyu Kim , Victor W. Lee , Anthony D. Nguyen, Atomic Vector Operations on Chip Multiprocessors, ACM SIGARCH Computer Architecture News, v.36 n.3, p.441-452, June 2008
|
|