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

Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications最新文献

筛选
英文 中文
Simulating the dynamics of exible wood pulp bres in suspension 柔性木浆在悬浮状态下的动力学模拟
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-08-07 DOI: 10.1109/HPCSA.2002.1019149
J. Stockie
{"title":"Simulating the dynamics of exible wood pulp bres in suspension","authors":"J. Stockie","doi":"10.1109/HPCSA.2002.1019149","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019149","url":null,"abstract":"We investigate the dynamics of a flexible, elastic fibre, suspended in a fluid and subjected to a 3D shear flow. Simulations are performed using the “Immersed Boundary Method,” and are distinguished by their ability to capture the hydrodynamic interaction between the fluid and fibre, as well as the detailed structure of the individual fibres. Suspensions of flexible fibres are encountered in many industrial problems, although we focus in this work on the application to wood pulp fibre suspensions.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"45 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131358504","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
Distributed load balancing for molecular dynamics simulations 分子动力学模拟的分布式负载平衡
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019172
Angela Di Serio, M. Ibáñez-Espiga
{"title":"Distributed load balancing for molecular dynamics simulations","authors":"Angela Di Serio, M. Ibáñez-Espiga","doi":"10.1109/HPCSA.2002.1019172","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019172","url":null,"abstract":"We customize a dynamic load balancer to the molecular dynamics problem. The balancer is distributed, it requires no long-distance inter-process communications but only those among adjacent processors. It works accurately achieving significant time improvements when the system maintains moderate imbalance levels. The overhead is a problem only when the system does not achieve a minimum threshold imbalance.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"170 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541381","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
A fast algorithm for the computation of robust Q-mode principal component analysis in L 一种鲁棒q型主成分分析的快速算法
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019145
J. Almhana, V. Choulakian
{"title":"A fast algorithm for the computation of robust Q-mode principal component analysis in L","authors":"J. Almhana, V. Choulakian","doi":"10.1109/HPCSA.2002.1019145","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019145","url":null,"abstract":"In this paper, we propose a new method for the computation of the algorithm of robust Q-mode principal component analysis (RQMPCA) used in statistics. We will show how we can reduce the computation complexity of this algorithm by p, where p is the number of variables. An application, on web document retrieval time, was studied using this algorithm. We will report some statistical results on retrieval time and its relationship with document's size and its number of objects.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402254","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}
引用次数: 1
The waveform ICGS technique for parallel transient simulation of semiconductor devices 用于半导体器件并行瞬态仿真的波形ICGS技术
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019148
L. Yang
{"title":"The waveform ICGS technique for parallel transient simulation of semiconductor devices","authors":"L. Yang","doi":"10.1109/HPCSA.2002.1019148","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019148","url":null,"abstract":"In this paper, the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers are studied. These methods are competitive with standard pointwise methods on serial architectures, but are significantly faster on parallel computers. We make use of an improved parallel version of the conjugate gradient squared method (ICGS) combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems arising at each linearization step with waveform Newton. We reorganize the algorithm such that all the inner products, matrix-vector multiplications and vector updates of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. Therefore, the bottleneck of the performance, namely the cost of global communication on parallel distributed memory computers can be significantly reduced. The resulting ICGS algorithm maintains the favorable properties of the original algorithm while not increasing the computational costs.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115338191","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
Efficient all-to-all broadcast schemes in distributed-memory parallel computers 分布式内存并行计算机中高效的全对全广播方案
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019136
Eunseuk Oh, Iyad A. Kanj
{"title":"Efficient all-to-all broadcast schemes in distributed-memory parallel computers","authors":"Eunseuk Oh, Iyad A. Kanj","doi":"10.1109/HPCSA.2002.1019136","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019136","url":null,"abstract":"Distributed-memory parallel computers refer to parallel computers in which each processor has its own private memory. In such a system, processors communicate information by exchanging messages via the interconnection network rather than storing it in shared memory. One of the important communication methods in such systems is data broadcasting. All-to-all broadcasting is the process in which each processor sends its message to all other processors, and receives messages from all other processors in the system. Two complexity elements are usually considered when measuring the performance of a distributed-memory parallel model: time complexity and message complexity. In this paper we develop an efficient communication scheme to reduce both the communication time and the message complexity in the star network model under the half-duplex and full-duplex communication capability. The complexity measures of our scheme are compared against known bounds to verify the efficiency of the suggested scheme.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"16 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129713446","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
Efficient interval methods for finite element solutions 有限元解的有效区间法
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019150
R. Mullen, R. Muhanna
{"title":"Efficient interval methods for finite element solutions","authors":"R. Mullen, R. Muhanna","doi":"10.1109/HPCSA.2002.1019150","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019150","url":null,"abstract":"An efficient method for including the impact of uncertain input data along with the impact of truncation errors in finite element calculations is presented. This method is based on the theory of interval numbers. The formulation involves a predictor-corrector approach that allows for wide interval values as input and maintains sharp results during calculations. Results that illustrate the method's improved sharpness for solid mechanics problems are presented.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129428435","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}
引用次数: 6
MetaGrid: a scalable framework for wide-area service deployment and management MetaGrid:用于广域服务部署和管理的可伸缩框架
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019135
Muthucumaru Maheswaran, B. Maniymaran, P. Card, Farag Azzedin
{"title":"MetaGrid: a scalable framework for wide-area service deployment and management","authors":"Muthucumaru Maheswaran, B. Maniymaran, P. Card, Farag Azzedin","doi":"10.1109/HPCSA.2002.1019135","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019135","url":null,"abstract":"Presents an architecture called the MetaGrid based on Grid computing concepts for resource provisioning for wide-area network-enabled applications. Resource provisioning for wide-area applications can involve coordinated allocation of computing and communication resources. A Grid computing system provides a virtual framework that facilitates controlled resource sharing among different institutions. The MetaGrid extends the Grid computing systems in two major ways: (a) introduces a notion of SubGrid that provides a coarse-grained resource allocation class and (b) introduces a framework for interconnecting Grids by facilitating peering, trading, and brokering among the different Grids. The paper presents (a) the overall architecture of the MetaGrid with a description of the different functional components, (b) the resource allocation model that is introduced by the notion of SubGrids, and (c) strategies of interconnecting Grids.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131679709","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
Handoff in mobile ATM networks: framework for performance optimization 移动ATM网络中的切换:性能优化框架
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019134
S. Medidi, F. Golshani
{"title":"Handoff in mobile ATM networks: framework for performance optimization","authors":"S. Medidi, F. Golshani","doi":"10.1109/HPCSA.2002.1019134","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019134","url":null,"abstract":"Current handoff rerouting techniques in Mobile ATM networks fail to optimize some or all of the following parameters: handoff latency, route length, computational complexity, communication disruption period, network buffer requirements,a nd bandwidth requirements. This paper focuses on the optimization of the above parameters in the context of efficient handoff in Mobile ATM networks. We propose a framework for efficient handoff, in which the route information of a call in progress can be released to the communicating mobile hosts and theircorresponding switches. The switch covering the mobile host requesting handoff selects an appropriate rerouting process based on the route information and the location of the mobile hosts. A comparitive evaluation of our scheme with the existing schemes is presented.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442597","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
Using spare network computing power for genetic algorithm problems 利用备用网络计算能力求解遗传算法问题
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019163
A. Hamilton-Wright, D. Stacey
{"title":"Using spare network computing power for genetic algorithm problems","authors":"A. Hamilton-Wright, D. Stacey","doi":"10.1109/HPCSA.2002.1019163","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019163","url":null,"abstract":"Traditional network design incorporates a failure-recovery model in order to allow calculation of problems independent of knowledge of the network tool layer. This paper explores the possibilities of improving the calculation throughput by constructing a tool for the specific solution of problems which have an inherent ability to deal with partial calculation failure. Using a modified Genetic Algorithm as the client tool, the amount of information the network layer needs to have is brought to an extremely minimal level; this allows for a large scalability factor of the tool due to the reduction of network management tables.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124728522","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
Compiler support for automatic checkpointing 编译器支持自动检查点
Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications Pub Date : 2002-06-16 DOI: 10.1109/HPCSA.2002.1019157
Sung-Eun Choi, Steven J. Deitz
{"title":"Compiler support for automatic checkpointing","authors":"Sung-Eun Choi, Steven J. Deitz","doi":"10.1109/HPCSA.2002.1019157","DOIUrl":"https://doi.org/10.1109/HPCSA.2002.1019157","url":null,"abstract":"Checkpointing is a key technology for applications on large cluster computer systems. As cluster sizes grow, component failures will become a normal part of operation, and applications will have to deal more directly with repeated failures during program runs. We describe automatic checkpointing in the ZPL compiler and its advantages over traditional library or system-based approaches that have no information about application behavior. We show that even naive compiler-inserted checkpoints can significantly reduce the size of the checkpoint recovery data, up to 73% in our application suite. We also introduce the notion of checkpoint ranges, a range of code where processors can perform a local checkpoint at any time during the range. The compiler guarantees that these local checkpoints form a globally consistent checkpoint without global coordination by ensuring that there are no in-flight messages during the checkpoint range. Checkpoint ranges help further alleviate any additional network congestion caused by checkpointing.","PeriodicalId":111862,"journal":{"name":"Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124842193","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}
引用次数: 19
下一页 尾页
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学术官方微信