找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms for Parallel Processing; Michael T. Heath,Abhiram Ranade,Robert S. Schreibe Book 1999 Springer Science+Business Media New York

[复制链接]
查看: 52176|回复: 55
发表于 2025-3-21 17:33:40 | 显示全部楼层 |阅读模式
期刊全称Algorithms for Parallel Processing
影响因子2023Michael T. Heath,Abhiram Ranade,Robert S. Schreibe
视频video
学科分类The IMA Volumes in Mathematics and its Applications
图书封面Titlebook: Algorithms for Parallel Processing;  Michael T. Heath,Abhiram Ranade,Robert S. Schreibe Book 1999 Springer Science+Business Media New York
影响因子This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com­ puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett­ Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda­ tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work­ shop organizers were Abh
Pindex Book 1999
The information of publication is updating

书目名称Algorithms for Parallel Processing影响因子(影响力)




书目名称Algorithms for Parallel Processing影响因子(影响力)学科排名




书目名称Algorithms for Parallel Processing网络公开度




书目名称Algorithms for Parallel Processing网络公开度学科排名




书目名称Algorithms for Parallel Processing被引频次




书目名称Algorithms for Parallel Processing被引频次学科排名




书目名称Algorithms for Parallel Processing年度引用




书目名称Algorithms for Parallel Processing年度引用学科排名




书目名称Algorithms for Parallel Processing读者反馈




书目名称Algorithms for 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 23:30:39 | 显示全部楼层
发表于 2025-3-22 01:50:08 | 显示全部楼层
发表于 2025-3-22 08:13:44 | 显示全部楼层
发表于 2025-3-22 11:25:53 | 显示全部楼层
发表于 2025-3-22 15:40:09 | 显示全部楼层
发表于 2025-3-22 19:10:57 | 显示全部楼层
Coarsening, Sampling, and Smoothing: Elements of the Multilevel MethodThis paper presents a systematic treatment of the fundamental elements of the multilevel method. We illustrate, using examples from several fields, the importance and effectiveness of coarsening, sampling, and smoothing (local optimization) in the application of the multilevel method.
发表于 2025-3-23 00:54:28 | 显示全部楼层
Determining an out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programminggorithm’s I/O complexity on the Parallel Disk Model and show how to use dynamic programming to determine optimal splits at each recursive stage. The algorithm to determine the optimal splits takes only Θ(lg..) time for an .-point FFT, and it is practical. The out-of-core FFT algorithm itself takes considerably longer.
发表于 2025-3-23 03:53:52 | 显示全部楼层
Routing in Optical and Wireless Networksorks, where radio-wave interconnections are used for communication. For each model, we present background information and previous results, and also suggest several open problems whose solution would help us to better understand the capabilities and limitations of these classes of communication networks.
发表于 2025-3-23 05:50:43 | 显示全部楼层
Some Methods of Parallel Pseudorandom Number Generation quality in parallel applications. Several of these methods are currently part of scalable library for pseudorandom number generation, called SPRNG and available at the URL: www.ncsa.uiuc.edu/Apps/SPRNG.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-16 10:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表