找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Memory Storage Patterns in Parallel Processing; Mary E. Mace Book 1987 Kluwer Academic Publishers 1987 algorithms.complexity.computer.grap

[复制链接]
查看: 7079|回复: 37
发表于 2025-3-21 18:22:51 | 显示全部楼层 |阅读模式
书目名称Memory Storage Patterns in Parallel Processing
编辑Mary E. Mace
视频video
丛书名称The Springer International Series in Engineering and Computer Science
图书封面Titlebook: Memory Storage Patterns in Parallel Processing;  Mary E. Mace Book 1987 Kluwer Academic Publishers 1987 algorithms.complexity.computer.grap
描述This project had its beginnings in the Fall of 1980. At that time Robert Wagner suggested that I investigate compiler optimi­ zation of data organization, suitable for use in a parallel or vector machine environment. We developed a scheme in which the compiler, having knowledge of the machine‘s access patterns, does a global analysis of a program‘s operations, and automatically determines optimum organization for the data. For example, for certain architectures and certain operations, large improvements in performance can be attained by storing a matrix in row major order. However a subsequent operation may require the matrix in column major order. A determination must be made whether or not it is the best solution globally to store the matrix in row order, column order, or even have two copies of it, each organized differently. We have developed two algorithms for making this determination. The technique shows promise in a vector machine environ­ ment, particularly if memory interleaving is used. Supercomputers such as the Cray, the CDC Cyber 205, the IBM 3090, as well as superminis such as the Convex are possible environments for implementation.
出版日期Book 1987
关键词algorithms; complexity; computer; graph algorithm; knowledge; memory; supercomputer
版次1
doihttps://doi.org/10.1007/978-1-4613-2001-2
isbn_softcover978-1-4612-9194-7
isbn_ebook978-1-4613-2001-2Series ISSN 0893-3405
issn_series 0893-3405
copyrightKluwer Academic Publishers 1987
The information of publication is updating

书目名称Memory Storage Patterns in Parallel Processing影响因子(影响力)




书目名称Memory Storage Patterns in Parallel Processing影响因子(影响力)学科排名




书目名称Memory Storage Patterns in Parallel Processing网络公开度




书目名称Memory Storage Patterns in Parallel Processing网络公开度学科排名




书目名称Memory Storage Patterns in Parallel Processing被引频次




书目名称Memory Storage Patterns in Parallel Processing被引频次学科排名




书目名称Memory Storage Patterns in Parallel Processing年度引用




书目名称Memory Storage Patterns in Parallel Processing年度引用学科排名




书目名称Memory Storage Patterns in Parallel Processing读者反馈




书目名称Memory Storage Patterns in Parallel Processing读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:24:04 | 显示全部楼层
发表于 2025-3-22 01:01:26 | 显示全部楼层
发表于 2025-3-22 05:15:37 | 显示全部楼层
Solution for Graphs without Shared Nodes,A tree is a directed acyclic graph with no shared nodes. In a tree every node has exactly one immediate ancestor. If the graph representing a program is a tree, then each result is used in exactly one operation after it is computed. Below is a diagram of a tree (left) and a graph which is not a tree (right).
发表于 2025-3-22 10:50:58 | 显示全部楼层
发表于 2025-3-22 12:55:12 | 显示全部楼层
发表于 2025-3-22 19:32:01 | 显示全部楼层
Solution for Graphs with Shared Nodes,epends on the graph having a certain structure which we call collapsible. A collapsible graph is a directed, acyclic graph which is series-parallel and includes treelike subgraphs. . A more precise definition of the collapsible graphs, which may be found in Appendix A, is not necessary to understand the collapsible graph algorithm.
发表于 2025-3-22 23:54:55 | 显示全部楼层
发表于 2025-3-23 01:22:52 | 显示全部楼层
发表于 2025-3-23 06:41:44 | 显示全部楼层
Book 1987ion. The technique shows promise in a vector machine environ­ ment, particularly if memory interleaving is used. Supercomputers such as the Cray, the CDC Cyber 205, the IBM 3090, as well as superminis such as the Convex are possible environments for implementation.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 19:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表