ARCHITECTURE-AWARE CLASSICAL TAYLOR SHIFT BY 1

ARCHITECTURE-AWARE CLASSICAL TAYLOR SHIFT BY 1 (2005)

Cached

Download Links

[www.cs.drexel.edu]

by Jeremy R. Johnson , Werner Krandick , Anatole D. Ruslanov

Citations:

15 - 2 self

Versions

Version History

Metadata Version 1

User correction supplied by mph

Datum	Value	Source
TITLE	ARCHITECTURE-AWARE CLASSICAL TAYLOR SHIFT BY 1	user correction
AUTHOR NAME	Jeremy R. Johnson	user correction
AUTHOR AFFIL	DEPARMENT OF COMPUTER SCIENCE; DREXEL UNIVERSITY, PHILADELPHIA	user correction
AUTHOR ADDR	PA 19104	user correction
AUTHOR NAME	Werner Krandick	user correction
AUTHOR AFFIL	DEPARMENT OF COMPUTER SCIENCE; DREXEL UNIVERSITY, PHILADELPHIA	user correction
AUTHOR ADDR	PA 19104	user correction
AUTHOR NAME	Anatole D. Ruslanov	user correction
AUTHOR AFFIL	DEPARMENT OF COMPUTER SCIENCE; DREXEL UNIVERSITY, PHILADELPHIA	user correction
AUTHOR ADDR	PA 19104	user correction
ABSTRACT	We present algorithms that outperform straightforward implementations of classical Taylor shift by 1. For input polynomials of low degrees a method of the SACLIB library is faster than straightforward implementations by a factor of at least 2; for higher degrees we develop a method that is faster than straightforward implementations by a factor of up to 7. Our Taylor shift algorithm requires more word additions than straightforward implementations but it reduces the number of cycles per word addition by reducing memory tra c and the number of carry computations. The introduction of signed digits, suspended normalization, radix reduction, and delayed carry propagation enables our algorithm to take advantage of the technique of register tiling which is commonly used by optimizing compilers. While our algorithm is written in a high-level language, it depends on several parameters that can be tuned to the underlying architecture.	user correction
YEAR	2005	SVM HeaderParse 0.2
CITATIONS	21 found	ParsCit 1.0