Read more
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.
List 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.
Summary
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.
