A segmented parallel-prefix VLSI circuit with small delays for small segments

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A segmented parallel-prefix VLSI circuit with small delays for small segments

Full text

Pdf (45 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures table of contents

Las Vegas, Nevada, USA

SESSION: Brief announcements table of contents

Pages: 213 - 213

Year of Publication: 2005

ISBN:1-58113-986-1

Author

Bradley C. Kuszmaul

MIT CSAIL, Cambridge, Massachusetts

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

abstract references index terms 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/1073970.1074002 What is a DOI?

ABSTRACT

I present a VLSI circuit for segmented parallel prefix with gate delay O(log S) and wire delay.

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	David Brooks , Margaret Martonosi, Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance, Proceedings of the 5th International Symposium on High Performance Computer Architecture, p.13, January 09-12, 1999
	2	Fu-Chiung Cheng , Stephen H. Unger , Michael Theobald, Self-Timed Carry-Lookahead Adders, IEEE Transactions on Computers, v.49 n.7, p.659-672, July 2000 [doi>10.1109/12.863035 ]
	3	Ronald I. Greenberg, The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay, IEEE Transactions on Computers, v.43 n.12, p.1358-1364, December 1994 [doi>10.1109/12.338095 ]
	4	B. C. Kuszmaul. A segmented parallel-prefix vlsi circuit with small delays for small segments (full version). http://kuszmaul.net/p/Kuszmaul05b, MAY 2005.
	5	B. C. Kuszmaul, D. S. Henry, and G. H. Loh. A comparison of asymptotically scalable superscalar processors. Theory of Comput. Syst., 35:129--150, 2002.
	6	Charles E. Leiserson , Zahi S. Abuhamdeh , David C. Douglas , Carl R. Feynman , Mahesh N. Ganmukhi , Jeffrey V. Hill , W. Daniel Hillis , Bradley C. Kuszmaul , Margaret A. St. Pierre , David S. Wells , Monica C. Wong-Chan , Shaw-Wen Yang , Robert Zak, The network architecture of the connection machine CM-5, Journal of Parallel and Distributed Computing, v.33 n.2, p.145-158, March 15, 1996 [doi>10.1006/jpdc.1996.0033 ]
	7	Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi>10.1145/3828.3835]