{"title":"优化浮点算术通过后加法移位概率","authors":"J. Field","doi":"10.1145/1476793.1476885","DOIUrl":null,"url":null,"abstract":"In many computers floating point arithmetic operations are performed by subprograms: software packages in the case of most small computers, and micro-programmed read-only memories in some larger systems. In such a subprogram there are normally several free choices as to which set of conditions gets a speed advantage. If this advantage is given to the most probable case then there will be an increase in system performance with no increase in cost.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"3235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimizing floating point arithmetic via post addition shift probabilities\",\"authors\":\"J. Field\",\"doi\":\"10.1145/1476793.1476885\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many computers floating point arithmetic operations are performed by subprograms: software packages in the case of most small computers, and micro-programmed read-only memories in some larger systems. In such a subprogram there are normally several free choices as to which set of conditions gets a speed advantage. If this advantage is given to the most probable case then there will be an increase in system performance with no increase in cost.\",\"PeriodicalId\":326625,\"journal\":{\"name\":\"AFIPS '69 (Spring)\",\"volume\":\"3235 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1899-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '69 (Spring)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1476793.1476885\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '69 (Spring)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1476793.1476885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimizing floating point arithmetic via post addition shift probabilities
In many computers floating point arithmetic operations are performed by subprograms: software packages in the case of most small computers, and micro-programmed read-only memories in some larger systems. In such a subprogram there are normally several free choices as to which set of conditions gets a speed advantage. If this advantage is given to the most probable case then there will be an increase in system performance with no increase in cost.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
