发布求助
文献互助 智能选刊 最新文献

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation最新文献

筛选
英文 中文
A graph-based subcube allocation and task migration in hypercube systems 超立方体系统中基于图的子多维数据集分配和任务迁移
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI: 10.1109/FMPC.1992.234931
O. Kang, B.M. Kim, H. Yoon, S. Maeng, J. Cho
{"title":"A graph-based subcube allocation and task migration in hypercube systems","authors":"O. Kang, B.M. Kim, H. Yoon, S. Maeng, J. Cho","doi":"10.1109/FMPC.1992.234931","DOIUrl":"https://doi.org/10.1109/FMPC.1992.234931","url":null,"abstract":"The authors propose a task migration scheme based on the HSA (heuristic subcube allocation) strategy to solve the fragmentation problem in a hypercube. This scheme, called CSC (complementary subcube coalescence), uses a heuristic and an undirected graph, called the SC (subcube) graph. If an incoming request is not satisfied due to the system fragmentation, the task migration scheme is performed to generate higher dimension subcubes. Simulation results show that the HSA strategy gives better efficiency than the Buddy and GC strategies in the adaptive mode. Moreover, the HSA strategy has a significantly lower migration cost than that of the Buddy and GC strategies.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127476663","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}
引用次数: 3
Embedding the hypercube into the 3-dimension mesh 将超立方体嵌入到三维网格中
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI: 10.1109/FMPC.1992.234916
S. L. Scott, J. Baker
{"title":"Embedding the hypercube into the 3-dimension mesh","authors":"S. L. Scott, J. Baker","doi":"10.1109/FMPC.1992.234916","DOIUrl":"https://doi.org/10.1109/FMPC.1992.234916","url":null,"abstract":"A constant time and space algorithm for embedding the hypercube architecture into the 3-dimension mesh (3D-mesh) is presented. This enables the cube/sub i/ operation to be performed on the embedded hypercube machine where the interprocessor communication function cube/sub i/ is defined on the embedded hypercube's PEs as cube/sub i/(b/sub n-1/...b/sub i/...b/sub 0/)=b/sub n-1/...b/sub i/...b/sub 0/ and b/sub i/ is the binary complement of b/sub i/.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130588144","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}
引用次数: 3
On the physical design of butterfly networks for PRAMs pram蝴蝶网物理设计研究
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI: 10.1109/FMPC.1992.234958
R. Drefenstedt, D. Schmidt
{"title":"On the physical design of butterfly networks for PRAMs","authors":"R. Drefenstedt, D. Schmidt","doi":"10.1109/FMPC.1992.234958","DOIUrl":"https://doi.org/10.1109/FMPC.1992.234958","url":null,"abstract":"The design of networks for massively parallel computers is strongly influenced by available technology. The network latency, critical for many applications, is significantly increased by packaging constraints, i.e. many connections between switches involving pad drivers or even line drivers. The authors concentrate on reducing those influences for a butterfly network related to Ranade's routing algorithm. Such a network is being implemented for a parallel RAM (PRAM) with 128 physical processors and 128 K logical processors. The required throughput makes it critical to use shared buses and improves the problem of space. While delays caused by switches can only be hidden by mapping many virtual processors to some physical ones, connection latency may be reduced by additional registers (shorter clock cycle time) and suitable mapping schemes (less space). Suitable clustering of processor modules and network parts may additionally decrease the network delay.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484880","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}
引用次数: 8
Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular lattices 所有极大等间距共线集和所有极大正则格的并行算法
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI: 10.1109/FMPC.1992.234905
L. Boxer, R. Miller
{"title":"Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular lattices","authors":"L. Boxer, R. Miller","doi":"10.1109/FMPC.1992.234905","DOIUrl":"https://doi.org/10.1109/FMPC.1992.234905","url":null,"abstract":"The authors present parallel solutions to the AMESCS (all maximal equally-spaced collinear subset) and AMRSS (all maximal regularly-spaced subset) problems and show how their solutions to the latter generalize to the AMRSDLS (all maximal regularly-spaced D-dimensional lattice subsets) problem. Their algorithms differ significantly from the optimal sequential algorithms presented in A.B. Kahng and G. Robins (1991), which do not scale well to (massively) parallel machines. The optimality of the authors' Arbitrary CRCW PRAM (parallel random access machine) algorithms is open; however, the algorithms they present are within a logarithmic factor of optimal. Further, the algorithms are optimal for the mesh-connected computer.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134179427","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
The virtual-time data-parallel machine 虚拟时间数据并行机
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1900-01-01 DOI: 10.1109/FMPC.1992.234906
S. Shen, L. Kleinrock
{"title":"The virtual-time data-parallel machine","authors":"S. Shen, L. Kleinrock","doi":"10.1109/FMPC.1992.234906","DOIUrl":"https://doi.org/10.1109/FMPC.1992.234906","url":null,"abstract":"The authors propose the virtual-time data-parallel machine to execute SIMD (single instruction multiple data) programs asynchronously. They first illustrate how asynchronous execution is more efficient than synchronous execution. For a simple model, they show that asynchronous execution outperforms synchronous execution roughly by a factor of (ln N), where N is the number of processors in the system. They then explore how to execute SIMD programs asynchronously without violating the SIMD semantics. They design a first in, first out (FIFO) priority cache, one for each processing element, to record the recent history of all variables. The cache, which is stacked between the processor and the memory, supports asynchronous execution in hardware efficiently and preserves the SIMD semantics of the software transparently. Analysis and simulation results indicate that the virtual-time data-parallel machine can achieve linear speed-up for computation-intensive data-parallel programs when the number of processors is large.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752250","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}
引用次数: 7
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信