Concurr. Pract. Exp.最新文献

筛选
英文 中文
Tiling on systems with communication/computation overlap 对通信/计算重叠的系统进行平铺
Concurr. Pract. Exp. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-9128(199903)11:3%3C139::AID-CPE370%3E3.0.CO;2-X
P. Calland, J. Dongarra, Y. Robert
{"title":"Tiling on systems with communication/computation overlap","authors":"P. Calland, J. Dongarra, Y. Robert","doi":"10.1002/(SICI)1096-9128(199903)11:3%3C139::AID-CPE370%3E3.0.CO;2-X","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199903)11:3%3C139::AID-CPE370%3E3.0.CO;2-X","url":null,"abstract":"SUMMARY In the framework of fully permutable loops, tiling is a compiler technique (also known as ‘loop blocking’) that has been extensively studied as a source-to-source program transformation. Little work has been devoted to the mapping and scheduling of the tiles on to physical parallel processors. We present several new results in the context of limited computational resources and assuming communication‐computation overlap. In particular, under some reasonable assumptions, we derive the optimal mapping and scheduling of tiles to physical processors. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113033","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}
引用次数: 12
Editorial: commercial and industrial applications: part 2 社论:商业和工业应用:第2部分
Concurr. Pract. Exp. Pub Date : 1999-02-01 DOI: 10.1002/(SICI)1096-9128(199902)11:2%3C69::AID-CPE434%3E3.0.CO;2-G
Mark Baker
{"title":"Editorial: commercial and industrial applications: part 2","authors":"Mark Baker","doi":"10.1002/(SICI)1096-9128(199902)11:2%3C69::AID-CPE434%3E3.0.CO;2-G","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199902)11:2%3C69::AID-CPE434%3E3.0.CO;2-G","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124274529","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
A computing framework for integrating interactive visualization in HPCC applications 在HPCC应用中集成交互式可视化的计算框架
Concurr. Pract. Exp. Pub Date : 1999-02-01 DOI: 10.1002/(SICI)1096-9128(199902)11:2%3C71::AID-CPE318%3E3.0.CO;2-W
Gang Cheng, Geoffrey C. Fox, Tseng-Hui Lin, T. Haupt
{"title":"A computing framework for integrating interactive visualization in HPCC applications","authors":"Gang Cheng, Geoffrey C. Fox, Tseng-Hui Lin, T. Haupt","doi":"10.1002/(SICI)1096-9128(199902)11:2%3C71::AID-CPE318%3E3.0.CO;2-W","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199902)11:2%3C71::AID-CPE318%3E3.0.CO;2-W","url":null,"abstract":"Network-based concurrent computing and interactive data visualization are two important components in industry applications of high-performance computing and communication. We propose an execution framework to build interactive remote visualization systems for real-world applications on heterogeneous parallel and distributed computers. Using a dataflow model of a commercial visualization software AVS in three case studies, we demonstrate a simple, effective, and modular approach to couple parallel simulation modules into an interactive remote visualization environment. The applications described in this paper are drawn from our industrial projects in financial modeling, computational electromagnetics and computational chemistry. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131765026","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
Parallel computation of three-dimensional nonlinear magnetostatic problems 三维非线性静磁问题的并行计算
Concurr. Pract. Exp. Pub Date : 1999-02-01 DOI: 10.1002/(SICI)1096-9128(199902)11:2%3C109::AID-CPE320%3E3.0.CO;2-8
D. Levine, W. Gropp, K. Forsman, L. Kettunen
{"title":"Parallel computation of three-dimensional nonlinear magnetostatic problems","authors":"D. Levine, W. Gropp, K. Forsman, L. Kettunen","doi":"10.1002/(SICI)1096-9128(199902)11:2%3C109::AID-CPE320%3E3.0.CO;2-8","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199902)11:2%3C109::AID-CPE320%3E3.0.CO;2-8","url":null,"abstract":"We describe a general-purpose parallel electromagnetic code for computing accurate solutions to large computationally demanding, 3D, nonlinear magnetostatic problems. The code, CORAL, is based on a volume integral equation formulation. Using an IBM SP parallel computer and iterative solution methods, we successfully solved the dense linear systems inherent in such formulations. A key component of our work was the use of the PETSc library, which provides parallel portability and access to the latest linear algebra solution technology.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132129814","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}
引用次数: 2
Parallel algorithms for corner stitching 角点拼接的并行算法
Concurr. Pract. Exp. Pub Date : 1998-12-25 DOI: 10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4
D. Mehta, E. D. Wilson
{"title":"Parallel algorithms for corner stitching","authors":"D. Mehta, E. D. Wilson","doi":"10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4","url":null,"abstract":"Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor. In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithms were implemented using C and PVM on a distributed network composed of SUN workstations. Experimental results show that significant speed-ups were obtained. 1998 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128032996","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}
引用次数: 2
The design and evaluation of a buffer algorithm for database machines 数据库机缓冲算法的设计与评价
Concurr. Pract. Exp. Pub Date : 1998-12-25 DOI: 10.1002/(SICI)1096-9128(19981225)10:15%3C1291::AID-CPE418%3E3.0.CO;2-K
F. F. Cai, M. Hull, D. Bell
{"title":"The design and evaluation of a buffer algorithm for database machines","authors":"F. F. Cai, M. Hull, D. Bell","doi":"10.1002/(SICI)1096-9128(19981225)10:15%3C1291::AID-CPE418%3E3.0.CO;2-K","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19981225)10:15%3C1291::AID-CPE418%3E3.0.CO;2-K","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999706","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
Performance of a backpropagation trained feedforward network on an MIMD architecture MIMD结构下反向传播训练前馈网络的性能
Concurr. Pract. Exp. Pub Date : 1998-12-10 DOI: 10.1002/(SICI)1096-9128(19981210)10:14%3C1223::AID-CPE372%3E3.0.CO;2-8
H. M. Abbas, M. Bayoumi
{"title":"Performance of a backpropagation trained feedforward network on an MIMD architecture","authors":"H. M. Abbas, M. Bayoumi","doi":"10.1002/(SICI)1096-9128(19981210)10:14%3C1223::AID-CPE372%3E3.0.CO;2-8","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19981210)10:14%3C1223::AID-CPE372%3E3.0.CO;2-8","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122507392","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}
引用次数: 2
PVaniM: a tool for visualization in network computing environments PVaniM:在网络计算环境中用于可视化的工具
Concurr. Pract. Exp. Pub Date : 1998-12-10 DOI: 10.1002/(SICI)1096-9128(19981210)10:14%3C1197::AID-CPE364%3E3.0.CO;2-O
B. Topol, J. Stasko, V. Sunderam
{"title":"PVaniM: a tool for visualization in network computing environments","authors":"B. Topol, J. Stasko, V. Sunderam","doi":"10.1002/(SICI)1096-9128(19981210)10:14%3C1197::AID-CPE364%3E3.0.CO;2-O","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19981210)10:14%3C1197::AID-CPE364%3E3.0.CO;2-O","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128516471","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}
引用次数: 49
DOVE: distributed objects based scientific visualization environment 基于分布式对象的科学可视化环境
Concurr. Pract. Exp. Pub Date : 1998-09-01 DOI: 10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1087::AID-CPE401%3E3.0.CO;2-Y
L. Jain, M. Abbott
{"title":"DOVE: distributed objects based scientific visualization environment","authors":"L. Jain, M. Abbott","doi":"10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1087::AID-CPE401%3E3.0.CO;2-Y","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1087::AID-CPE401%3E3.0.CO;2-Y","url":null,"abstract":"This paper describes the design and performance of a distributed, multi-tier architecture for scienti c data visualization. A novel aspect of this framework is its integration of Java IDL, the CORBA distributed object computing middleware with JavaBeans, the Java Component model to provide a exible, interactive framework for distributed, highperformance scienti c data visualization. CORBA server objects running in a distributed collaborative environment provide data acquisition and perform data-intensive computations. Clients as Java Bean components use these server objects for data retrieval and provide an environment for visualization. The server objects use JDBC, the Java application programming interface to SQL databases, to retrieve data from the database. We discuss the system framework and its components and describe an example application and its performance.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128376673","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}
引用次数: 5
Parallel Computer Algebra Software as a Web Component 作为Web组件的并行计算机代数软件
Concurr. Pract. Exp. Pub Date : 1998-09-01 DOI: 10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1179::AID-CPE407%3E3.0.CO;2-8
Andreas Weber, W. Küchlin, B. Eggers
{"title":"Parallel Computer Algebra Software as a Web Component","authors":"Andreas Weber, W. Küchlin, B. Eggers","doi":"10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1179::AID-CPE407%3E3.0.CO;2-8","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199809/11)10:11/13%3C1179::AID-CPE407%3E3.0.CO;2-8","url":null,"abstract":"In the field of computer algebra, joining separate computer algebra systems with individual strengths into problem solving environments is an important recent research direction. In this paper we describe how we wrapped a specialized computer algebra system, which uses shared-memory parallelism to speed up Grobner basis computations, into a Web component that can be used by other systems. By this component also a new algorithmic development in Grobner basis computations – the use of the Fractal Grobner Walk – was made available to various general purpose computer algebra systems in the form of a single optimized implementation. Previously, all of the important algorithmic improvements to an algorithm had to be reimplemented in the general purpose systems. Our implementation allows access to the Grobner basis computations via ‘intelligent’ graphical user interfaces and via scripting from existing general purpose algebra systems. © 1998 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"398 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130653684","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}
引用次数: 17
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学术官方微信