表达式树中的最优链

SIGPLAN Conferences and Workshops Pub Date : 1986-07-01 DOI:10.1145/12276.13311

D. Bernstein, H. Boral, R. Pinter

{"title":"表达式树中的最优链","authors":"D. Bernstein, H. Boral, R. Pinter","doi":"10.1145/12276.13311","DOIUrl":null,"url":null,"abstract":"Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. We show how to optimally use this feature to compute (vector) expression trees, in the context of automatic code-generation. We present a linear-time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of registers.","PeriodicalId":414056,"journal":{"name":"SIGPLAN Conferences and Workshops","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Optimal chaining in expression trees\",\"authors\":\"D. Bernstein, H. Boral, R. Pinter\",\"doi\":\"10.1145/12276.13311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. We show how to optimally use this feature to compute (vector) expression trees, in the context of automatic code-generation. We present a linear-time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of registers.\",\"PeriodicalId\":414056,\"journal\":{\"name\":\"SIGPLAN Conferences and Workshops\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGPLAN Conferences and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/12276.13311\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGPLAN Conferences and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/12276.13311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

链接是在类似Cray-1的机器上管道化两个或更多向量指令的能力。我们将展示如何在自动代码生成上下文中最佳地使用此特性来计算(向量)表达式树。我们提出了一种线性时间调度算法，用于寻找具有有限寄存器数的机器的最优求值顺序。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Optimal chaining in expression trees

Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. We show how to optimally use this feature to compute (vector) expression trees, in the context of automatic code-generation. We present a linear-time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of registers.

求助全文

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

来源期刊

SIGPLAN Conferences and Workshops

自引率

0.00%

发文量

期刊最新文献

A practical method for syntactic error diagnosis and recovery The CIMS PL/I compiler A Fortran 77 interpreter for mutation analysis Cint: a RISC interpreter for the C programming language The Illinois functional programming interpreter