Overcoming the memory wall in symbolic algebra

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Overcoming the memory wall in symbolic algebra: a faster permutation multiplication

Full text

Pdf (63 KB)

Source

ACM SIGSAM Bulletin archive
Volume 36 , Issue 4 (December 2002) table of contents

DEMONSTRATION SESSION: SIGSAM BULLETIN table of contents

Pages: 1 - 4

Year of Publication: 2002

ISSN:0163-5824

Authors

Gene Cooperman	Northeastern University, Boston, MA
Xiaoqin Ma	Northeastern University, Boston, MA

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/641239.641241 What is a DOI?

ABSTRACT

The traditional permutation multiplication algorithm is now limited by memory latency and not by CPU speed. A new cache-aware permutation algorithm speeds up permutation multiplication by a factor of 3.4 on current CPUs. The new algorithm is limited by memory bandwidth, but not by memory latency. Current trends indicate improving memory bandwidth and stagnant memory latency. This makes the new algorithm especially important for future computer architectures. In addition, we believe this "memory wall" will soon force a redesign of other common algorithms of symbolic algebra.

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	Intel PC SDRAM Specification, Revision 1.7, November 1999. http://www.intel.com/technology/memory/pc133sdram/spec/sdram133.htm
	2	Gene Cooperman , Victor Grinberg, Scalable parallel coset enumeration: bulk definition and the memory wall, Journal of Symbolic Computation, v.33 n.5, p.563-585, May 2002 [doi>10.1006/jsco.2002.0523]
	3	Wm. A. Wulf , Sally A. McKee, Hitting the memory wall: implications of the obvious, ACM SIGARCH Computer Architecture News, v.23 n.1, p.20-24, March 1995 [doi>10.1145/216585.216588]

CITED BY

Gene Cooperman , Eric Robinson, Memory-based and disk-based algorithms for very high degree permutation groups, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.66-73, August 03-06, 2003, Philadelphia, PA, USA

Collaborative Colleagues:

Gene Cooperman: colleagues

Xiaoqin Ma: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player