工作站网络上的分布式数据路径综合

M. E. Dalkiliç, V. Pitchumani
{"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}
引用次数: 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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信