{"title":"集群VLIW体系结构的回溯优化DDG定向调度算法","authors":"Yang Xu, Tang Zhizhong, Guo Deyuan, H. Hu","doi":"10.1109/ICFCSA.2011.25","DOIUrl":null,"url":null,"abstract":"This work presents an instruction schedule approach to improve the performance of clustered VLIW architectures. The proposed scheme is based on a preliminary scheduling phase directed though analyzing of Data Dependence Graph (DDG) and a backtracking optimization scheduling phase bringing further improvement by balancing the workloads through clusters and minimizing the penalties of inter-cluster data communications simultaneously. We have implemented and evaluated the proposed scheme with UTDSP benchmarks. Results show a significant speed-up in performance. The speedup can up to 38.58%, with average speedup ranging from 23.91% (2-Clusters) to up to 26.78% (4-Clusters).","PeriodicalId":141108,"journal":{"name":"2011 International Conference on Future Computer Sciences and Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Backtracking Optimized DDG Directed Scheduling Algorithm for Clustered VLIW Architectures\",\"authors\":\"Yang Xu, Tang Zhizhong, Guo Deyuan, H. Hu\",\"doi\":\"10.1109/ICFCSA.2011.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents an instruction schedule approach to improve the performance of clustered VLIW architectures. The proposed scheme is based on a preliminary scheduling phase directed though analyzing of Data Dependence Graph (DDG) and a backtracking optimization scheduling phase bringing further improvement by balancing the workloads through clusters and minimizing the penalties of inter-cluster data communications simultaneously. We have implemented and evaluated the proposed scheme with UTDSP benchmarks. Results show a significant speed-up in performance. The speedup can up to 38.58%, with average speedup ranging from 23.91% (2-Clusters) to up to 26.78% (4-Clusters).\",\"PeriodicalId\":141108,\"journal\":{\"name\":\"2011 International Conference on Future Computer Sciences and Application\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Future Computer Sciences and Application\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFCSA.2011.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Future Computer Sciences and Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFCSA.2011.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Backtracking Optimized DDG Directed Scheduling Algorithm for Clustered VLIW Architectures
This work presents an instruction schedule approach to improve the performance of clustered VLIW architectures. The proposed scheme is based on a preliminary scheduling phase directed though analyzing of Data Dependence Graph (DDG) and a backtracking optimization scheduling phase bringing further improvement by balancing the workloads through clusters and minimizing the penalties of inter-cluster data communications simultaneously. We have implemented and evaluated the proposed scheme with UTDSP benchmarks. Results show a significant speed-up in performance. The speedup can up to 38.58%, with average speedup ranging from 23.91% (2-Clusters) to up to 26.78% (4-Clusters).