{"title":"收缩程序的推导","authors":"Ladan Kazerouni, B. Rajan, R. Shyamasundar","doi":"10.1109/ICPP.1994.86","DOIUrl":null,"url":null,"abstract":"We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how efficient transformations/implementations of programs for different systolic architectures can be obtained through transformations such as projections and translations.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Derivation of Systolic Programs\",\"authors\":\"Ladan Kazerouni, B. Rajan, R. Shyamasundar\",\"doi\":\"10.1109/ICPP.1994.86\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how efficient transformations/implementations of programs for different systolic architectures can be obtained through transformations such as projections and translations.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.86\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how efficient transformations/implementations of programs for different systolic architectures can be obtained through transformations such as projections and translations.