Home > Store

IA-64 and Elementary Functions: Speed and Precision

Register your product to gain access to bonus material or receive a coupon.

IA-64 and Elementary Functions: Speed and Precision

  • Published May 1, 2000 by Pearson.

Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

Description

  • Copyright 2000
  • Dimensions: 7 X 9-1/4
  • Pages: 298
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-018348-2
  • ISBN-13: 978-0-13-018348-4

  • Covers every major elementary function, including square root and division
  • IA-64 architecture and Explicit Parallel Instruction Computing (EPIC), in depth
  • By an active participant in HP's IA-64 development team
  • For every professional building high-performance IA-64 server applications and operating systems

Optimizing code for the new IA-64 architecture.

"...a timely and valuable book. It will appeal to those interested separately or jointly in IA-64 and the elementary math functions."
—William S. Worley, Jr., Distinguished Contributor, Hewlett-Packard Laboratories

In IA-64 and Elementary Functions: Speed and Precision, leading HP computer architect Dr. Peter Markstein introduces the IA-64 architecture and its breakthrough elementary math functions. This information—essential to the development of optimized IA-64 server applications and operating systems—was formerly available only in specialized journals, or not available at all.

Markstein first introduces the IA-64 architecture, the objectives that motivated its design, and the unique architectural features that can be exploited by developers of high-performance elementary function libraries, including software pipelining, instruction grouping, prefetching, predication, speculative execution, and explicit parallelism. He then introduces several techniques that lend themselves to software pipelining, which is exceptionally well supported by the IA-64 architecture and can lead to dramatic performance gains.

The book covers all major elementary functions, demonstrating how they can be implemented to deliver optimal IA-64 performance and accuracy. Among the functions covered: square root and division, which must be performed in software on the IA-64.

For professional computer scientists, system software developers, mathematicians, and anyone building high-performance IA-64 software, IA-64 and Elementary Functions: Speed and Precision will be absolutely indispensable.

Sample Content

Downloadable Sample Chapter

Click here for a sample chapter for this book: 0130183482.pdf

Table of Contents

I. IA-64 Architecture

1. NEW ARCHITECTURE OBJECTIVES.

VLIW. Memory Enhancements. Software Pipelining. Floating Point Enhancements. Summary.

2. IA-64 INSTRUCTIONS AND REGISTERS.

Instructions. Register Sets. Accessing Memory. Assembly Language. Problems.

3. INCREASING INSTRUCTION LEVEL PARALLELISM.

Branching. Speculation. Problems.

4. FLOATING POINT ARCHITECTURE.

Floating Point Status Register. Precision. Fused Multiply-Add. Division and Square Root Assists. Floating Comparisons. Communication between Floating Point and General Purpose Registers. Fixed Point Multiplication. SIMD Arithmetic. Problems.

5. PROGRAMMING FOR IA-.

Compiler Options. Pragmas. Floating Point Data Types. In-Line Assembly. The fenv.h Header. Extended Examples. Quad Precision. Problems.

II. Computation of Elementary Functions.

6. MATHEMATICAL PRELIMINARIES.

Floating Point. Approximation and Error Analysis. The Exclusion Theorem. Ulps. Problems.

7. APPROXIMATION OF FUNCTIONS.

Taylor Series. Lagrangian Interpolation. Chebychev Approximation. Remez Approximation. Practical Considerations. Function Evaluation. Table Construction. Problems.

8. DIVISION.

Approximations for the Reciprocal. Computing the Quotient. Division Using Only Final Precision Results. Fast Variants of Division. Remainder. Integer Division. An Implementation of Division. Problems.

9. SQUARE ROOT.

Approximations. Rounding the Square Root. Computing the Square Root. Calculating the Reciprocal Square Root. An Implementation of Square Root. Problems.

10. EXPONENTIAL FUNCTIONS.

Definitions and Formulas. Argument Reduction. Error Containment. Computing the Exponential. The Function expm. Problems.

11. LOGARITHMIC FUNCTIONS.

General Relations. Argument Reductions. Error Analysis. The Function log1p. Computing the Logarithm. Problems.

12. THE POWER FUNCTION.

Definition. Single Precision. Double Precision. Double-Extended Precision. Quad Precision. Computing the Power Function. Problems.

13. TRIGONOMETRIC FUNCTIONS.

Formulas and Identities. Argument Reduction. Error Analysis. Computing the Trigonometric Functions. Problems.

14. INVERSE SINE AND COSINE.

Definitions and Formulas. Argument Reduction. Error Analysis. Computing the arcsin. Problems.

15. INVERSE TANGENT FUNCTIONS.

Definitions and Formulas. Argument Reduction. Error Analysis. Computing the arctan. Problems.

16. HYPERBOLIC FUNCTIONS.

Definitions and Formulas. Argument Reduction. Error Analysis. Computing the Hyperbolic Functions. Problems.

17. INVERSE HYPERBOLIC FUNCTIONS.

Definitions and Formulas. arcsinh. arccosh. arctanh. Problems.

18. ODDS AND ENDS.

Correctly Rounded Functions. Monotonicity. Alternative Algorithms. Testing. New Architectural Directions. Problems.

A. IN-LINE ASSEMBLY.
B. SOLUTIONS TO PROBLEMS.
BIBLIOGRAPHY.
SUBJECT INDEX.

Preface

Preface

This book puts under one cover the details of an elementary functionlibrary, covering the underlying mathematics as well as providingimplementation details, directed toward IA-64 architecture. Some of thematerial is difficult to find elsewhere, and some of it is scattered over avariety of conference proceedings and journals. The material should appealto readers with interest in elementary functions, as well as readersinterested in using IA-64 effectively. Part I discusses IA-64 architecturein detail, including motivation for the architecture. The description ofIA-64 is illustrated with extended examples chosen from numericalcalculation. Part II shows how to exploit IA-64 architecture in the domainof elementary functions. While the text emphasizes accurate computation, italso points to shortcuts in division and square root that may be of interestin graphics and other applications which heavily use short floating pointtypes. Most of the mathematical arguments are relatively elementary andshould be readable by anyone with an elementary calculus background.

This work is an outgrowth of the Precision Architecture Wide Word (PAWW) project at Hewlett-Packard Laboratories. Thearchitecture drew from prior experiences with very long instruction setarchitectures, particularly those at Cydrome and Multiflow, as well asPA-RISC (Precision Architecture - Reduced InstructionSet Computer). By the time I joined the project in 1992, much of thearchitecture had already been solidified. My architectural contributionsmainly dealt with floating point arithmetic, and I was also active inproducing a prototype compiler for Wide Word, which allowed many of thearchitectural ideas to be tested. PAWW later developed into IA-64.

One of my colleagues, Clemens Roothaan, had produced a library of elementaryfunction routines which exploited the software pipelining capabilities ofthe architecture. He was able to demonstrate routines which ran at speedsassociated with vector processors, but which did not sacrifice numericalaccuracy for performance. Over time, some of these algorithms werestrengthened to run faster, or produce even higher precision. We refer tothe software pipelined implementation as the vector library for theelementary functions.

My plan was to use the same algorithmic ideas to construct a very robustscalar elementary function library. My hope was that the fundamentalalgorithms could be implemented in the C language in such a manner that theywould yield closed subroutines, but would also be amenable to in-lining,after which they could then be software pipelined by the compiler.Eventually, Roothaan's handcrafted functions could be matched by thecompiler, which could also customize an elementary function to theparticular settings where it was invoked. This notion led to the in-lineassembly capability, which enables much finer control to be exercised overfloating point computation than is normally present in a compiler.

Eventually, I undertook to document these algorithms, indicating clearly themethods we had used, as well as the error characteristics of our algorithms.A fascinating by-product developed almost immediately: the act of writingclarified some of the fundamental processes that we were employing. New,faster algorithms were suggested by the text, and they replaced some of ourold techniques. This was especially true in the operations of division andsquare root, for which almost none of our 1992 algorithms survive in thistext. Logarithm also was markedly improved, and, as a by-product, theprecision of the power routine was improved. The trigonometric routines wereenhanced with "accurate A " argument reduction, and an improvedimplementation of the A and A addition formulas which preserveadditional precision.

This book describes a work in progress. Even now, new algorithms have cometo my attention from colleagues at Intel, and, as the greater programmingcommunity comes to use IA-64, I expect new, innovative developments toblossom.

Peter Markstein
February 2000
Woodside, CA

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020