找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Parallel Processing and Applied Mathematics; 11th International C Roman Wyrzykowski,Ewa Deelman,Kazimierz Wiatr Conference proceedings 2016

[复制链接]
楼主: Disaster
发表于 2025-3-25 03:51:10 | 显示全部楼层
Sparse Matrix Multiplication on Dataflow Enginesents. The proposed architecture allows replication of its blocks in order to parallelize the computation. The architecture is implemented on Maxeler dataflow engine based on Virtex 5 FPGA. The implementation results are given.
发表于 2025-3-25 07:42:13 | 显示全部楼层
发表于 2025-3-25 13:18:31 | 显示全部楼层
Parallel Algorithm for Quasi-Band Matrix-Matrix Multiplicationt an efficient algorithm for multiplying two such matrices on a many-core architecture such as a GPU..Our implementation outperforms the corresponding library implementation by a factor of 2x on average over a wide variety of quasi-band matrices from standard datasets. We analyze our performance over synthetic quasi-band matrices.
发表于 2025-3-25 16:47:42 | 显示全部楼层
Massively Parallel Approach to Sensitivity Analysis on HPC Architectures by Using Scalarm Platformate Sensitivity Analysis calculations by using modern e-infrastructures for distribution and parallelization purposes. The paper contains both description of the proposed solution and results obtained for a selected industrial case study.
发表于 2025-3-25 20:12:50 | 显示全部楼层
0302-9743 facilitate efficient and convenient utilization of modern parallel and distributed computing architectures, as well as on large-scale applications, including big data problems..978-3-319-32148-6978-3-319-32149-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-26 02:56:29 | 显示全部楼层
发表于 2025-3-26 05:38:25 | 显示全部楼层
Exploring Memory Error Vulnerability for Parallel Programming Modelsect of memory errors through program flow. Our results show the need for soft error resiliency methods based on memory behavior of programs, and the evaluation of the tradeoffs between performance and reliability.
发表于 2025-3-26 11:07:28 | 显示全部楼层
Performance Analysis of the Chebyshev Basis Conjugate Gradient Method on the K Computerdicates that the CBCG method is faster than CG method if the number of cores is sufficient large. We then measure the execution time of both methods on the K computer, and obtained results agree with our estimation.
发表于 2025-3-26 13:16:28 | 显示全部楼层
发表于 2025-3-26 18:33:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-8 19:30
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表