用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Euro-Par 2019: Parallel Processing; 25th International C Ramin Yahyapour Conference proceedings 2019 Springer Nature Switzerland AG 2019 ar

[复制链接]
查看: 36968|回复: 55
发表于 2025-3-21 17:44:25 | 显示全部楼层 |阅读模式
书目名称Euro-Par 2019: Parallel Processing
副标题25th International C
编辑Ramin Yahyapour
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Euro-Par 2019: Parallel Processing; 25th International C Ramin Yahyapour Conference proceedings 2019 Springer Nature Switzerland AG 2019 ar
描述.This book constitutes the proceedings of the 25th International Conference on Parallel and Distributed Computing, Euro-Par 2019, held in Göttingen, Germany, in August 2019. ..The 36 full papers presented in this volume were carefully reviewed and selected from 142 submissions. They deal with parallel and distributed computing in general, focusing on support tools and environments; performance and power modeling, prediction and evaluation; scheduling and load balancing; high performance architectures and compilers; data management, analytics and deep learning; cluster and cloud computing; distributed systems and algorithms; parallel and distributed programming, interfaces, and languages; multicore and manycore parallelism; theory and algorithms for parallel computation and networking; parallel numerical methods and applications; accelerator computing; algorithms and systems for bioinformatics; and algorithms and systems for digital humanities.  .
出版日期Conference proceedings 2019
关键词artificial intelligence; clustering; computer architecture; computer systems; CUDA; data communication sy
版次1
doihttps://doi.org/10.1007/978-3-030-29400-7
isbn_softcover978-3-030-29399-4
isbn_ebook978-3-030-29400-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2019
The information of publication is updating

书目名称Euro-Par 2019: Parallel Processing影响因子(影响力)




书目名称Euro-Par 2019: Parallel Processing影响因子(影响力)学科排名




书目名称Euro-Par 2019: Parallel Processing网络公开度




书目名称Euro-Par 2019: Parallel Processing网络公开度学科排名




书目名称Euro-Par 2019: Parallel Processing被引频次




书目名称Euro-Par 2019: Parallel Processing被引频次学科排名




书目名称Euro-Par 2019: Parallel Processing年度引用




书目名称Euro-Par 2019: Parallel Processing年度引用学科排名




书目名称Euro-Par 2019: Parallel Processing读者反馈




书目名称Euro-Par 2019: Parallel Processing读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:40:12 | 显示全部楼层
发表于 2025-3-22 00:55:32 | 显示全部楼层
发表于 2025-3-22 06:57:51 | 显示全部楼层
Towards Portable Online Prediction of Network Utilization Using MPI-Level Monitoringe applications. A key ingredient to make this possible is an accurate prediction of the future network utilization, enabling the runtime to plan the background operations in advance, such as to avoid competing with the application for network bandwidth. In this paper, we propose a portable deep lear
发表于 2025-3-22 10:42:43 | 显示全部楼层
发表于 2025-3-22 15:03:25 | 显示全部楼层
发表于 2025-3-22 18:41:07 | 显示全部楼层
Combining Checkpointing and Data Compression to Accelerate Adjoint-Based Optimization Problems available computers. Data compression is an effective strategy to reduce this memory requirement by a certain factor, particularly if some loss in accuracy is acceptable. A popular alternative is checkpointing, where data is stored at selected points in time, and values at other times are recompute
发表于 2025-3-23 00:30:05 | 显示全部楼层
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packingatio better than 2 unless .. In this paper, we present an algorithm with approximation ratio 2 and running time . for both problems for . (and running time . for .). While a 2 approximation was known before, the running time of the algorithm is at least . in the worst case. Therefore, an . algorithm
发表于 2025-3-23 02:42:22 | 显示全部楼层
Scheduling on Two Unbounded Resources with Communication Costswe consider a platform with two types of machines, each containing an unbounded number of elements. We want to execute an application represented as a Directed Acyclic Graph (DAG) on this platform. Each task of the application has two possible execution times, depending on the type of machine it is
发表于 2025-3-23 06:22:47 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-19 05:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表