关于函数在线计算的一些结果

Proceedings of 9th Symposium on Computer Arithmetic Pub Date : 1989-09-06 DOI:10.1109/ARITH.1989.72816

J. Duprat, Yvan Herreros, J. Muller

{"title":"关于函数在线计算的一些结果","authors":"J. Duprat, Yvan Herreros, J. Muller","doi":"10.1109/ARITH.1989.72816","DOIUrl":null,"url":null,"abstract":"Complexity results that allow the exact determination or bounding of the online delay of most common arithmetic and elementary functions are presented. These results show that many classical online operators presented in the literature are optimal in delay (but not necessarily in period). The authors propose a way to conserve, for large numbers of manipulations, the main advantage of online arithmetic (the capability of digit-level pipelining) by presenting sparse online arithmetic.<<ETX>>","PeriodicalId":305909,"journal":{"name":"Proceedings of 9th Symposium on Computer Arithmetic","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Some results about on-line computation of functions\",\"authors\":\"J. Duprat, Yvan Herreros, J. Muller\",\"doi\":\"10.1109/ARITH.1989.72816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Complexity results that allow the exact determination or bounding of the online delay of most common arithmetic and elementary functions are presented. These results show that many classical online operators presented in the literature are optimal in delay (but not necessarily in period). The authors propose a way to conserve, for large numbers of manipulations, the main advantage of online arithmetic (the capability of digit-level pipelining) by presenting sparse online arithmetic.<<ETX>>\",\"PeriodicalId\":305909,\"journal\":{\"name\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1989.72816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 9th Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1989.72816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

给出了最常见的算术函数和初等函数在线延迟的精确确定或边界的复杂度结果。这些结果表明，文献中提出的许多经典在线算子在延迟(但不一定是周期)方面是最优的。作者提出了一种方法，通过提出稀疏在线算法来保留在线算法的主要优势(数字级流水线的能力)，用于大量的操作。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some results about on-line computation of functions

Complexity results that allow the exact determination or bounding of the online delay of most common arithmetic and elementary functions are presented. These results show that many classical online operators presented in the literature are optimal in delay (but not necessarily in period). The authors propose a way to conserve, for large numbers of manipulations, the main advantage of online arithmetic (the capability of digit-level pipelining) by presenting sparse online arithmetic.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 9th Symposium on Computer Arithmetic

CiteScore

2.40

自引率

0.00%

发文量