{"title":"并行语言,向量化和编译器","authors":"Michael Weiss","doi":"10.1109/CMPSAC.1989.65068","DOIUrl":null,"url":null,"abstract":"Ideas developed for vectorization can be applied to the problems encountered in compiling parallel languages. The issues that arise with data allocation and strip mining for SIMD architectures are discussed. Two simple examples illustrate the interplay between strip mining and interprocessor communication.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Parallel languages, vectorization, and compilers\",\"authors\":\"Michael Weiss\",\"doi\":\"10.1109/CMPSAC.1989.65068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ideas developed for vectorization can be applied to the problems encountered in compiling parallel languages. The issues that arise with data allocation and strip mining for SIMD architectures are discussed. Two simple examples illustrate the interplay between strip mining and interprocessor communication.<<ETX>>\",\"PeriodicalId\":339677,\"journal\":{\"name\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1989.65068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1989.65068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ideas developed for vectorization can be applied to the problems encountered in compiling parallel languages. The issues that arise with data allocation and strip mining for SIMD architectures are discussed. Two simple examples illustrate the interplay between strip mining and interprocessor communication.<>