{"title":"收缩算法中的广播去除","authors":"Y. Wong, J. Delosme","doi":"10.1109/ARRAYS.1988.18080","DOIUrl":null,"url":null,"abstract":"A major difficulty with the automatic synthesis of systolic arrays is that many algorithms process data dependences that are not directly realizable in a systolic fashion. The authors consider one particular class of such data dependences, called data sharing or broadcast, in recurrence algorithms. They present a data routing scheme called propagation and show that all broadcasts can be systematically transformed into propagations.<<ETX>>","PeriodicalId":339807,"journal":{"name":"[1988] Proceedings. International Conference on Systolic Arrays","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Broadcast removal in systolic algorithms\",\"authors\":\"Y. Wong, J. Delosme\",\"doi\":\"10.1109/ARRAYS.1988.18080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A major difficulty with the automatic synthesis of systolic arrays is that many algorithms process data dependences that are not directly realizable in a systolic fashion. The authors consider one particular class of such data dependences, called data sharing or broadcast, in recurrence algorithms. They present a data routing scheme called propagation and show that all broadcasts can be systematically transformed into propagations.<<ETX>>\",\"PeriodicalId\":339807,\"journal\":{\"name\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARRAYS.1988.18080\",\"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.18080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A major difficulty with the automatic synthesis of systolic arrays is that many algorithms process data dependences that are not directly realizable in a systolic fashion. The authors consider one particular class of such data dependences, called data sharing or broadcast, in recurrence algorithms. They present a data routing scheme called propagation and show that all broadcasts can be systematically transformed into propagations.<>