六种计算机体系结构上FORTRAN赋值语句所需代码空间和执行时间的比较

MICRO 11 Pub Date : 1978-11-19 DOI:10.1145/1014198.804308

Richard A. Belgard, V. Schneider

{"title":"六种计算机体系结构上FORTRAN赋值语句所需代码空间和执行时间的比较","authors":"Richard A. Belgard, V. Schneider","doi":"10.1145/1014198.804308","DOIUrl":null,"url":null,"abstract":"A method is presented for deriving lower and upper bounds for memory space and execution time of compiled FORTRAN assignment statements. Formulas, in terms of variable references, are presented. The method is applied to six hypothetical computer architectures, standardized to eliminate variations resulting from addressing strategies and varying opcode lengths. The results are presented in tabular form.","PeriodicalId":336739,"journal":{"name":"MICRO 11","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A comparison of the code space and execution time required for FORTRAN assignment statements on six computer architectures\",\"authors\":\"Richard A. Belgard, V. Schneider\",\"doi\":\"10.1145/1014198.804308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method is presented for deriving lower and upper bounds for memory space and execution time of compiled FORTRAN assignment statements. Formulas, in terms of variable references, are presented. The method is applied to six hypothetical computer architectures, standardized to eliminate variations resulting from addressing strategies and varying opcode lengths. The results are presented in tabular form.\",\"PeriodicalId\":336739,\"journal\":{\"name\":\"MICRO 11\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MICRO 11\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1014198.804308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MICRO 11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1014198.804308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种求FORTRAN赋值语句的内存空间和执行时间的上界和下界的方法。给出了变量引用的公式。该方法应用于六种假设的计算机体系结构，标准化以消除寻址策略和不同操作码长度导致的变化。结果以表格形式呈现。

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

查看原文本刊更多论文

A comparison of the code space and execution time required for FORTRAN assignment statements on six computer architectures

A method is presented for deriving lower and upper bounds for memory space and execution time of compiled FORTRAN assignment statements. Formulas, in terms of variable references, are presented. The method is applied to six hypothetical computer architectures, standardized to eliminate variations resulting from addressing strategies and varying opcode lengths. The results are presented in tabular form.

求助全文

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

来源期刊

MICRO 11

自引率

0.00%

发文量