S. Bhansali, J. Hagemeister, C. Raghavendra, H. Sivaraman
{"title":"通过算法级转换并行化顺序程序","authors":"S. Bhansali, J. Hagemeister, C. Raghavendra, H. Sivaraman","doi":"10.1109/WPC.1994.341257","DOIUrl":null,"url":null,"abstract":"We address a significant problem in parallel processing research, namely, how to port existing sequential programs to run efficiently on parallel machines (the \"dusty deck\" problem). Conventional domain-independent techniques are inadequate for solving this problem because they miss significant opportunities of parallelism. We present experimental evidence to support our claim, analyze why current techniques are inadequate, and propose a knowledge-based reverse engineering approach for attacking this problem.<<ETX>>","PeriodicalId":308971,"journal":{"name":"Proceedings 1994 IEEE 3rd Workshop on Program Comprehension- WPC '94","volume":"157 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Parallelizing sequential programs by algorithm-level transformations\",\"authors\":\"S. Bhansali, J. Hagemeister, C. Raghavendra, H. Sivaraman\",\"doi\":\"10.1109/WPC.1994.341257\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address a significant problem in parallel processing research, namely, how to port existing sequential programs to run efficiently on parallel machines (the \\\"dusty deck\\\" problem). Conventional domain-independent techniques are inadequate for solving this problem because they miss significant opportunities of parallelism. We present experimental evidence to support our claim, analyze why current techniques are inadequate, and propose a knowledge-based reverse engineering approach for attacking this problem.<<ETX>>\",\"PeriodicalId\":308971,\"journal\":{\"name\":\"Proceedings 1994 IEEE 3rd Workshop on Program Comprehension- WPC '94\",\"volume\":\"157 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1994 IEEE 3rd Workshop on Program Comprehension- WPC '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPC.1994.341257\",\"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 1994 IEEE 3rd Workshop on Program Comprehension- WPC '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPC.1994.341257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallelizing sequential programs by algorithm-level transformations
We address a significant problem in parallel processing research, namely, how to port existing sequential programs to run efficiently on parallel machines (the "dusty deck" problem). Conventional domain-independent techniques are inadequate for solving this problem because they miss significant opportunities of parallelism. We present experimental evidence to support our claim, analyze why current techniques are inadequate, and propose a knowledge-based reverse engineering approach for attacking this problem.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
