Article

Free access

Parallel arithmetic with concurrent writes

Author:

Alon ItaiAuthors Info & Claims

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Pages 293 - 299

https://doi.org/10.1145/323596.323624

Published: 01 August 1985 Publication History

PDF eReader

References

[1]

A. Chandra, L. Stockmeyer and U. Vishkin, A Complexity Theory,for Unbounded Fan-In Parallelism, Proc. 23rd IEEE-FOCS (1982), 231-233.

Crossref

Google Scholar

[2]

S. Cook and C. Dwork, Bounds on the Time for Parallel RAMs to Compute Simple Functions, Proc 14th ACM STOC (1982), 231-233.

Digital Library

Google Scholar

[3]

Faith Fich, F. Meyer aug der Heide, P. Ragde and A. Wigderson, One, Two, Three .. Infinity: Lower Bounds for Parallel Computation, Proc 17th ACM STOC (1985), 48-58.

Digital Library

Google Scholar

[4]

M. Furst, J. Saxe and M. Sipser, Parity, Circuits and the Polynomial Time Hierarchy, Proc. 21st IEEE-FOCS, (1981), 260-270.

Digital Library

Google Scholar

[5]

F. Meyer aug der Heide and R. Reischuk, On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication, 25th IEEE-FOCS (1984), 56-64.

Google Scholar

[6]

R. Reisehuk, Simultaneous Write of Parallel Random Access Machines Do Not Help to Compute Simple Arithmetic Functions, Universit~it Bielefeld, Fakult~t Mathematik, Universit~itsstrasse, 4800 Bielfeld 1, Federal Republic of Germany.

Google Scholar

[7]

Y. Shiloach and U. Vishkin, Finding the Maximum, Merging and Sorting in Parallel J. of Algorithms, 2 (1981), 88-102.

Crossref

Google Scholar

[8]

L. Valiant, Parallelism in Comparison Problems, SIAM J. on Computing, 4 (1975), 348- 355.

Crossref

Google Scholar

[9]

A. Yao, Separating the Polynomial- Time Hierarchy by Oracles: Part I, Computer Science Dep~rtment, Stanford University (1985).

Google Scholar

Index Terms

Parallel arithmetic with concurrent writes

Recommendations

Parallel concurrent ML
ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming

Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite effective over the years and has been incorporated in a number of other ...
Parallel concurrent ML
ICFP '09

Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite effective over the years and has been incorporated in a number of other ...
Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor

A simple but powerful architecture based on the classical associative processor model is proposed. By distributing logic among slices of storage cells such that a number of bit-planes share a simple logic unit, bit-parallel arithmetic for massively ...

Comments

Information & Contributors

Information

Published In

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

August 1985

316 pages

ISBN:0897911687

DOI:10.1145/323596

Editors:
Michael Malcolm
Univ. of Waterloo, Waterloo, Ont., Canada
,
Ray Strong
IBM Research, San Jose, CA

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

Ontario, Minaki, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
184
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)6

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Parallel concurrent ML

Parallel concurrent ML

Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

PDF

eReader

Login options

Full Access

References

Index Terms

Recommendations

Parallel concurrent ML

Parallel concurrent ML

Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations