Every Bit Counts
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)
Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)

Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

Written by one of the foremost experts in high-performance computing and the inventor of Gustafson’s law, Every Bit Counts: Posit Computing explains the foundations of a new way for computers to calculate that saves time, storage, energy, and power by packing more information into every bit than do legacy approaches. Both the AI and HPC communities are increasingly using the posit approach that Gustafson introduced in 2017, which may be the future of technical computing. What may seem like a dry subject is made engaging by including the human and historical side of the struggle to represent numbers on machines. The book is richly illustrated in full color throughout, with every effort made to make the material as clear and accessible as possible, and even humorous. Starting with the simplest form of the idea, the chapters gradually add concepts according to stated mathematical and engineering design principles, building a robust tool kit for creating application-specific number systems. There is also a thorough explanation of the Posit™ Standard (2022), with motivations and examples that expand on that terse 12-page document.

Table of Contents:
Preface Acknowledgements How to Read this Book 1. The Posit Number Format 2. Inaccuracy Done Right 3. More Power! 4. How We Got Into This Mess 5. The Posit Standard, Annotated 6. Preaching About the Quire 7. A Bridge to Sane Floats 8. Logarithmic Systems, The Musical 9. The Fastest Arithmetic Ever? 10. The Minefield Method 11. Matrix Multiply, Visualized 12. Linear Solvers that Suck Less 13. The Future of Posit Computing Glossary Answers to Exercises Appendix A: Posit Code Listings Appendix B: Float Code Listings Appendix C: The hypot Function Appendix D: L Table for 8-Bit Posits Appendix E: Linear Solver Tests Appendix F: Linear Solvers Appendix G: Takum Format Index

About the Author :
Prof. John L. Gustafson is a pioneer in high-performance computing, known for a breakthrough in parallel processing (Gustafson’s law) for which he received the inaugural Gordon Bell Prize. He is a former Director at Intel Labs and a former Senior Fellow and Chief Product Architect at AMD. He now leads efforts to replace legacy computer arithmetic with high-efficiency next-generation approaches.

Review :
“John Gustafson is a masterful storyteller. The Every Bit Counts book takes on a seemingly dull topic – representation of numbers in computers, and makes it fascinating. Amusing at times, clear and pointed, with examples and illustrations, Gustafson critiques the state of the art and sheds light on its flaws, while showing the reader how we got here. But the real beauty of the exposé is the proposed alternative. Full of fresh ideas, new to anyone outside the ‘numbers standard’ community, the author presents a new and superior solution that revolutionizes the stagnant state of how our computers do arithmetic. Not an academic exercise, The Posit Standard is gaining acceptance in the industry. A must-read for anyone interested in how we compute for HPC and AI.” -- David Barkai, Author of Unmatched: 50 Years of Supercomputing “This book is a landmark work and breaks ground in the critical area of the future numerics of computing. Of greatest importance is that it finally fully exposes the gross limitations of conventional IEEE 754 floating point which reflects the ad hoc nature of its creation from its beginning to its current realization. If nothing else were to be derived from this work, burying 754 would be a major accomplishment. Gustafson’s contribution will stand for time without end or until something derived from unums and posits etc. are fully embraced and assumed by all practitioners without further thought. A critical aspect of the 13 chapters is the many areas yet to be fully explored in different regimes of application as repeatedly discussed by the author. It is pleasing to note the many credits proscribed to the many contributors over the years that have been cited by John throughout the work. This book will become required reading by the thousands of students and engineers who will derive foundational benefit for future computing methods based on this book. It makes a rare first-order contribution to the expansive nature of the field.” -- Thomas Sterling, Ph.D, Senior Research Scientist at Texas Advanced Computing Center “In his new book Every Bit Counts: Posit Computing, John Gustafson offers a radical re-examination of the foundations of computer arithmetic over the finite-precision real numbers. He defines an entirely new number system called posits as an alternative to traditional floating point numbers. In an expository tour-de-force he explains the many problems with floats, and then shows how posits have much better formal properties while achieving higher precision in most calculations than floats can when using the same number of bits. Pedagogically the book is brilliant. While the ideas are very sophisticated even for professional computer scientists, anyone with a college sophomore-level background in computing can grasp the key points, aided by the many beautifully rendered, colorful illustrations on almost every page. To learn about the future of computer arithmetic over real numbers, read this book. It is destined to be a classic.” ---David Jefferson, Lawrence Livermore National Laboratory (retired)


Best Sellers


Product Details
  • ISBN-13: 9781032738062
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Chapman & Hall/CRC
  • Height: 254 mm
  • No of Pages: 442
  • Sub Title: Posit Computing
  • Width: 178 mm
  • ISBN-10: 1032738065
  • Publisher Date: 29 Nov 2024
  • Binding: Hardback
  • Language: English
  • Series Title: Chapman & Hall/CRC Computational Science
  • Weight: 1100 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)
Taylor & Francis Ltd -
Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Every Bit Counts: Posit Computing(Chapman & Hall/CRC Computational Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!