{"title":"在异构信号处理体系结构上执行划分信号流图","authors":"C. De Castro, S. Yalamanchili","doi":"10.1109/WHP.1992.664389","DOIUrl":null,"url":null,"abstract":"We present a technique for partitioning signal processing algorithms represented as signal flow graphs for execution on a hierarchically structured, heterogeneous multiprocessor architecture. We propose the use of an optimization algorithm with an uduptive seurch schedule to find good partitions. We find that such an approach consistently determines optimal partitions for several example signal flow graphs. The paper discusses the present form of the algorithm, and results of an experimental evaluation.","PeriodicalId":201815,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing","volume":"29 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Partitioning Signal Flow Graphs for Execution on Heterogeneous Signal Processing Architectures\",\"authors\":\"C. De Castro, S. Yalamanchili\",\"doi\":\"10.1109/WHP.1992.664389\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a technique for partitioning signal processing algorithms represented as signal flow graphs for execution on a hierarchically structured, heterogeneous multiprocessor architecture. We propose the use of an optimization algorithm with an uduptive seurch schedule to find good partitions. We find that such an approach consistently determines optimal partitions for several example signal flow graphs. The paper discusses the present form of the algorithm, and results of an experimental evaluation.\",\"PeriodicalId\":201815,\"journal\":{\"name\":\"Proceedings. Workshop on Heterogeneous Processing\",\"volume\":\"29 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Workshop on Heterogeneous Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WHP.1992.664389\",\"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. Workshop on Heterogeneous Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WHP.1992.664389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partitioning Signal Flow Graphs for Execution on Heterogeneous Signal Processing Architectures
We present a technique for partitioning signal processing algorithms represented as signal flow graphs for execution on a hierarchically structured, heterogeneous multiprocessor architecture. We propose the use of an optimization algorithm with an uduptive seurch schedule to find good partitions. We find that such an approach consistently determines optimal partitions for several example signal flow graphs. The paper discusses the present form of the algorithm, and results of an experimental evaluation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
