Cited By
View all- Martel CVayda T(1988)The complexity of selection resolution, conflict resolution and maximum finding on multiple access channelsVLSI Algorithms and Architectures10.1007/BFb0040407(401-410)Online publication date: 1988
Simple, efficient asynchronous parallel algorithms for maximization
Pages 300 - 308
References
[1]
Bender, E. A., "Central and local limit theorems applied to asymptotic enumeration', J. Comb. Theory 15 (1973), 91-111.
[2]
Frieze, A. and Rudolph, L., 'A parallel algorithm for all pairs shortest paths in a random graph', 22nd Annual Allerton Conference on Communication, Control, and Computation (October, 1984), 663-670.
[3]
Gottlieb, A., Lubachevsky, B.D., and Rudolph, L., 'Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors', ACM Transactions on Programming Languages and Systems, 5, 2 (April 1983), 164-189.
[4]
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", IEEE Transactions on Computers, C- 32, 2 (February 1983).
[5]
Gottlieb, A., and Kruskal, C.P. 'Coordinating parallel processors: a partial unification", ACM SIGARCH, Computer Architecture News, (October 1981), 16-24.
[6]
Holt, R,C., Graham, G.S., Lazowska, E.D., and Scott, M.A., Structured Concurrent Programming with Operating Systems Applications, Addison-Wesley, Reading, Mass. (1978).
[7]
Kalos, M., private communication (1980).
[8]
Levitan, S.P, and Foster, C.F., 'Finding an extremum in a network', Proceedings of the 9-th International Symposium on Computer Architecture, Austin, Texas (April 1982), 321-325.
[9]
Lubachevsky, B.D., 'Verification of several parallel coordination programs based on descriptions of their reachability sets', Ultracomputer Note #33, Courant institute, New York University (July, 1981).
[10]
Lubachevsky, B.D., 'An approach to automating the verification of compact parallel coordination programs I: Acta Inf., 21 (1984), 125-169.
[11]
Megiddo, N., 'Parallel algorithms for finding the maximum and the median almost surely in constant time,' preliminary manuscript, GSIA, Carnegie-Mellon University, Pittsburgh, PA (1982).
[12]
Reif, J., and Spirakis, P.G., "Real time synchronization of interprocess communications", ACM Transactions on Programming Languages and Systems, 6, 2 (April 1984), 215-238.
[13]
Rudolph, L., Software Structures for Ultraparallel Computing, Ph.D. Thesis, Courant Institute, New York University (De.tuber, 1981).
Index Terms
- Simple, efficient asynchronous parallel algorithms for maximization
Recommendations
Simple, efficient, asynchronous parallel algorithms for maximization
The problem of computing the maximum of n inputs on an asynchronous parallel computer is considered. In general, the inputs may arrive staggered in time, the number of processors available to the maximization algorithm may vary during its execution, and ...
Asynchronous parallel algorithms for test set partitioned fault simulation
We propose two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1985 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1985
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 181Total Downloads
- Downloads (Last 12 months)38
- Downloads (Last 6 weeks)3
Reflects downloads up to 20 Dec 2024
Other Metrics
Citations
Cited By
View all- Martel CVayda T(1988)The complexity of selection resolution, conflict resolution and maximum finding on multiple access channelsVLSI Algorithms and Architectures10.1007/BFb0040407(401-410)Online publication date: 1988
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in