收缩阵列自动设计的映射策略

[1988] Proceedings. International Conference on Systolic Arrays Pub Date : 1988-05-25 DOI:10.1109/ARRAYS.1988.18069

C. Ko, O. Wing

{"title":"收缩阵列自动设计的映射策略","authors":"C. Ko, O. Wing","doi":"10.1109/ARRAYS.1988.18069","DOIUrl":null,"url":null,"abstract":"A mapping strategy for automatic design of systolic arrays is presented. Algorithms are specified in terms of data dependency and identity, and implementations are specified in terms of data propagation and sequence behavior. By establishing a relation between data propagation and sequence, an optimal mapping strategy is formulated as a problem of finding an integer solution of a set of linear equations. This approach provides a uniform framework to design a variety of systolic arrays. An automatic design program and some design examples are presented.<<ETX>>","PeriodicalId":339807,"journal":{"name":"[1988] Proceedings. International Conference on Systolic Arrays","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Mapping strategy for automatic design of systolic arrays\",\"authors\":\"C. Ko, O. Wing\",\"doi\":\"10.1109/ARRAYS.1988.18069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A mapping strategy for automatic design of systolic arrays is presented. Algorithms are specified in terms of data dependency and identity, and implementations are specified in terms of data propagation and sequence behavior. By establishing a relation between data propagation and sequence, an optimal mapping strategy is formulated as a problem of finding an integer solution of a set of linear equations. This approach provides a uniform framework to design a variety of systolic arrays. An automatic design program and some design examples are presented.<<ETX>>\",\"PeriodicalId\":339807,\"journal\":{\"name\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARRAYS.1988.18069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. International Conference on Systolic Arrays","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARRAYS.1988.18069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

提出了一种自动设计收缩阵列的映射策略。算法是根据数据依赖和身份来指定的，实现是根据数据传播和序列行为来指定的。通过建立数据传播与序列之间的关系，将最优映射策略表述为求解一组线性方程的整数解问题。这种方法提供了一个统一的框架来设计各种收缩阵列。给出了一个自动设计程序和一些设计实例。

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

查看原文本刊更多论文

Mapping strategy for automatic design of systolic arrays

A mapping strategy for automatic design of systolic arrays is presented. Algorithms are specified in terms of data dependency and identity, and implementations are specified in terms of data propagation and sequence behavior. By establishing a relation between data propagation and sequence, an optimal mapping strategy is formulated as a problem of finding an integer solution of a set of linear equations. This approach provides a uniform framework to design a variety of systolic arrays. An automatic design program and some design examples are presented.<>

求助全文

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

来源期刊

[1988] Proceedings. International Conference on Systolic Arrays

自引率

0.00%

发文量