2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)最新文献

筛选
英文 中文
Efficient Sparse-Dense Matrix-Matrix Multiplication on GPUs Using the Customized Sparse Storage Format 使用自定义稀疏存储格式的gpu上的高效稀疏密集矩阵-矩阵乘法
2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2020-05-29 DOI: 10.1109/ICPADS51040.2020.00013
S. Shi, Qiang Wang, X. Chu
{"title":"Efficient Sparse-Dense Matrix-Matrix Multiplication on GPUs Using the Customized Sparse Storage Format","authors":"S. Shi, Qiang Wang, X. Chu","doi":"10.1109/ICPADS51040.2020.00013","DOIUrl":"https://doi.org/10.1109/ICPADS51040.2020.00013","url":null,"abstract":"Multiplication of a sparse matrix to a dense matrix (SpDM) is widely used in many areas like scientific computing and machine learning. However, existing work under-looks the performance optimization of SpDM on modern manycore architectures like GPUs. The storage data structures help sparse matrices store in a memory-saving format, but they bring difficulties in optimizing the performance of SpDM on modern GPUs due to irregular data access of the sparse structure, which results in lower resource utilization and poorer performance. In this paper, we refer to the roofline performance model of GPUs to design an efficient SpDM algorithm called GCOOSpDM, in which we exploit coalescent global memory access, fast shared memory reuse, and more operations per byte of global memory traffic. Experiments are evaluated on three Nvidia GPUs (i.e., GTX 980, GTX Titan X Pascal, and Tesla P100) using a large number of matrices including a public dataset and randomly generated matrices. Experimental results show that GCOOSpDM achieves 1.5-8x speedup over Nvidia's library cuSPARSE in many matrices.","PeriodicalId":196548,"journal":{"name":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125160993","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}
引用次数: 6
Contention resolution on a restrained channel 受约束通道上的争用解析
2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2020-05-18 DOI: 10.1109/ICPADS51040.2020.00022
Elijah Hradovich, M. Klonowski, D. Kowalski
{"title":"Contention resolution on a restrained channel","authors":"Elijah Hradovich, M. Klonowski, D. Kowalski","doi":"10.1109/ICPADS51040.2020.00022","DOIUrl":"https://doi.org/10.1109/ICPADS51040.2020.00022","url":null,"abstract":"We examine deterministic contention resolution on a multiple-access channel when packets are injected continuously by an adversary to the buffers of $n$ available stations in the system, arbitrarily at rate at most $rho$ packets per round. The aim is to successfully transmit packets and maintain system stability, that is, bounded queues, even in infinite executions. The largest injection rate for which a given contention resolution algorithm guaranties stability is called (algorithm's) throughput. In contrast to the previous work, we consider a channel in which there is a strict limit $k$ on the total number of stations allowed to transmit or listen to the channel at a given time, that can never be exceeded; we call such channel a $k$-restrained channel. We construct adaptive and full sensing protocols with optimal throughput 1 and almost optimal throughput $1-1/n$, respectively, in a constant-restrained channel. By contrast, we show that restricted protocols based on schedules known in advance obtain throughput at most $min{frac{k}{n}, frac{1}{3log n}}$. We also support our theoretical analysis by simulation results of our algorithms in systems of moderate, realistic sizes and scenarios, and compare them with popular backoff protocols.","PeriodicalId":196548,"journal":{"name":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782939","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}
引用次数: 4
Steering Committee 指导委员会
Csp Belden Menkus Cisa
{"title":"Steering Committee","authors":"Csp Belden Menkus Cisa","doi":"10.1080/07366989309451613","DOIUrl":"https://doi.org/10.1080/07366989309451613","url":null,"abstract":"","PeriodicalId":196548,"journal":{"name":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"117 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132242326","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
Message from the General Chair 主席致辞
2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2010-12-10 DOI: 10.1109/ISCIT.2010.5665184
K. Arakawa
{"title":"Message from the General Chair","authors":"K. Arakawa","doi":"10.1109/ISCIT.2010.5665184","DOIUrl":"https://doi.org/10.1109/ISCIT.2010.5665184","url":null,"abstract":"It is my great pleasure to host 2010 10th International Symposium on Communications and Information Technologies (ISCIT 2010). ISCIT is one of the most well known international symposiums on communications,signal processing,and information technologies. This symposium aims at gathering researchers,experts,and students from all over the world,exchanging their ideas and information,and contributing to the further development of communication and information technologies in the world.","PeriodicalId":196548,"journal":{"name":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121136780","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
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学术官方微信