延长循环收缩:一种最优循环变换

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-12-01 DOI:10.1109/SPDP.1992.242743

C. Gong

{"title":"延长循环收缩:一种最优循环变换","authors":"C. Gong","doi":"10.1109/SPDP.1992.242743","DOIUrl":null,"url":null,"abstract":"The author discusses a novel loop transformation technique, extended cycle shrinking (ECS), that is based on cycle shrinking (CS). While CS is a very powerful technique in dealing with dependences involving a cycle, it fails to generate an optimal program in many cases. The ECS can generate optimal programs for a class of loops called regular cycle dependence loops.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Extended cycle shrinking: an optimal loop transformation\",\"authors\":\"C. Gong\",\"doi\":\"10.1109/SPDP.1992.242743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author discusses a novel loop transformation technique, extended cycle shrinking (ECS), that is based on cycle shrinking (CS). While CS is a very powerful technique in dealing with dependences involving a cycle, it fails to generate an optimal program in many cases. The ECS can generate optimal programs for a class of loops called regular cycle dependence loops.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPDP.1992.242743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在循环收缩技术的基础上，提出了一种新的循环变换技术——扩展循环收缩技术。虽然CS在处理涉及循环的依赖项方面是一种非常强大的技术，但在许多情况下，它无法生成最优程序。ECS可以为一类称为正则周期依赖循环的循环生成最优程序。

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

查看原文

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

本刊更多论文

Extended cycle shrinking: an optimal loop transformation

The author discusses a novel loop transformation technique, extended cycle shrinking (ECS), that is based on cycle shrinking (CS). While CS is a very powerful technique in dealing with dependences involving a cycle, it fails to generate an optimal program in many cases. The ECS can generate optimal programs for a class of loops called regular cycle dependence loops.<>

求助全文

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

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量

期刊最新文献

On uniformization of affine dependence algorithms On embedding ternary trees into Boolean hypercubes A divide and conquer approach to shortest paths in planar layered digraphs Advanced software pipelining and the program dependence graph A fast sort using parallelism within memory