在功能编程标记令牌架构中编译器选择的操作符粒度

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI:10.1109/ISPAN.1994.367182

G. Jennings

{"title":"在功能编程标记令牌架构中编译器选择的操作符粒度","authors":"G. Jennings","doi":"10.1109/ISPAN.1994.367182","DOIUrl":null,"url":null,"abstract":"In a recently proposed parallel execution model, operators as well as data operands are dynamically generated at execution time, and enter a special matching store which must accommodate either operator or operands arriving first in time. Here, we extend this execution model to permit the compiler to adjust the granularity of scheduled units emerging from the matching store, a problem which is complicated by the increased dynamics of the proposed execution model. Compiler output code is described in detail. Effects of different fragmentations on program speed and resource requirements are examined, using architectural simulations for a number of application programs compiled using different fragmentation methods. Architectural implications are discussed.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Compiler-chosen operator granularity in a functionally-programmed tagged token architecture\",\"authors\":\"G. Jennings\",\"doi\":\"10.1109/ISPAN.1994.367182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a recently proposed parallel execution model, operators as well as data operands are dynamically generated at execution time, and enter a special matching store which must accommodate either operator or operands arriving first in time. Here, we extend this execution model to permit the compiler to adjust the granularity of scheduled units emerging from the matching store, a problem which is complicated by the increased dynamics of the proposed execution model. Compiler output code is described in detail. Effects of different fragmentations on program speed and resource requirements are examined, using architectural simulations for a number of application programs compiled using different fragmentation methods. Architectural implications are discussed.<<ETX>>\",\"PeriodicalId\":142405,\"journal\":{\"name\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.1994.367182\",\"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 the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在最近提出的并行执行模型中，操作符和数据操作数在执行时动态生成，并进入一个特殊的匹配存储，该存储必须容纳操作符或操作数中的一个。在这里，我们扩展了这个执行模型，以允许编译器调整从匹配存储中出现的计划单元的粒度，这个问题由于所建议的执行模型的动态增加而变得复杂。详细描述了编译器输出代码。通过对使用不同碎片方法编译的许多应用程序进行体系结构模拟，研究了不同碎片对程序速度和资源需求的影响。讨论了架构含义。

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

查看原文本刊更多论文

Compiler-chosen operator granularity in a functionally-programmed tagged token architecture

In a recently proposed parallel execution model, operators as well as data operands are dynamically generated at execution time, and enter a special matching store which must accommodate either operator or operands arriving first in time. Here, we extend this execution model to permit the compiler to adjust the granularity of scheduled units emerging from the matching store, a problem which is complicated by the increased dynamics of the proposed execution model. Compiler output code is described in detail. Effects of different fragmentations on program speed and resource requirements are examined, using architectural simulations for a number of application programs compiled using different fragmentation methods. Architectural implications are discussed.<>

求助全文

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

来源期刊

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

自引率

0.00%

发文量