Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/305619.305644acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article
Free access

Efficient parallel solutions of linear algebraic circuits

Published: 01 June 1999 Publication History
First page of PDF

References

[1]
S. K. Abdali and D. S. Wise. Experiments with quadtree representation of matrices. In International Symposium on Symbolic and Algebraic Computation, July 1988.
[2]
Y. Ben-Asher and G. Haber. Parallel solutions of indexed recurrence equations. In International Parallel Processing Symposium, Geneva, pages 413-427, 1997.
[3]
John T. Feo. An analysis of the computational and parallel complexity of the livermore loops. Parallel Computing, (7):163-185, 1986.
[4]
J. Jaja. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
[5]
P. M. Kogge. Parallel solution of recurrence problems. IEEE, pages 138-148, March 1974.
[6]
Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM journal of computing, 17(4):687-695, August 1988.
[7]
John H. Reif. Synthesis of Parallel Algorithms. Morgan Kaufmann, 1993.
[8]
Natalie Revol and Jean-Louis Roch. Parallel evaluation of arithmetic circuits. Theoretical Computer Science, 162:133-150, 1996.
[9]
H. S. Stone. An efficient parallel algorithm for the solution of a trdiagonal linear system of equations. J. A CM, (20,27), 1973.
[10]
D. S. Wise and J. Franco. Costs of quadtree representation of non-dense matrices. Technical Report 229, Computer science, University of Indiana, October 1987.
[11]
M. Wolfe. The tiny loop restructuring research tool. In Proceedings of the International Conference on Parallel Processing, Vol. I1, pp 46-47, August, 1991.

Cited By

View all
  • (2006)Design of Low Memory Usage Discrete Wavelet Transform on FPGA Using Novel Diagonal ScanProceedings of the international symposium on Parallel Computing in Electrical Engineering10.1109/PARELEC.2006.29(192-197)Online publication date: 13-Sep-2006

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SPAA '99: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
June 1999
261 pages
ISBN:1581131240
DOI:10.1145/305619
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 June 1999

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SPAA99

Acceptance Rates

SPAA '99 Paper Acceptance Rate 26 of 90 submissions, 29%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)26
  • Downloads (Last 6 weeks)15
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2006)Design of Low Memory Usage Discrete Wavelet Transform on FPGA Using Novel Diagonal ScanProceedings of the international symposium on Parallel Computing in Electrical Engineering10.1109/PARELEC.2006.29(192-197)Online publication date: 13-Sep-2006

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media