{"title":"工作站网络上的分布式数据路径综合","authors":"M. E. Dalkiliç, V. Pitchumani","doi":"10.1109/GLSV.1994.289973","DOIUrl":null,"url":null,"abstract":"Presents a distributed data-path synthesis approach which taps into the vast and cheap computing power of the distributed computing environments. The synthesis program is based on a novel approach where all processors simultaneously generate optimal schedules and allocate data-paths for them using a simple but powerful set of binding algorithms. The experimental results show that the distributed synthesis approach is very effective for exploring the design space.<<ETX>>","PeriodicalId":330584,"journal":{"name":"Proceedings of 4th Great Lakes Symposium on VLSI","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed data-path synthesis on a network of workstations\",\"authors\":\"M. E. Dalkiliç, V. Pitchumani\",\"doi\":\"10.1109/GLSV.1994.289973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a distributed data-path synthesis approach which taps into the vast and cheap computing power of the distributed computing environments. The synthesis program is based on a novel approach where all processors simultaneously generate optimal schedules and allocate data-paths for them using a simple but powerful set of binding algorithms. The experimental results show that the distributed synthesis approach is very effective for exploring the design space.<<ETX>>\",\"PeriodicalId\":330584,\"journal\":{\"name\":\"Proceedings of 4th Great Lakes Symposium on VLSI\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 4th Great Lakes Symposium on VLSI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLSV.1994.289973\",\"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 of 4th Great Lakes Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLSV.1994.289973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed data-path synthesis on a network of workstations
Presents a distributed data-path synthesis approach which taps into the vast and cheap computing power of the distributed computing environments. The synthesis program is based on a novel approach where all processors simultaneously generate optimal schedules and allocate data-paths for them using a simple but powerful set of binding algorithms. The experimental results show that the distributed synthesis approach is very effective for exploring the design space.<>