{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:30:08Z","timestamp":1763724608691,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031097782"},{"type":"electronic","value":"9783031097799"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09779-9_7","type":"book-chapter","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:06:54Z","timestamp":1657717614000},"page":"100-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Universal: Reliable, Reproducible, and\u00a0Energy-Efficient Numerics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0194-951X","authenticated-orcid":false,"given":"E. Theodore L.","family":"Omtzigt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2628-1651","authenticated-orcid":false,"given":"James","family":"Quinlan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,14]]},"reference":[{"key":"7_CR1","unstructured":"Universal number library (2017). https:\/\/github.com\/stillwater-sc\/universal"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"A2834","DOI":"10.1137\/17M1122918","volume":"39","author":"E Carson","year":"2017","unstructured":"Carson, E., Higham, N.J.: A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems. SIAM J. Sci. Comput. 39(6), A2834\u2013A2856 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"A817","DOI":"10.1137\/17M1140819","volume":"40","author":"E Carson","year":"2018","unstructured":"Carson, E., Higham, N.J.: Accelerating the solution of linear systems by iterative refinement in three precisions. SIAM J. Sci. Comput. 40(2), A817\u2013A847 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535645.001.0001","volume-title":"Reliable Numerical Computation","author":"MG Cox","year":"1990","unstructured":"Cox, M.G., Hammarling, S.: Reliable Numerical Computation. Clarendon Press, Oxford (1990)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. (TOMS) 33(2), 13-es (2007)","DOI":"10.1145\/1236463.1236468"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Gottschling, P., Wise, D.S., Adams, M.D.: Representation-transparent matrix algorithms with scalable performance. In: Proceedings of the 21st Annual International Conference on Supercomputing, pp. 116\u2013125 (2007)","DOI":"10.1145\/1274971.1274989"},{"key":"7_CR7","unstructured":"Granlund, T.: GNU MP. The GNU Multiple Precision Arithmetic Library 2(2) (1996)"},{"key":"7_CR8","unstructured":"Gupta, S., Agrawal, A., Gopalakrishnan, K., Narayanan, P.: Deep learning with limited numerical precision. In: International Conference on Machine Learning, pp. 1737\u20131746. PMLR (2015)"},{"issue":"2","key":"7_CR9","first-page":"71","volume":"4","author":"JL Gustafson","year":"2017","unstructured":"Gustafson, J.L., Yonemoto, I.T.: Beating floating point at its own game: posit arithmetic. Supercomput. Frontiers Innovations 4(2), 71\u201386 (2017)","journal-title":"Supercomput. Frontiers Innovations"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Haidar, A., Tomov, S., Dongarra, J., Higham, N.J.: Harnessing GPU tensor cores for fast FP16 arithmetic to speed up mixed-precision iterative refinement solvers. In: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 603\u2013613. IEEE (2018)","DOI":"10.1109\/SC.2018.00050"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Haidar, A., Wu, P., Tomov, S., Dongarra, J.: Investigating half precision arithmetic to accelerate dense linear system solvers. In: Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, pp. 1\u20138 (2017)","DOI":"10.1145\/3148226.3148237"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"A2536","DOI":"10.1137\/18M1229511","volume":"41","author":"NJ Higham","year":"2019","unstructured":"Higham, N.J., Pranesh, S., Zounon, M.: Squeezing a matrix into half precision, with an application to solving linear systems. SIAM J. Sci. Comput. 41(4), A2536\u2013A2551 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR13","unstructured":"Hittinger, J., et al.: Variable precision computing. Technical report, Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States) (2019)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Horowitz, M.: 1.1 computing\u2019s energy problem (and what we can do about it). In: 2014 IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC), pp. 10\u201314. IEEE (2014)","DOI":"10.1109\/ISSCC.2014.6757323"},{"key":"7_CR15","unstructured":"Intel Corporation: BFLOAT16 - Hardware Numerics Definition (2018). https:\/\/www.intel.com\/content\/dam\/develop\/external\/us\/en\/documents\/bf16-hardware-numerics-definition-white-paper.pdf"},{"key":"7_CR16","unstructured":"Jouppi, N.P., et al.: In-Datacenter performance analysis of a tensor processing unit. In: Proceedings of the 44th Annual International Symposium on Computer Architecture, pp. 1\u201312 (2017)"},{"key":"7_CR17","unstructured":"Kharya, P.: TensorFloat-32 in the a100 GPU accelerates AI training HPC up to 20x. NVIDIA Corporation, Technical report (2020). https:\/\/blogs.nvidia.com\/blog\/2020\/05\/14\/tensorfloat-32-precision-format\/"},{"key":"7_CR18","unstructured":"Lloyd, G.S., Lindstrom, P.G.: ZFP hardware implementation. Technical report, Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States) (2020)"},{"key":"7_CR19","unstructured":"Maddock, J., Kormanyos, C., et al.: Boost multiprecision (2018)"},{"key":"7_CR20","unstructured":"McCleeary, R.: Lazy exact real arithmetic using floating point operations (2019)"},{"issue":"9","key":"7_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/MCOM.2017.1600400","volume":"55","author":"AF Molisch","year":"2017","unstructured":"Molisch, A.F., et al.: Hybrid beamforming for massive MIMO: a survey. IEEE Commun. Mag. 55(9), 134\u2013141 (2017)","journal-title":"IEEE Commun. Mag."},{"issue":"7","key":"7_CR22","doi-asserted-by":"publisher","first-page":"4316","DOI":"10.1109\/TITS.2020.3032227","volume":"22","author":"K Muhammad","year":"2020","unstructured":"Muhammad, K., Ullah, A., Lloret, J., Del Ser, J., de Albuquerque, V.H.C.: Deep learning for safe autonomous driving: current challenges and future directions. IEEE Trans. Intell. Transp. Syst. 22(7), 4316\u20134336 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"7_CR23","unstructured":"Omtzigt, E.T.L., Gottschling, P., Seligman, M., Zorn, W.: Universal numbers library: design and implementation of a high-performance reproducible number systems library. arXiv:2012.11011 (2020). https:\/\/arxiv.org\/abs\/2012.11011"},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1991.145549","volume-title":"Algorithms for Arbitrary Precision Floating Point Arithmetic","author":"DM Priest","year":"1991","unstructured":"Priest, D.M.: Algorithms for Arbitrary Precision Floating Point Arithmetic. University of California, Berkeley (1991)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-49372-7_6","volume-title":"Computing in Object-Oriented Parallel Environments","author":"JG Siek","year":"1998","unstructured":"Siek, J.G., Lumsdaine, A.: The matrix template library: a generic programming approach to high performance numerical linear algebra. In: Caromel, D., Oldehoeft, R.R., Tholburn, M. (eds.) ISCOPE 1998. LNCS, vol. 1505, pp. 59\u201370. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49372-7_6"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-49255-0_152","volume-title":"Object-Oriented Technology: ECOOP\u201998 Workshop Reader","author":"JG Siek","year":"1998","unstructured":"Siek, J.G., Lumsdaine, A.: The matrix template library: a unifying framework for numerical linear algebra. In: Demeyer, S., Bosch, J. (eds.) ECOOP 1998. LNCS, vol. 1543, pp. 466\u2013467. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49255-0_152"},{"key":"7_CR27","unstructured":"Dally, W.J., et al.: Neural network accelerator using logarithmic-based arithmetic (2021). https:\/\/uspto.report\/patent\/app\/20210056397"}],"container-title":["Lecture Notes in Computer Science","Next Generation Arithmetic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09779-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:29:36Z","timestamp":1700836176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09779-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031097782","9783031097799"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09779-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoNGA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Next Generation Arithmetic","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"conga2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sc-asia.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}