Representing matrices as quadtrees for parallel processors

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Representing matrices as quadtrees for parallel processors: extended abstract

Full text

Pdf (110 KB)

Source

ACM SIGSAM Bulletin archive
Volume 18 , Issue 3 (August 1984) table of contents

Pages: 24 - 25

Year of Publication: 1984

ISSN:0163-5824

Author

David S. Wise

Oregon State University and Indiana University, Bloomington, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 2

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1089389.1089398 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	S. Kamal Abdali , B. David Saunders, Transitive closure and related semiring properties via eliminants, Theoretical Computer Science, v.40 n.2-3, p.257-274, Nov. 1985
	2	D. Bini & C. Lotti. Stability of fast algorithms for matrix multiplication. Numer. Math. 36, 1 (December, 1980), 63--72.
	3	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	4	D. P. Friedman & D. S. Wise. Aspects of applicative programming for parallel processing. IEEE Trans. Comput. C-27, 4 (April, 1978), 289--296.
	5	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	6	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	7	J. Spiess. Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix-Multiplikation. Computing 17, 1 (1976), 23--36.
	8	V. Strassen. Gaussian elimination is not optimal. Numer. Math. 13, 4 (August 19, 1969), 354--356.

CITED BY 2

	Jeremy D. Frens , David S. Wise, Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code, ACM SIGPLAN Notices, v.32 n.7, p.206-216, July 1997
	Kiminori Matsuzaki , Hideya Iwasaki , Kento Emoto , Zhenjiang Hu, A library of constructive skeletons for sequential style of parallel programming, Proceedings of the 1st international conference on Scalable information systems, p.13-es, May 30-June 01, 2006, Hong Kong

Collaborative Colleagues:

David S. Wise: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player