发布求助
文献互助 智能选刊 最新文献

1994 International Conference on Parallel Processing Vol. 3最新文献

筛选
英文 中文
An Efficient Parallel Algorithm for Vector Quantizer Design 矢量量化器设计的一种高效并行算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.52
Jianhua Lin Jianhua Lin
{"title":"An Efficient Parallel Algorithm for Vector Quantizer Design","authors":"Jianhua Lin Jianhua Lin","doi":"10.1109/ICPP.1994.52","DOIUrl":"https://doi.org/10.1109/ICPP.1994.52","url":null,"abstract":"Vector quantization is a technique used extensively and successfully to compress digitized data such as speech and images. The design of a vector quantizer is very computationally intensive. Parallel algorithms based on various architectures have been proposed for related applications in clustering. These algorithms are in general not practical for the vector quantization problem because of the magnitude of the parameters involved. We present a parallel SIMD algorithm which can run efficiently on parallel machines of variable sizes. The speedup and efficiency of the algorithms are high across a wide range of input parameters.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115020988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Dimension-Exchange-Based Load Balancing on Injured Hypercubes 基于维度交换的损伤超立方体负载均衡
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.90
Jie Wu Jie Wu
{"title":"Dimension-Exchange-Based Load Balancing on Injured Hypercubes","authors":"Jie Wu Jie Wu","doi":"10.1109/ICPP.1994.90","DOIUrl":"https://doi.org/10.1109/ICPP.1994.90","url":null,"abstract":"We study a global load balancing scheme on hypercubes with faulty links based on the dimension exchange scheme, where each node exchanges workloads with its neighbors along selected dimensions in such a way that their loads become equal. An algorithm that can tolerate n-1 faulty links is first presented and it can be extended to connected hypercubes with up to 2n - 3 faulty links. Comparisons between the proposed scheme with the conventional dimension-exchange-based scheme are also presented. Simulation results show that very little overhead is introduced in our scheme.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116758869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A Fault-Tolerant Routing Algorithm in Hypercubes 超立方体中的容错路由算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.25
Youran Lan Youran Lan
{"title":"A Fault-Tolerant Routing Algorithm in Hypercubes","authors":"Youran Lan Youran Lan","doi":"10.1109/ICPP.1994.25","DOIUrl":"https://doi.org/10.1109/ICPP.1994.25","url":null,"abstract":"Fault-tolerant communication mechanism for multicomputer systems is an important feature to reliability-critical applications. In this paper, we will present a fault-tolerant routing algorithm that has a better performance than a previous work in the sense that it requires less message overhead and the message header needs to be updated at fewer intermediate nodes. A comparison between the algorithms and a previous work is given.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Speedy Task Migration in Hypercube Systems Hypercube系统中的快速任务迁移
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.184
Hsing-Lung Chen Hsing-Lung Chen, Nian-Feng Tzeng Nian-Feng Tzeng
{"title":"Speedy Task Migration in Hypercube Systems","authors":"Hsing-Lung Chen Hsing-Lung Chen, Nian-Feng Tzeng Nian-Feng Tzeng","doi":"10.1109/ICPP.1994.184","DOIUrl":"https://doi.org/10.1109/ICPP.1994.184","url":null,"abstract":"This article considers speedy task migration in that two disjoint paths are created between every pair of corresponding nodes for delivering migrated information simultaneously, reducing the size of data transmitted over a path and thus the migration time. All migration paths selected are pairwise disjoint and contain no link of active subcubes, so that task migration can be performed quickly and without interrupting the execution of other jobs.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127136725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes 全端口虫洞路由超立方体的最优广播
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.141
Ching-Tien Ho Ching-Tien Ho, Ming-Yang Kao Ming-Yang Kao
{"title":"Optimal Broadcast in All-Port Wormhole-Routed Hypercubes","authors":"Ching-Tien Ho Ching-Tien Ho, Ming-Yang Kao Ming-Yang Kao","doi":"10.1109/ICPP.1994.141","DOIUrl":"https://doi.org/10.1109/ICPP.1994.141","url":null,"abstract":"We give an optimal algorithm that broadcasts on an n-dimensional hypercube in Theta(n/ log_{2}(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n leqslant 7.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信